About the Execution of LoLa+red for PolyORBLF-COL-S04J06T10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 10670.052 | 1700055.00 | 1791930.00 | 5166.60 | F??FFFFF??FFF?FF | 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.r295-tall-167873947900436.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 lolaxred
Input is PolyORBLF-COL-S04J06T10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r295-tall-167873947900436
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 6.9K Feb 26 14:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 26 14:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 14:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 14:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 16:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 14:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 26 14:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 14:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 34K Feb 26 14:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 154K 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 PolyORBLF-COL-S04J06T10-LTLFireability-00
FORMULA_NAME PolyORBLF-COL-S04J06T10-LTLFireability-01
FORMULA_NAME PolyORBLF-COL-S04J06T10-LTLFireability-02
FORMULA_NAME PolyORBLF-COL-S04J06T10-LTLFireability-03
FORMULA_NAME PolyORBLF-COL-S04J06T10-LTLFireability-04
FORMULA_NAME PolyORBLF-COL-S04J06T10-LTLFireability-05
FORMULA_NAME PolyORBLF-COL-S04J06T10-LTLFireability-06
FORMULA_NAME PolyORBLF-COL-S04J06T10-LTLFireability-07
FORMULA_NAME PolyORBLF-COL-S04J06T10-LTLFireability-08
FORMULA_NAME PolyORBLF-COL-S04J06T10-LTLFireability-09
FORMULA_NAME PolyORBLF-COL-S04J06T10-LTLFireability-10
FORMULA_NAME PolyORBLF-COL-S04J06T10-LTLFireability-11
FORMULA_NAME PolyORBLF-COL-S04J06T10-LTLFireability-12
FORMULA_NAME PolyORBLF-COL-S04J06T10-LTLFireability-13
FORMULA_NAME PolyORBLF-COL-S04J06T10-LTLFireability-14
FORMULA_NAME PolyORBLF-COL-S04J06T10-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678842871906
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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S04J06T10
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 01:14:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-15 01:14:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 01:14: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-15 01:14:33] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 01:14:34] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 678 ms
[2023-03-15 01:14:34] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 966 PT places and 5456.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2023-03-15 01:14:34] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 7 ms.
[2023-03-15 01:14:34] [INFO ] Skeletonized 14 HLPN properties in 2 ms. Removed 2 properties that had guard overlaps.
Initial state reduction rules removed 2 formulas.
FORMULA PolyORBLF-COL-S04J06T10-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J06T10-LTLFireability-06 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 10000 steps, including 5 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 25) seen :24
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 01:14:34] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2023-03-15 01:14:34] [INFO ] Computed 26 place invariants in 16 ms
[2023-03-15 01:14:34] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
[2023-03-15 01:14:34] [INFO ] Flatten gal took : 45 ms
[2023-03-15 01:14:34] [INFO ] Flatten gal took : 7 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2023-03-15 01:14:34] [INFO ] Unfolded HLPN to a Petri net with 966 places and 5354 transitions 36134 arcs in 101 ms.
[2023-03-15 01:14:34] [INFO ] Unfolded 14 HLPN properties in 3 ms.
[2023-03-15 01:14:34] [INFO ] Reduced 2210 identical enabling conditions.
[2023-03-15 01:14:34] [INFO ] Reduced 2210 identical enabling conditions.
[2023-03-15 01:14:34] [INFO ] Reduced 2210 identical enabling conditions.
[2023-03-15 01:14:34] [INFO ] Reduced 440 identical enabling conditions.
[2023-03-15 01:14:34] [INFO ] Reduced 440 identical enabling conditions.
[2023-03-15 01:14:34] [INFO ] Reduced 2210 identical enabling conditions.
[2023-03-15 01:14:34] [INFO ] Reduced 60 identical enabling conditions.
Ensure Unique test removed 2710 transitions
Reduce redundant transitions removed 2710 transitions.
Support contains 304 out of 966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 966/966 places, 2644/2644 transitions.
Applied a total of 0 rules in 78 ms. Remains 966 /966 variables (removed 0) and now considering 2644/2644 (removed 0) transitions.
[2023-03-15 01:14:35] [INFO ] Flow matrix only has 2604 transitions (discarded 40 similar events)
// Phase 1: matrix 2604 rows 966 cols
[2023-03-15 01:14:35] [INFO ] Computed 62 place invariants in 146 ms
[2023-03-15 01:14:36] [INFO ] Dead Transitions using invariants and state equation in 1260 ms found 540 transitions.
Found 540 dead transitions using SMT.
Drop transitions removed 540 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 540 transitions.
[2023-03-15 01:14:36] [INFO ] Flow matrix only has 2064 transitions (discarded 40 similar events)
// Phase 1: matrix 2064 rows 966 cols
[2023-03-15 01:14:36] [INFO ] Computed 62 place invariants in 78 ms
[2023-03-15 01:14:36] [INFO ] Implicit Places using invariants in 551 ms returned []
[2023-03-15 01:14:36] [INFO ] Flow matrix only has 2064 transitions (discarded 40 similar events)
[2023-03-15 01:14:36] [INFO ] Invariant cache hit.
[2023-03-15 01:14:37] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 01:14:41] [INFO ] Implicit Places using invariants and state equation in 4630 ms returned []
Implicit Place search using SMT with State Equation took 5188 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 966/966 places, 2104/2644 transitions.
Applied a total of 0 rules in 22 ms. Remains 966 /966 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6551 ms. Remains : 966/966 places, 2104/2644 transitions.
Support contains 304 out of 966 places after structural reductions.
[2023-03-15 01:14:41] [INFO ] Flatten gal took : 234 ms
[2023-03-15 01:14:42] [INFO ] Flatten gal took : 183 ms
[2023-03-15 01:14:42] [INFO ] Input system was already deterministic with 2104 transitions.
Support contains 233 out of 966 places (down from 304) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 33) seen :32
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 01:14:42] [INFO ] Flow matrix only has 2064 transitions (discarded 40 similar events)
[2023-03-15 01:14:42] [INFO ] Invariant cache hit.
[2023-03-15 01:14:43] [INFO ] After 189ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA PolyORBLF-COL-S04J06T10-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 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(F((G((X((!p1 U (G(!p1)||p2)))&&p0))||(X((X(F(p4))&&(!p1 U (G(!p1)||p5))))&&p3)))))'
Support contains 42 out of 966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 966/966 places, 2104/2104 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 956 transition count 2094
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 956 transition count 2094
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 946 transition count 2084
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 946 transition count 2084
Applied a total of 40 rules in 105 ms. Remains 946 /966 variables (removed 20) and now considering 2084/2104 (removed 20) transitions.
[2023-03-15 01:14:43] [INFO ] Flow matrix only has 2044 transitions (discarded 40 similar events)
// Phase 1: matrix 2044 rows 946 cols
[2023-03-15 01:14:43] [INFO ] Computed 62 place invariants in 61 ms
[2023-03-15 01:14:44] [INFO ] Dead Transitions using invariants and state equation in 951 ms found 0 transitions.
[2023-03-15 01:14:44] [INFO ] Flow matrix only has 2044 transitions (discarded 40 similar events)
[2023-03-15 01:14:44] [INFO ] Invariant cache hit.
[2023-03-15 01:14:45] [INFO ] Implicit Places using invariants in 590 ms returned [748, 749, 750, 751, 752, 753, 754, 755, 756, 757]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 601 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 936/966 places, 2084/2104 transitions.
Applied a total of 0 rules in 35 ms. Remains 936 /936 variables (removed 0) and now considering 2084/2084 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1694 ms. Remains : 936/966 places, 2084/2104 transitions.
Stuttering acceptance computed with spot in 448 ms :[(OR (AND (NOT p0) p1 (NOT p5)) (AND p1 (NOT p2) (NOT p4)) (AND p1 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p5)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR (AND (NOT p0) p1 (NOT p5)) (AND p1 (NOT p2) (NOT p4)) (AND p1 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p5)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR (AND (NOT p0) p1 (NOT p5)) (AND p1 (NOT p2) (NOT p5)) (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p4))), (OR (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p4))), (OR (AND (NOT p0) p1 (NOT p5)) (AND p1 (NOT p2) (NOT p5)))]
Running random walk in product with property : PolyORBLF-COL-S04J06T10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p3), acceptance={} source=0 dest: 1}, { cond=p3, acceptance={} source=0 dest: 2}], [{ cond=(OR (AND p0 (NOT p3) (NOT p1)) (AND p0 (NOT p3) p2)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p3) p1 (NOT p2))), acceptance={0, 1} source=1 dest: 1}, { cond=(OR (AND p0 p3 (NOT p1)) (AND p0 p3 p2)), acceptance={0} source=1 dest: 2}, { cond=(OR (AND (NOT p0) p3) (AND p3 p1 (NOT p2))), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND p0 (NOT p3) (NOT p5) p1 p2), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p3) (NOT p5) p1) (AND (NOT p3) (NOT p5) p1 (NOT p2))), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 p3 (NOT p5) p1 p2), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p0) p3 (NOT p5) p1) (AND p3 (NOT p5) p1 (NOT p2))), acceptance={0, 1} source=2 dest: 2}, { cond=(OR p5 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p5) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p5) (NOT p1)), acceptance={1} source=2 dest: 4}], [{ cond=(OR (AND p0 (NOT p1) (NOT p4)) (AND p0 p2 (NOT p4))), acceptance={0} source=3 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p4)) (AND p1 (NOT p2) (NOT p4))), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND p0 (NOT p3) (NOT p5) p1 p2), acceptance={0} source=4 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p3) (NOT p5) p1) (AND (NOT p3) (NOT p5) p1 (NOT p2))), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p0 p3 (NOT p5) p1 p2), acceptance={0} source=4 dest: 2}, { cond=(OR (AND (NOT p0) p3 (NOT p5) p1) (AND p3 (NOT p5) p1 (NOT p2))), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p0 (NOT p5) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p5) (NOT p1)), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p3:(AND (OR (LT s415 1) (LT s420 1) (LT s430 1)) (OR (LT s415 1) (LT s420 1) (LT s432 1)) (OR (LT s415 1) (LT s425 1) (LT s427 1)) (OR (LT s415 1) (LT s41...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1462 reset in 7330 ms.
Product exploration explored 100000 steps with 1544 reset in 7562 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 p3 p0 (NOT p1) (NOT p2) (NOT p5) p4), (X (OR p5 (NOT p1))), (X (NOT (AND p0 (NOT p3) (NOT p5) p1 p2))), (X (NOT (OR (AND (NOT p0) p3 (NOT p5) p1) (AND p3 (NOT p5) p1 (NOT p2))))), (X (NOT (AND p0 p3 (NOT p5) p1 p2))), (X (AND p0 (NOT p5) (NOT p1))), (X (NOT (OR (AND (NOT p0) (NOT p3) (NOT p5) p1) (AND (NOT p3) (NOT p5) p1 (NOT p2))))), (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p3) p1 (NOT p2))))), (X (NOT (OR (AND p0 (NOT p3) (NOT p1)) (AND p0 (NOT p3) p2)))), (X (OR (AND p0 p3 (NOT p1)) (AND p0 p3 p2))), (X (NOT (OR (AND (NOT p0) p3) (AND p3 p1 (NOT p2))))), (X (NOT (AND (NOT p0) (NOT p5) (NOT p1)))), (X (X (NOT (AND p0 (NOT p3) (NOT p5) p1 p2)))), (X (X (AND p0 (NOT p5) (NOT p1)))), (X (X (NOT (OR (AND (NOT p0) (NOT p3) (NOT p5) p1) (AND (NOT p3) (NOT p5) p1 (NOT p2)))))), (X (X (NOT (OR (AND (NOT p0) (NOT p4)) (AND p1 (NOT p2) (NOT p4)))))), (X (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p3) p1 (NOT p2)))))), (X (X (NOT (OR (AND p0 (NOT p3) (NOT p1)) (AND p0 (NOT p3) p2))))), (X (X (NOT (AND (NOT p0) (NOT p5) (NOT p1))))), (X (X (OR p5 (NOT p1)))), (X (X (NOT (OR (AND (NOT p0) p3 (NOT p5) p1) (AND p3 (NOT p5) p1 (NOT p2)))))), (X (X (NOT (AND p0 p3 (NOT p5) p1 p2)))), (X (X (OR (AND p0 p3 (NOT p1)) (AND p0 p3 p2)))), (X (X (NOT (OR (AND (NOT p0) p3) (AND p3 p1 (NOT p2))))))]
False Knowledge obtained : [(X (X (OR (AND p0 (NOT p1) (NOT p4)) (AND p0 p2 (NOT p4))))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p4)) (AND p0 p2 (NOT p4))))))]
Knowledge based reduction with 24 factoid took 2927 ms. Reduced automaton from 5 states, 22 edges and 6 AP (stutter sensitive) to 5 states, 22 edges and 6 AP (stutter sensitive).
Stuttering acceptance computed with spot in 317 ms :[(OR (AND p1 (NOT p2) (NOT p5)) (AND p1 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) p1 (NOT p5)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR (AND p1 (NOT p2) (NOT p5)) (AND p1 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) p1 (NOT p5)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR (AND (NOT p0) p1 (NOT p5)) (AND p1 (NOT p2) (NOT p5)) (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p4))), (OR (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p4))), (OR (AND (NOT p0) p1 (NOT p5)) (AND p1 (NOT p2) (NOT p5)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 554 ms. (steps per millisecond=18 ) properties (out of 14) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 745 ms. (steps per millisecond=13 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 652 ms. (steps per millisecond=15 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 925 ms. (steps per millisecond=10 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 902 ms. (steps per millisecond=11 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 1060 ms. (steps per millisecond=9 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 540 ms. (steps per millisecond=18 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-15 01:15:09] [INFO ] Flow matrix only has 2044 transitions (discarded 40 similar events)
// Phase 1: matrix 2044 rows 936 cols
[2023-03-15 01:15:09] [INFO ] Computed 52 place invariants in 34 ms
[2023-03-15 01:15:15] [INFO ] After 206ms SMT Verify possible using all constraints in real domain returned unsat :6 sat :0
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND p3 p0 (NOT p1) (NOT p2) (NOT p5) p4), (X (OR p5 (NOT p1))), (X (NOT (AND p0 (NOT p3) (NOT p5) p1 p2))), (X (NOT (OR (AND (NOT p0) p3 (NOT p5) p1) (AND p3 (NOT p5) p1 (NOT p2))))), (X (NOT (AND p0 p3 (NOT p5) p1 p2))), (X (AND p0 (NOT p5) (NOT p1))), (X (NOT (OR (AND (NOT p0) (NOT p3) (NOT p5) p1) (AND (NOT p3) (NOT p5) p1 (NOT p2))))), (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p3) p1 (NOT p2))))), (X (NOT (OR (AND p0 (NOT p3) (NOT p1)) (AND p0 (NOT p3) p2)))), (X (OR (AND p0 p3 (NOT p1)) (AND p0 p3 p2))), (X (NOT (OR (AND (NOT p0) p3) (AND p3 p1 (NOT p2))))), (X (NOT (AND (NOT p0) (NOT p5) (NOT p1)))), (X (X (NOT (AND p0 (NOT p3) (NOT p5) p1 p2)))), (X (X (AND p0 (NOT p5) (NOT p1)))), (X (X (NOT (OR (AND (NOT p0) (NOT p3) (NOT p5) p1) (AND (NOT p3) (NOT p5) p1 (NOT p2)))))), (X (X (NOT (OR (AND (NOT p0) (NOT p4)) (AND p1 (NOT p2) (NOT p4)))))), (X (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p3) p1 (NOT p2)))))), (X (X (NOT (OR (AND p0 (NOT p3) (NOT p1)) (AND p0 (NOT p3) p2))))), (X (X (NOT (AND (NOT p0) (NOT p5) (NOT p1))))), (X (X (OR p5 (NOT p1)))), (X (X (NOT (OR (AND (NOT p0) p3 (NOT p5) p1) (AND p3 (NOT p5) p1 (NOT p2)))))), (X (X (NOT (AND p0 p3 (NOT p5) p1 p2)))), (X (X (OR (AND p0 p3 (NOT p1)) (AND p0 p3 p2)))), (X (X (NOT (OR (AND (NOT p0) p3) (AND p3 p1 (NOT p2)))))), (G (NOT (OR (AND p3 p1 (NOT p0) (NOT p5)) (AND p3 p1 (NOT p2) (NOT p5))))), (G (NOT (AND p3 p1 p0 p2 (NOT p5)))), (G (NOT (OR (AND p3 p1 (NOT p2)) (AND p3 (NOT p0))))), (G (NOT (AND (NOT p3) p1 p0 p2 (NOT p5)))), (G (NOT (OR (AND (NOT p3) (NOT p1) p0) (AND (NOT p3) p0 p2)))), (G (NOT (AND (NOT p1) (NOT p0) (NOT p5))))]
False Knowledge obtained : [(X (X (OR (AND p0 (NOT p1) (NOT p4)) (AND p0 p2 (NOT p4))))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p4)) (AND p0 p2 (NOT p4)))))), (F (NOT (OR (NOT p1) p5))), (F (NOT (OR (AND p3 (NOT p1) p0) (AND p3 p0 p2)))), (F (OR (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p4)))), (F (OR (AND (NOT p3) p1 (NOT p0) (NOT p5)) (AND (NOT p3) p1 (NOT p2) (NOT p5)))), (F (OR (AND (NOT p1) p0 (NOT p4)) (AND p0 p2 (NOT p4)))), (F (NOT p3)), (F (OR (AND (NOT p3) p1 (NOT p2)) (AND (NOT p3) (NOT p0)))), (F (NOT (AND (NOT p1) p0 (NOT p5))))]
Knowledge based reduction with 30 factoid took 3837 ms. Reduced automaton from 5 states, 22 edges and 6 AP (stutter sensitive) to 5 states, 12 edges and 6 AP (stutter sensitive).
Stuttering acceptance computed with spot in 284 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (AND p1 (NOT p2) (NOT p5)) (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p5)) (AND (NOT p0) (NOT p4))), (OR (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p4))), (OR (AND p1 (NOT p2) (NOT p5)) (AND (NOT p0) (NOT p5)))]
Stuttering acceptance computed with spot in 274 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (AND p1 (NOT p2) (NOT p5)) (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p5)) (AND (NOT p0) (NOT p4))), (OR (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p4))), (OR (AND p1 (NOT p2) (NOT p5)) (AND (NOT p0) (NOT p5)))]
Support contains 42 out of 936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 936/936 places, 2084/2084 transitions.
Applied a total of 0 rules in 19 ms. Remains 936 /936 variables (removed 0) and now considering 2084/2084 (removed 0) transitions.
[2023-03-15 01:15:19] [INFO ] Flow matrix only has 2044 transitions (discarded 40 similar events)
[2023-03-15 01:15:19] [INFO ] Invariant cache hit.
[2023-03-15 01:15:20] [INFO ] Dead Transitions using invariants and state equation in 892 ms found 0 transitions.
[2023-03-15 01:15:20] [INFO ] Flow matrix only has 2044 transitions (discarded 40 similar events)
[2023-03-15 01:15:20] [INFO ] Invariant cache hit.
[2023-03-15 01:15:21] [INFO ] Implicit Places using invariants in 622 ms returned []
[2023-03-15 01:15:21] [INFO ] Flow matrix only has 2044 transitions (discarded 40 similar events)
[2023-03-15 01:15:21] [INFO ] Invariant cache hit.
[2023-03-15 01:15:22] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 01:15:35] [INFO ] Implicit Places using invariants and state equation in 14640 ms returned []
Implicit Place search using SMT with State Equation took 15264 ms to find 0 implicit places.
[2023-03-15 01:15:35] [INFO ] Flow matrix only has 2044 transitions (discarded 40 similar events)
[2023-03-15 01:15:35] [INFO ] Invariant cache hit.
[2023-03-15 01:15:36] [INFO ] Dead Transitions using invariants and state equation in 829 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17007 ms. Remains : 936/936 places, 2084/2084 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p5) p3 p0 (NOT p2) p4), (X p3), (X (OR p1 p5 p3)), (X (OR p5 p3)), (X (AND p0 (NOT p1) (NOT p5) p3)), (X (NOT (OR (AND (NOT p0) (NOT p5)) (AND p1 (NOT p5) (NOT p2))))), (X (NOT (OR (NOT p0) (AND p1 (NOT p2))))), (X (X p3)), (X (X (OR p1 p5 p3))), (X (X (OR p5 p3))), (X (X (AND p0 (NOT p1) (NOT p5) p3))), (X (X (NOT (OR (AND (NOT p0) (NOT p5)) (AND p1 (NOT p5) (NOT p2)))))), (X (X (NOT (OR (AND (NOT p0) (NOT p4)) (AND p1 (NOT p2) (NOT p4)))))), (X (X (NOT (OR (NOT p0) (AND p1 (NOT p2))))))]
False Knowledge obtained : [(X (X (OR (AND p0 (NOT p1) (NOT p4)) (AND p0 p2 (NOT p4))))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p4)) (AND p0 p2 (NOT p4))))))]
Knowledge based reduction with 14 factoid took 1851 ms. Reduced automaton from 5 states, 12 edges and 6 AP (stutter sensitive) to 5 states, 12 edges and 6 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (AND p1 (NOT p2) (NOT p5)) (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p5)) (AND (NOT p0) (NOT p4))), (OR (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p4))), (OR (AND p1 (NOT p2) (NOT p5)) (AND (NOT p0) (NOT p5)))]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 370 ms. (steps per millisecond=27 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 375 ms. (steps per millisecond=26 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 01:15:39] [INFO ] Flow matrix only has 2044 transitions (discarded 40 similar events)
[2023-03-15 01:15:39] [INFO ] Invariant cache hit.
[2023-03-15 01:15:40] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p5) p3 p0 (NOT p2) p4), (X p3), (X (OR p1 p5 p3)), (X (OR p5 p3)), (X (AND p0 (NOT p1) (NOT p5) p3)), (X (NOT (OR (AND (NOT p0) (NOT p5)) (AND p1 (NOT p5) (NOT p2))))), (X (NOT (OR (NOT p0) (AND p1 (NOT p2))))), (X (X p3)), (X (X (OR p1 p5 p3))), (X (X (OR p5 p3))), (X (X (AND p0 (NOT p1) (NOT p5) p3))), (X (X (NOT (OR (AND (NOT p0) (NOT p5)) (AND p1 (NOT p5) (NOT p2)))))), (X (X (NOT (OR (AND (NOT p0) (NOT p4)) (AND p1 (NOT p2) (NOT p4)))))), (X (X (NOT (OR (NOT p0) (AND p1 (NOT p2)))))), (G (OR p1 p5 p3))]
False Knowledge obtained : [(X (X (OR (AND p0 (NOT p1) (NOT p4)) (AND p0 p2 (NOT p4))))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p4)) (AND p0 p2 (NOT p4)))))), (F (NOT (OR p5 p3))), (F (OR (AND p1 (NOT p2) (NOT p5)) (AND (NOT p0) (NOT p5)))), (F (OR (AND (NOT p1) p0 (NOT p4)) (AND p2 p0 (NOT p4)))), (F (NOT (AND (NOT p1) p0 (NOT p5) p3))), (F (NOT p3)), (F (OR (AND p1 (NOT p2)) (NOT p0))), (F (OR (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p4))))]
Knowledge based reduction with 15 factoid took 2086 ms. Reduced automaton from 5 states, 12 edges and 6 AP (stutter sensitive) to 5 states, 12 edges and 6 AP (stutter sensitive).
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (AND p1 (NOT p2) (NOT p5)) (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p5)) (AND (NOT p0) (NOT p4))), (OR (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p4))), (OR (AND p1 (NOT p2) (NOT p5)) (AND (NOT p0) (NOT p5)))]
Stuttering acceptance computed with spot in 272 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (AND p1 (NOT p2) (NOT p5)) (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p5)) (AND (NOT p0) (NOT p4))), (OR (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p4))), (OR (AND p1 (NOT p2) (NOT p5)) (AND (NOT p0) (NOT p5)))]
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (AND p1 (NOT p2) (NOT p5)) (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p5)) (AND (NOT p0) (NOT p4))), (OR (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p4))), (OR (AND p1 (NOT p2) (NOT p5)) (AND (NOT p0) (NOT p5)))]
Product exploration explored 100000 steps with 1547 reset in 4033 ms.
Product exploration explored 100000 steps with 1518 reset in 4032 ms.
Applying partial POR strategy [false, false, false, true, false]
Stuttering acceptance computed with spot in 296 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (AND p1 (NOT p2) (NOT p5)) (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p5)) (AND (NOT p0) (NOT p4))), (OR (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p4))), (OR (AND p1 (NOT p2) (NOT p5)) (AND (NOT p0) (NOT p5)))]
Support contains 42 out of 936 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 936/936 places, 2084/2084 transitions.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 936 transition count 2084
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 60 Pre rules applied. Total rules applied 50 place count 936 transition count 2164
Deduced a syphon composed of 110 places in 1 ms
Iterating global reduction 1 with 60 rules applied. Total rules applied 110 place count 936 transition count 2164
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 130 place count 916 transition count 2144
Deduced a syphon composed of 90 places in 3 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 150 place count 916 transition count 2144
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 210 places in 3 ms
Iterating global reduction 1 with 120 rules applied. Total rules applied 270 place count 916 transition count 2144
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 310 place count 876 transition count 2104
Deduced a syphon composed of 180 places in 3 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 350 place count 876 transition count 2104
Deduced a syphon composed of 180 places in 3 ms
Applied a total of 350 rules in 263 ms. Remains 876 /936 variables (removed 60) and now considering 2104/2084 (removed -20) transitions.
[2023-03-15 01:15:51] [INFO ] Flow matrix only has 2064 transitions (discarded 40 similar events)
// Phase 1: matrix 2064 rows 876 cols
[2023-03-15 01:15:52] [INFO ] Computed 52 place invariants in 42 ms
[2023-03-15 01:15:52] [INFO ] Dead Transitions using invariants and state equation in 1020 ms found 0 transitions.
[2023-03-15 01:15:53] [INFO ] Redundant transitions in 95 ms returned []
[2023-03-15 01:15:53] [INFO ] Flow matrix only has 2064 transitions (discarded 40 similar events)
[2023-03-15 01:15:53] [INFO ] Invariant cache hit.
[2023-03-15 01:15:54] [INFO ] Dead Transitions using invariants and state equation in 992 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 876/936 places, 2104/2084 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2377 ms. Remains : 876/936 places, 2104/2084 transitions.
Support contains 42 out of 936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 936/936 places, 2084/2084 transitions.
Applied a total of 0 rules in 14 ms. Remains 936 /936 variables (removed 0) and now considering 2084/2084 (removed 0) transitions.
[2023-03-15 01:15:54] [INFO ] Flow matrix only has 2044 transitions (discarded 40 similar events)
// Phase 1: matrix 2044 rows 936 cols
[2023-03-15 01:15:54] [INFO ] Computed 52 place invariants in 36 ms
[2023-03-15 01:15:55] [INFO ] Dead Transitions using invariants and state equation in 905 ms found 0 transitions.
[2023-03-15 01:15:55] [INFO ] Flow matrix only has 2044 transitions (discarded 40 similar events)
[2023-03-15 01:15:55] [INFO ] Invariant cache hit.
[2023-03-15 01:15:55] [INFO ] Implicit Places using invariants in 624 ms returned []
[2023-03-15 01:15:55] [INFO ] Flow matrix only has 2044 transitions (discarded 40 similar events)
[2023-03-15 01:15:55] [INFO ] Invariant cache hit.
[2023-03-15 01:15:56] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 01:16:05] [INFO ] Implicit Places using invariants and state equation in 9790 ms returned []
Implicit Place search using SMT with State Equation took 10416 ms to find 0 implicit places.
[2023-03-15 01:16:05] [INFO ] Flow matrix only has 2044 transitions (discarded 40 similar events)
[2023-03-15 01:16:05] [INFO ] Invariant cache hit.
[2023-03-15 01:16:06] [INFO ] Dead Transitions using invariants and state equation in 803 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12143 ms. Remains : 936/936 places, 2084/2084 transitions.
Treatment of property PolyORBLF-COL-S04J06T10-LTLFireability-00 finished in 82956 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(F(p1))&&p0)))'
Support contains 15 out of 966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 966/966 places, 2104/2104 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 962 transition count 2104
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 14 place count 952 transition count 2094
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 952 transition count 2094
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 34 place count 942 transition count 2084
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 942 transition count 2084
Applied a total of 44 rules in 46 ms. Remains 942 /966 variables (removed 24) and now considering 2084/2104 (removed 20) transitions.
[2023-03-15 01:16:06] [INFO ] Flow matrix only has 2044 transitions (discarded 40 similar events)
// Phase 1: matrix 2044 rows 942 cols
[2023-03-15 01:16:06] [INFO ] Computed 58 place invariants in 33 ms
[2023-03-15 01:16:07] [INFO ] Dead Transitions using invariants and state equation in 845 ms found 0 transitions.
[2023-03-15 01:16:07] [INFO ] Flow matrix only has 2044 transitions (discarded 40 similar events)
[2023-03-15 01:16:07] [INFO ] Invariant cache hit.
[2023-03-15 01:16:08] [INFO ] Implicit Places using invariants in 638 ms returned [744, 745, 746, 747, 748, 749, 750, 751, 752, 753]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 641 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 932/966 places, 2084/2104 transitions.
Applied a total of 0 rules in 18 ms. Remains 932 /932 variables (removed 0) and now considering 2084/2084 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1552 ms. Remains : 932/966 places, 2084/2104 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S04J06T10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (OR (LT s639 7) (LT s649 1) (LT s741 1) (LT s742 2)) (OR (LT s639 7) (LT s649 1) (LT s741 2) (LT s743 1)) (OR (LT s639 7) (LT s646 1) (LT s742 3))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 152 reset in 1452 ms.
Product exploration explored 100000 steps with 167 reset in 1466 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), true, (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 188 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p1), (NOT p1)]
Finished random walk after 34 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 296 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p1)]
Support contains 15 out of 932 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 932/932 places, 2084/2084 transitions.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 932 transition count 2024
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 120 place count 872 transition count 2024
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 120 Pre rules applied. Total rules applied 120 place count 872 transition count 1904
Deduced a syphon composed of 120 places in 2 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 240 rules applied. Total rules applied 360 place count 752 transition count 1904
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 2 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 560 place count 652 transition count 1804
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 570 place count 642 transition count 1794
Iterating global reduction 2 with 10 rules applied. Total rules applied 580 place count 642 transition count 1794
Applied a total of 580 rules in 147 ms. Remains 642 /932 variables (removed 290) and now considering 1794/2084 (removed 290) transitions.
[2023-03-15 01:16:12] [INFO ] Flow matrix only has 1754 transitions (discarded 40 similar events)
// Phase 1: matrix 1754 rows 642 cols
[2023-03-15 01:16:12] [INFO ] Computed 48 place invariants in 31 ms
[2023-03-15 01:16:13] [INFO ] Dead Transitions using invariants and state equation in 984 ms found 0 transitions.
[2023-03-15 01:16:13] [INFO ] Flow matrix only has 1754 transitions (discarded 40 similar events)
[2023-03-15 01:16:13] [INFO ] Invariant cache hit.
[2023-03-15 01:16:13] [INFO ] Implicit Places using invariants in 535 ms returned []
[2023-03-15 01:16:13] [INFO ] Flow matrix only has 1754 transitions (discarded 40 similar events)
[2023-03-15 01:16:13] [INFO ] Invariant cache hit.
[2023-03-15 01:16:14] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 01:18:53] [INFO ] Performed 199/642 implicitness test of which 0 returned IMPLICIT in 159 seconds.
[2023-03-15 01:18:53] [INFO ] Timeout of Implicit test with SMT after 159 seconds.
[2023-03-15 01:18:53] [INFO ] Implicit Places using invariants and state equation in 160026 ms returned []
Implicit Place search using SMT with State Equation took 160568 ms to find 0 implicit places.
[2023-03-15 01:18:53] [INFO ] Redundant transitions in 81 ms returned []
[2023-03-15 01:18:53] [INFO ] Flow matrix only has 1754 transitions (discarded 40 similar events)
[2023-03-15 01:18:53] [INFO ] Invariant cache hit.
[2023-03-15 01:18:54] [INFO ] Dead Transitions using invariants and state equation in 676 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 642/932 places, 1794/2084 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 162476 ms. Remains : 642/932 places, 1794/2084 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 : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 168 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
Finished random walk after 90 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=30 )
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 244 reset in 1518 ms.
Product exploration explored 100000 steps with 244 reset in 1572 ms.
Support contains 15 out of 642 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 642/642 places, 1794/1794 transitions.
Applied a total of 0 rules in 31 ms. Remains 642 /642 variables (removed 0) and now considering 1794/1794 (removed 0) transitions.
[2023-03-15 01:18:58] [INFO ] Flow matrix only has 1754 transitions (discarded 40 similar events)
[2023-03-15 01:18:58] [INFO ] Invariant cache hit.
[2023-03-15 01:18:58] [INFO ] Dead Transitions using invariants and state equation in 683 ms found 0 transitions.
[2023-03-15 01:18:58] [INFO ] Flow matrix only has 1754 transitions (discarded 40 similar events)
[2023-03-15 01:18:58] [INFO ] Invariant cache hit.
[2023-03-15 01:18:59] [INFO ] Implicit Places using invariants in 522 ms returned []
[2023-03-15 01:18:59] [INFO ] Flow matrix only has 1754 transitions (discarded 40 similar events)
[2023-03-15 01:18:59] [INFO ] Invariant cache hit.
[2023-03-15 01:18:59] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 01:19:09] [INFO ] Implicit Places using invariants and state equation in 10046 ms returned []
Implicit Place search using SMT with State Equation took 10570 ms to find 0 implicit places.
[2023-03-15 01:19:09] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-15 01:19:09] [INFO ] Flow matrix only has 1754 transitions (discarded 40 similar events)
[2023-03-15 01:19:09] [INFO ] Invariant cache hit.
[2023-03-15 01:19:10] [INFO ] Dead Transitions using invariants and state equation in 660 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11986 ms. Remains : 642/642 places, 1794/1794 transitions.
Treatment of property PolyORBLF-COL-S04J06T10-LTLFireability-01 finished in 183712 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(p1))||p0))))'
Support contains 21 out of 966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 966/966 places, 2104/2104 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 962 transition count 2104
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 14 place count 952 transition count 2094
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 952 transition count 2094
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 34 place count 942 transition count 2084
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 942 transition count 2084
Applied a total of 44 rules in 58 ms. Remains 942 /966 variables (removed 24) and now considering 2084/2104 (removed 20) transitions.
[2023-03-15 01:19:10] [INFO ] Flow matrix only has 2044 transitions (discarded 40 similar events)
// Phase 1: matrix 2044 rows 942 cols
[2023-03-15 01:19:10] [INFO ] Computed 58 place invariants in 37 ms
[2023-03-15 01:19:11] [INFO ] Dead Transitions using invariants and state equation in 811 ms found 0 transitions.
[2023-03-15 01:19:11] [INFO ] Flow matrix only has 2044 transitions (discarded 40 similar events)
[2023-03-15 01:19:11] [INFO ] Invariant cache hit.
[2023-03-15 01:19:11] [INFO ] Implicit Places using invariants in 781 ms returned [744, 745, 746, 747, 748, 749, 750, 751, 752, 753]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 787 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 932/966 places, 2084/2104 transitions.
Applied a total of 0 rules in 18 ms. Remains 932 /932 variables (removed 0) and now considering 2084/2084 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1686 ms. Remains : 932/966 places, 2084/2104 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S04J06T10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s772 1) (GEQ s773 1) (GEQ s768 1) (GEQ s769 1) (GEQ s770 1) (GEQ s771 1) (GEQ s764 1) (GEQ s765 1) (GEQ s766 1) (GEQ s767 1)), p1:(OR (AND (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1412 reset in 488 ms.
Product exploration explored 100000 steps with 1430 reset in 504 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 p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 162 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 82 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 5 factoid took 241 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-15 01:19:13] [INFO ] Flow matrix only has 2044 transitions (discarded 40 similar events)
// Phase 1: matrix 2044 rows 932 cols
[2023-03-15 01:19:13] [INFO ] Computed 48 place invariants in 38 ms
[2023-03-15 01:19:15] [INFO ] [Real]Absence check using 15 positive place invariants in 39 ms returned sat
[2023-03-15 01:19:15] [INFO ] [Real]Absence check using 15 positive and 33 generalized place invariants in 166 ms returned sat
[2023-03-15 01:19:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 01:19:17] [INFO ] [Real]Absence check using state equation in 2638 ms returned sat
[2023-03-15 01:19:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 01:19:19] [INFO ] [Nat]Absence check using 15 positive place invariants in 81 ms returned sat
[2023-03-15 01:19:19] [INFO ] [Nat]Absence check using 15 positive and 33 generalized place invariants in 363 ms returned sat
[2023-03-15 01:19:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 01:19:26] [INFO ] [Nat]Absence check using state equation in 7038 ms returned sat
[2023-03-15 01:19:26] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 01:19:29] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 01:19:32] [INFO ] [Nat]Added 200 Read/Feed constraints in 6076 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 21 out of 932 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 932/932 places, 2084/2084 transitions.
Applied a total of 0 rules in 31 ms. Remains 932 /932 variables (removed 0) and now considering 2084/2084 (removed 0) transitions.
[2023-03-15 01:19:32] [INFO ] Flow matrix only has 2044 transitions (discarded 40 similar events)
[2023-03-15 01:19:32] [INFO ] Invariant cache hit.
[2023-03-15 01:19:33] [INFO ] Dead Transitions using invariants and state equation in 871 ms found 0 transitions.
[2023-03-15 01:19:33] [INFO ] Flow matrix only has 2044 transitions (discarded 40 similar events)
[2023-03-15 01:19:33] [INFO ] Invariant cache hit.
[2023-03-15 01:19:34] [INFO ] Implicit Places using invariants in 668 ms returned []
[2023-03-15 01:19:34] [INFO ] Flow matrix only has 2044 transitions (discarded 40 similar events)
[2023-03-15 01:19:34] [INFO ] Invariant cache hit.
[2023-03-15 01:19:34] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 01:19:36] [INFO ] Implicit Places using invariants and state equation in 1872 ms returned []
Implicit Place search using SMT with State Equation took 2540 ms to find 0 implicit places.
[2023-03-15 01:19:36] [INFO ] Flow matrix only has 2044 transitions (discarded 40 similar events)
[2023-03-15 01:19:36] [INFO ] Invariant cache hit.
[2023-03-15 01:19:36] [INFO ] Dead Transitions using invariants and state equation in 801 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4253 ms. Remains : 932/932 places, 2084/2084 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 168 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 79 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=39 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 5 factoid took 202 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-15 01:19:37] [INFO ] Flow matrix only has 2044 transitions (discarded 40 similar events)
[2023-03-15 01:19:37] [INFO ] Invariant cache hit.
[2023-03-15 01:19:38] [INFO ] [Real]Absence check using 15 positive place invariants in 24 ms returned sat
[2023-03-15 01:19:38] [INFO ] [Real]Absence check using 15 positive and 33 generalized place invariants in 113 ms returned sat
[2023-03-15 01:19:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 01:19:41] [INFO ] [Real]Absence check using state equation in 2207 ms returned sat
[2023-03-15 01:19:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 01:19:42] [INFO ] [Nat]Absence check using 15 positive place invariants in 51 ms returned sat
[2023-03-15 01:19:42] [INFO ] [Nat]Absence check using 15 positive and 33 generalized place invariants in 173 ms returned sat
[2023-03-15 01:19:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 01:19:45] [INFO ] [Nat]Absence check using state equation in 3398 ms returned sat
[2023-03-15 01:19:45] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 01:19:48] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 01:19:51] [INFO ] [Nat]Added 200 Read/Feed constraints in 5217 ms returned sat
[2023-03-15 01:19:51] [INFO ] Deduced a trap composed of 82 places in 261 ms of which 2 ms to minimize.
[2023-03-15 01:19:52] [INFO ] Deduced a trap composed of 82 places in 252 ms of which 1 ms to minimize.
[2023-03-15 01:19:52] [INFO ] Deduced a trap composed of 82 places in 228 ms of which 14 ms to minimize.
[2023-03-15 01:19:52] [INFO ] Deduced a trap composed of 82 places in 157 ms of which 2 ms to minimize.
[2023-03-15 01:19:53] [INFO ] Deduced a trap composed of 82 places in 154 ms of which 1 ms to minimize.
[2023-03-15 01:19:53] [INFO ] Deduced a trap composed of 82 places in 93 ms of which 1 ms to minimize.
[2023-03-15 01:19:53] [INFO ] Deduced a trap composed of 82 places in 72 ms of which 0 ms to minimize.
[2023-03-15 01:19:53] [INFO ] Deduced a trap composed of 82 places in 51 ms of which 1 ms to minimize.
[2023-03-15 01:19:54] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3203 ms
[2023-03-15 01:19:54] [INFO ] Computed and/alt/rep : 1130/4346/1100 causal constraints (skipped 940 transitions) in 150 ms.
[2023-03-15 01:19:56] [INFO ] Deduced a trap composed of 528 places in 483 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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
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-15 01:19:56] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p0) (NOT p1))
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1408 reset in 462 ms.
Product exploration explored 100000 steps with 1439 reset in 417 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 21 out of 932 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 932/932 places, 2084/2084 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 932 transition count 2084
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 60 Pre rules applied. Total rules applied 40 place count 932 transition count 2164
Deduced a syphon composed of 100 places in 5 ms
Iterating global reduction 1 with 60 rules applied. Total rules applied 100 place count 932 transition count 2164
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 120 place count 912 transition count 2144
Deduced a syphon composed of 80 places in 2 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 140 place count 912 transition count 2144
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 240 places in 1 ms
Iterating global reduction 1 with 160 rules applied. Total rules applied 300 place count 912 transition count 2144
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 330 place count 882 transition count 2114
Deduced a syphon composed of 220 places in 2 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 360 place count 882 transition count 2114
Deduced a syphon composed of 220 places in 2 ms
Applied a total of 360 rules in 133 ms. Remains 882 /932 variables (removed 50) and now considering 2114/2084 (removed -30) transitions.
[2023-03-15 01:19:58] [INFO ] Flow matrix only has 2074 transitions (discarded 40 similar events)
// Phase 1: matrix 2074 rows 882 cols
[2023-03-15 01:19:58] [INFO ] Computed 48 place invariants in 36 ms
[2023-03-15 01:19:59] [INFO ] Dead Transitions using invariants and state equation in 1337 ms found 0 transitions.
[2023-03-15 01:19:59] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-15 01:19:59] [INFO ] Flow matrix only has 2074 transitions (discarded 40 similar events)
[2023-03-15 01:19:59] [INFO ] Invariant cache hit.
[2023-03-15 01:20:00] [INFO ] Dead Transitions using invariants and state equation in 989 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 882/932 places, 2114/2084 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2497 ms. Remains : 882/932 places, 2114/2084 transitions.
Support contains 21 out of 932 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 932/932 places, 2084/2084 transitions.
Applied a total of 0 rules in 14 ms. Remains 932 /932 variables (removed 0) and now considering 2084/2084 (removed 0) transitions.
[2023-03-15 01:20:00] [INFO ] Flow matrix only has 2044 transitions (discarded 40 similar events)
// Phase 1: matrix 2044 rows 932 cols
[2023-03-15 01:20:00] [INFO ] Computed 48 place invariants in 44 ms
[2023-03-15 01:20:01] [INFO ] Dead Transitions using invariants and state equation in 827 ms found 0 transitions.
[2023-03-15 01:20:01] [INFO ] Flow matrix only has 2044 transitions (discarded 40 similar events)
[2023-03-15 01:20:01] [INFO ] Invariant cache hit.
[2023-03-15 01:20:01] [INFO ] Implicit Places using invariants in 685 ms returned []
[2023-03-15 01:20:01] [INFO ] Flow matrix only has 2044 transitions (discarded 40 similar events)
[2023-03-15 01:20:01] [INFO ] Invariant cache hit.
[2023-03-15 01:20:02] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 01:20:03] [INFO ] Implicit Places using invariants and state equation in 1887 ms returned []
Implicit Place search using SMT with State Equation took 2573 ms to find 0 implicit places.
[2023-03-15 01:20:03] [INFO ] Flow matrix only has 2044 transitions (discarded 40 similar events)
[2023-03-15 01:20:03] [INFO ] Invariant cache hit.
[2023-03-15 01:20:04] [INFO ] Dead Transitions using invariants and state equation in 776 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4194 ms. Remains : 932/932 places, 2084/2084 transitions.
Treatment of property PolyORBLF-COL-S04J06T10-LTLFireability-02 finished in 54461 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 10 out of 966 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 966/966 places, 2104/2104 transitions.
Ensure Unique test removed 4 places
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 962 transition count 2014
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 180 place count 872 transition count 2014
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 120 Pre rules applied. Total rules applied 180 place count 872 transition count 1894
Deduced a syphon composed of 120 places in 1 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 240 rules applied. Total rules applied 420 place count 752 transition count 1894
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 2 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 620 place count 652 transition count 1794
Applied a total of 620 rules in 72 ms. Remains 652 /966 variables (removed 314) and now considering 1794/2104 (removed 310) transitions.
[2023-03-15 01:20:04] [INFO ] Flow matrix only has 1754 transitions (discarded 40 similar events)
// Phase 1: matrix 1754 rows 652 cols
[2023-03-15 01:20:04] [INFO ] Computed 58 place invariants in 34 ms
[2023-03-15 01:20:05] [INFO ] Dead Transitions using invariants and state equation in 744 ms found 0 transitions.
[2023-03-15 01:20:05] [INFO ] Flow matrix only has 1754 transitions (discarded 40 similar events)
[2023-03-15 01:20:05] [INFO ] Invariant cache hit.
[2023-03-15 01:20:06] [INFO ] Implicit Places using invariants in 591 ms returned [574, 575, 576, 577, 578, 579, 580, 581, 582, 583]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 593 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 642/966 places, 1794/2104 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 632 transition count 1784
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 632 transition count 1784
Applied a total of 20 rules in 36 ms. Remains 632 /642 variables (removed 10) and now considering 1784/1794 (removed 10) transitions.
[2023-03-15 01:20:06] [INFO ] Flow matrix only has 1744 transitions (discarded 40 similar events)
// Phase 1: matrix 1744 rows 632 cols
[2023-03-15 01:20:06] [INFO ] Computed 48 place invariants in 33 ms
[2023-03-15 01:20:06] [INFO ] Implicit Places using invariants in 589 ms returned []
[2023-03-15 01:20:06] [INFO ] Flow matrix only has 1744 transitions (discarded 40 similar events)
[2023-03-15 01:20:06] [INFO ] Invariant cache hit.
[2023-03-15 01:20:07] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 01:20:27] [INFO ] Implicit Places using invariants and state equation in 20595 ms returned []
Implicit Place search using SMT with State Equation took 21187 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 632/966 places, 1784/2104 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 22636 ms. Remains : 632/966 places, 1784/2104 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J06T10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s537 4) (GEQ s538 4) (GEQ s535 4) (GEQ s536 4) (GEQ s539 4) (GEQ s530 4) (GEQ s533 4) (GEQ s534 4) (GEQ s531 4) (GEQ s532 4))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 9228 steps with 0 reset in 39 ms.
FORMULA PolyORBLF-COL-S04J06T10-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J06T10-LTLFireability-03 finished in 22733 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(p1)||p0)))'
Support contains 28 out of 966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 966/966 places, 2104/2104 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 962 transition count 2104
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 14 place count 952 transition count 2094
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 952 transition count 2094
Applied a total of 24 rules in 37 ms. Remains 952 /966 variables (removed 14) and now considering 2094/2104 (removed 10) transitions.
[2023-03-15 01:20:27] [INFO ] Flow matrix only has 2054 transitions (discarded 40 similar events)
// Phase 1: matrix 2054 rows 952 cols
[2023-03-15 01:20:27] [INFO ] Computed 58 place invariants in 39 ms
[2023-03-15 01:20:28] [INFO ] Dead Transitions using invariants and state equation in 831 ms found 0 transitions.
[2023-03-15 01:20:28] [INFO ] Flow matrix only has 2054 transitions (discarded 40 similar events)
[2023-03-15 01:20:28] [INFO ] Invariant cache hit.
[2023-03-15 01:20:28] [INFO ] Implicit Places using invariants in 569 ms returned [744, 745, 746, 747, 748, 749, 750, 751, 752, 753]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 571 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 942/966 places, 2094/2104 transitions.
Applied a total of 0 rules in 17 ms. Remains 942 /942 variables (removed 0) and now considering 2094/2094 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1458 ms. Remains : 942/966 places, 2094/2104 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-COL-S04J06T10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (LT s749 1) (LT s748 1) (LT s747 1) (LT s746 1) (LT s753 1) (LT s752 1) (LT s751 1) (LT s750 1) (LT s745 1) (LT s744 1)), p0:(OR (GEQ s749 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 96 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S04J06T10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J06T10-LTLFireability-07 finished in 1596 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((X(((G(F(!p2))||p1) U (!p3&&(G(F(!p2))||p4))))||p0)))'
Support contains 40 out of 966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 966/966 places, 2104/2104 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 962 transition count 2104
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 14 place count 952 transition count 2094
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 952 transition count 2094
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 34 place count 942 transition count 2084
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 942 transition count 2084
Applied a total of 44 rules in 46 ms. Remains 942 /966 variables (removed 24) and now considering 2084/2104 (removed 20) transitions.
[2023-03-15 01:20:29] [INFO ] Flow matrix only has 2044 transitions (discarded 40 similar events)
// Phase 1: matrix 2044 rows 942 cols
[2023-03-15 01:20:29] [INFO ] Computed 58 place invariants in 41 ms
[2023-03-15 01:20:29] [INFO ] Dead Transitions using invariants and state equation in 829 ms found 0 transitions.
[2023-03-15 01:20:29] [INFO ] Flow matrix only has 2044 transitions (discarded 40 similar events)
[2023-03-15 01:20:29] [INFO ] Invariant cache hit.
[2023-03-15 01:20:30] [INFO ] Implicit Places using invariants in 602 ms returned [744, 745, 746, 747, 748, 749, 750, 751, 752, 753]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 604 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 932/966 places, 2084/2104 transitions.
Applied a total of 0 rules in 16 ms. Remains 932 /932 variables (removed 0) and now considering 2084/2084 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1496 ms. Remains : 932/966 places, 2084/2104 transitions.
Stuttering acceptance computed with spot in 153 ms :[(OR (AND (NOT p0) p2 (NOT p4)) (AND (NOT p0) p3)), (OR (AND (NOT p0) p2 (NOT p4)) (AND (NOT p0) p3)), (OR (AND (NOT p0) p2 (NOT p4)) (AND (NOT p0) p2 p3)), (OR (AND (NOT p0) p2 (NOT p4)) (AND (NOT p0) p2 p3))]
Running random walk in product with property : PolyORBLF-COL-S04J06T10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p3), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p4)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p3) (NOT p4) p2), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p0) p3) (AND (NOT p0) (NOT p4))), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p0) p3 p2) (AND (NOT p0) (NOT p4) p2)), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p0) p3 p2) (AND (NOT p0) (NOT p4) p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s244 1) (GEQ s452 1) (GEQ s794 1)) (AND (GEQ s244 1) (GEQ s447 1) (GEQ s794 1)) (AND (GEQ s244 1) (GEQ s451 1) (GEQ s794 1)) (AND (GEQ s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3044 reset in 695 ms.
Product exploration explored 100000 steps with 3032 reset in 712 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 p0) p3 (NOT p4) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p3) (NOT p4) p2))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p4)))), (X (AND (NOT p0) p3)), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p4) p2)))), (X (X (OR (AND (NOT p0) p3) (AND (NOT p0) (NOT p4))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p4))))), (X (X (NOT (OR (AND (NOT p0) p3 p2) (AND (NOT p0) (NOT p4) p2))))), (X (X (AND (NOT p0) p3)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 431 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(OR (AND (NOT p0) p2 (NOT p4)) (AND (NOT p0) p3)), (OR (AND (NOT p0) p2 (NOT p4)) (AND (NOT p0) p3)), (OR (AND (NOT p0) p2 (NOT p4)) (AND (NOT p0) p2 p3)), (OR (AND (NOT p0) p2 (NOT p4)) (AND (NOT p0) p2 p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-15 01:20:33] [INFO ] Flow matrix only has 2044 transitions (discarded 40 similar events)
// Phase 1: matrix 2044 rows 932 cols
[2023-03-15 01:20:33] [INFO ] Computed 48 place invariants in 30 ms
[2023-03-15 01:20:33] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p3 (NOT p4) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p3) (NOT p4) p2))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p4)))), (X (AND (NOT p0) p3)), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p4) p2)))), (X (X (OR (AND (NOT p0) p3) (AND (NOT p0) (NOT p4))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p4))))), (X (X (NOT (OR (AND (NOT p0) p3 p2) (AND (NOT p0) (NOT p4) p2))))), (X (X (AND (NOT p0) p3))), (G (NOT (AND (NOT p4) p2 (NOT p0) (NOT p3)))), (G (NOT (AND (NOT p4) (NOT p0) (NOT p3))))]
False Knowledge obtained : [(F (OR (AND (NOT p4) p2 (NOT p0)) (AND p2 (NOT p0) p3))), (F (NOT (OR (AND (NOT p4) (NOT p0)) (AND (NOT p0) p3)))), (F (NOT (AND (NOT p0) p3)))]
Knowledge based reduction with 11 factoid took 482 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 2 states, 2 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) p3), (AND (NOT p0) p3)]
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) p3), (AND (NOT p0) p3)]
[2023-03-15 01:20:34] [INFO ] Flow matrix only has 2044 transitions (discarded 40 similar events)
[2023-03-15 01:20:34] [INFO ] Invariant cache hit.
[2023-03-15 01:20:35] [INFO ] [Real]Absence check using 15 positive place invariants in 24 ms returned sat
[2023-03-15 01:20:35] [INFO ] [Real]Absence check using 15 positive and 33 generalized place invariants in 94 ms returned sat
[2023-03-15 01:20:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 01:20:36] [INFO ] [Real]Absence check using state equation in 1594 ms returned sat
[2023-03-15 01:20:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 01:20:38] [INFO ] [Nat]Absence check using 15 positive place invariants in 20 ms returned sat
[2023-03-15 01:20:38] [INFO ] [Nat]Absence check using 15 positive and 33 generalized place invariants in 97 ms returned sat
[2023-03-15 01:20:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 01:20:44] [INFO ] [Nat]Absence check using state equation in 6413 ms returned sat
[2023-03-15 01:20:44] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 01:20:47] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 01:20:50] [INFO ] [Nat]Added 200 Read/Feed constraints in 6017 ms returned unknown
Could not prove EG (AND (NOT p0) p3)
Support contains 12 out of 932 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 932/932 places, 2084/2084 transitions.
Applied a total of 0 rules in 20 ms. Remains 932 /932 variables (removed 0) and now considering 2084/2084 (removed 0) transitions.
[2023-03-15 01:20:50] [INFO ] Flow matrix only has 2044 transitions (discarded 40 similar events)
[2023-03-15 01:20:50] [INFO ] Invariant cache hit.
[2023-03-15 01:20:51] [INFO ] Dead Transitions using invariants and state equation in 805 ms found 0 transitions.
[2023-03-15 01:20:51] [INFO ] Flow matrix only has 2044 transitions (discarded 40 similar events)
[2023-03-15 01:20:51] [INFO ] Invariant cache hit.
[2023-03-15 01:20:52] [INFO ] Implicit Places using invariants in 594 ms returned []
[2023-03-15 01:20:52] [INFO ] Flow matrix only has 2044 transitions (discarded 40 similar events)
[2023-03-15 01:20:52] [INFO ] Invariant cache hit.
[2023-03-15 01:20:52] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 01:20:53] [INFO ] Implicit Places using invariants and state equation in 1729 ms returned []
Implicit Place search using SMT with State Equation took 2325 ms to find 0 implicit places.
[2023-03-15 01:20:53] [INFO ] Flow matrix only has 2044 transitions (discarded 40 similar events)
[2023-03-15 01:20:53] [INFO ] Invariant cache hit.
[2023-03-15 01:20:54] [INFO ] Dead Transitions using invariants and state equation in 801 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3960 ms. Remains : 932/932 places, 2084/2084 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p3), (X (AND (NOT p0) p3)), (X (X (AND (NOT p0) p3)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) p3)]
Finished random walk after 32 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=32 )
Knowledge obtained : [(AND (NOT p0) p3), (X (AND (NOT p0) p3)), (X (X (AND (NOT p0) p3)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p3)))]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(AND (NOT p0) p3)]
Stuttering acceptance computed with spot in 24 ms :[(AND (NOT p0) p3)]
[2023-03-15 01:20:55] [INFO ] Flow matrix only has 2044 transitions (discarded 40 similar events)
[2023-03-15 01:20:55] [INFO ] Invariant cache hit.
[2023-03-15 01:20:56] [INFO ] [Real]Absence check using 15 positive place invariants in 24 ms returned sat
[2023-03-15 01:20:56] [INFO ] [Real]Absence check using 15 positive and 33 generalized place invariants in 94 ms returned sat
[2023-03-15 01:20:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 01:20:57] [INFO ] [Real]Absence check using state equation in 1584 ms returned sat
[2023-03-15 01:20:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 01:20:59] [INFO ] [Nat]Absence check using 15 positive place invariants in 20 ms returned sat
[2023-03-15 01:20:59] [INFO ] [Nat]Absence check using 15 positive and 33 generalized place invariants in 96 ms returned sat
[2023-03-15 01:20:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 01:21:05] [INFO ] [Nat]Absence check using state equation in 6403 ms returned sat
[2023-03-15 01:21:05] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 01:21:08] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 01:21:10] [INFO ] [Nat]Added 200 Read/Feed constraints in 4672 ms returned sat
[2023-03-15 01:21:10] [INFO ] Deduced a trap composed of 82 places in 65 ms of which 0 ms to minimize.
[2023-03-15 01:21:12] [INFO ] Deduced a trap composed of 82 places in 71 ms of which 0 ms to minimize.
[2023-03-15 01:21:13] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 2600 ms
Could not prove EG (AND (NOT p0) p3)
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) p3)]
Product exploration explored 100000 steps with 3053 reset in 467 ms.
Product exploration explored 100000 steps with 3069 reset in 491 ms.
Support contains 12 out of 932 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 932/932 places, 2084/2084 transitions.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 932 transition count 2024
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 120 place count 872 transition count 2024
Performed 130 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 130 Pre rules applied. Total rules applied 120 place count 872 transition count 1894
Deduced a syphon composed of 130 places in 1 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 260 rules applied. Total rules applied 380 place count 742 transition count 1894
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 2 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 560 place count 652 transition count 1804
Applied a total of 560 rules in 63 ms. Remains 652 /932 variables (removed 280) and now considering 1804/2084 (removed 280) transitions.
[2023-03-15 01:21:14] [INFO ] Flow matrix only has 1764 transitions (discarded 40 similar events)
// Phase 1: matrix 1764 rows 652 cols
[2023-03-15 01:21:14] [INFO ] Computed 48 place invariants in 32 ms
[2023-03-15 01:21:14] [INFO ] Dead Transitions using invariants and state equation in 740 ms found 0 transitions.
[2023-03-15 01:21:14] [INFO ] Flow matrix only has 1764 transitions (discarded 40 similar events)
[2023-03-15 01:21:14] [INFO ] Invariant cache hit.
[2023-03-15 01:21:15] [INFO ] Implicit Places using invariants in 565 ms returned []
[2023-03-15 01:21:15] [INFO ] Flow matrix only has 1764 transitions (discarded 40 similar events)
[2023-03-15 01:21:15] [INFO ] Invariant cache hit.
[2023-03-15 01:21:15] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 01:21:25] [INFO ] Implicit Places using invariants and state equation in 9741 ms returned []
Implicit Place search using SMT with State Equation took 10308 ms to find 0 implicit places.
[2023-03-15 01:21:25] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-15 01:21:25] [INFO ] Flow matrix only has 1764 transitions (discarded 40 similar events)
[2023-03-15 01:21:25] [INFO ] Invariant cache hit.
[2023-03-15 01:21:25] [INFO ] Dead Transitions using invariants and state equation in 672 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 652/932 places, 1804/2084 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11814 ms. Remains : 652/932 places, 1804/2084 transitions.
Treatment of property PolyORBLF-COL-S04J06T10-LTLFireability-08 finished in 56925 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(((F((p1&&F(!p2))) U X(p3))||p0)))'
Support contains 28 out of 966 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 966/966 places, 2104/2104 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 962 transition count 2104
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 14 place count 952 transition count 2094
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 952 transition count 2094
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 34 place count 942 transition count 2084
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 942 transition count 2084
Applied a total of 44 rules in 50 ms. Remains 942 /966 variables (removed 24) and now considering 2084/2104 (removed 20) transitions.
[2023-03-15 01:21:26] [INFO ] Flow matrix only has 2044 transitions (discarded 40 similar events)
// Phase 1: matrix 2044 rows 942 cols
[2023-03-15 01:21:26] [INFO ] Computed 58 place invariants in 43 ms
[2023-03-15 01:21:26] [INFO ] Dead Transitions using invariants and state equation in 819 ms found 0 transitions.
[2023-03-15 01:21:26] [INFO ] Flow matrix only has 2044 transitions (discarded 40 similar events)
[2023-03-15 01:21:26] [INFO ] Invariant cache hit.
[2023-03-15 01:21:27] [INFO ] Implicit Places using invariants in 605 ms returned []
[2023-03-15 01:21:27] [INFO ] Flow matrix only has 2044 transitions (discarded 40 similar events)
[2023-03-15 01:21:27] [INFO ] Invariant cache hit.
[2023-03-15 01:21:28] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 01:24:07] [INFO ] Performed 216/942 implicitness test of which 0 returned IMPLICIT in 159 seconds.
[2023-03-15 01:24:07] [INFO ] Timeout of Implicit test with SMT after 159 seconds.
[2023-03-15 01:24:07] [INFO ] Implicit Places using invariants and state equation in 160014 ms returned []
Implicit Place search using SMT with State Equation took 160620 ms to find 0 implicit places.
[2023-03-15 01:24:07] [INFO ] Flow matrix only has 2044 transitions (discarded 40 similar events)
[2023-03-15 01:24:07] [INFO ] Invariant cache hit.
[2023-03-15 01:24:08] [INFO ] Dead Transitions using invariants and state equation in 782 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 942/966 places, 2084/2104 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 162275 ms. Remains : 942/966 places, 2084/2104 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : PolyORBLF-COL-S04J06T10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s559 1) (GEQ s564 1)) (AND (GEQ s559 1) (GEQ s563 1)) (AND (GEQ s559 1) (GEQ s562 1)) (AND (GEQ s559 1) (GEQ s561 1)) (AND (GEQ s559 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1653 reset in 580 ms.
Product exploration explored 100000 steps with 1675 reset in 596 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 p0) (NOT p3)), (X (AND (NOT p0) (NOT p3))), (X (X (AND (NOT p0) (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p0) (NOT p3))]
Finished random walk after 44 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=44 )
Knowledge obtained : [(AND (NOT p0) (NOT p3)), (X (AND (NOT p0) (NOT p3))), (X (X (AND (NOT p0) (NOT p3))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p3))))]
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p0) (NOT p3))]
[2023-03-15 01:24:09] [INFO ] Flow matrix only has 2044 transitions (discarded 40 similar events)
[2023-03-15 01:24:09] [INFO ] Invariant cache hit.
[2023-03-15 01:24:11] [INFO ] [Real]Absence check using 17 positive place invariants in 34 ms returned sat
[2023-03-15 01:24:11] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 200 ms returned sat
[2023-03-15 01:24:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 01:24:13] [INFO ] [Real]Absence check using state equation in 1889 ms returned sat
[2023-03-15 01:24:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 01:24:15] [INFO ] [Nat]Absence check using 17 positive place invariants in 47 ms returned sat
[2023-03-15 01:24:15] [INFO ] [Nat]Absence check using 17 positive and 41 generalized place invariants in 190 ms returned sat
[2023-03-15 01:24:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 01:24:25] [INFO ] [Nat]Absence check using state equation in 9356 ms returned sat
[2023-03-15 01:24:25] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 01:24:28] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 01:24:28] [INFO ] [Nat]Added 200 Read/Feed constraints in 3733 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p3))
Support contains 28 out of 942 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 942/942 places, 2084/2084 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 942 transition count 2054
Reduce places removed 30 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 1 with 50 rules applied. Total rules applied 80 place count 912 transition count 2034
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 100 place count 892 transition count 2034
Performed 130 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 130 Pre rules applied. Total rules applied 100 place count 892 transition count 1904
Deduced a syphon composed of 130 places in 2 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 260 rules applied. Total rules applied 360 place count 762 transition count 1904
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 500 place count 692 transition count 1834
Applied a total of 500 rules in 84 ms. Remains 692 /942 variables (removed 250) and now considering 1834/2084 (removed 250) transitions.
[2023-03-15 01:24:28] [INFO ] Flow matrix only has 1794 transitions (discarded 40 similar events)
// Phase 1: matrix 1794 rows 692 cols
[2023-03-15 01:24:28] [INFO ] Computed 58 place invariants in 28 ms
[2023-03-15 01:24:29] [INFO ] Dead Transitions using invariants and state equation in 691 ms found 0 transitions.
[2023-03-15 01:24:29] [INFO ] Flow matrix only has 1794 transitions (discarded 40 similar events)
[2023-03-15 01:24:29] [INFO ] Invariant cache hit.
[2023-03-15 01:24:30] [INFO ] Implicit Places using invariants in 515 ms returned []
[2023-03-15 01:24:30] [INFO ] Flow matrix only has 1794 transitions (discarded 40 similar events)
[2023-03-15 01:24:30] [INFO ] Invariant cache hit.
[2023-03-15 01:24:30] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 01:24:48] [INFO ] Implicit Places using invariants and state equation in 18019 ms returned []
Implicit Place search using SMT with State Equation took 18534 ms to find 0 implicit places.
[2023-03-15 01:24:48] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-15 01:24:48] [INFO ] Flow matrix only has 1794 transitions (discarded 40 similar events)
[2023-03-15 01:24:48] [INFO ] Invariant cache hit.
[2023-03-15 01:24:48] [INFO ] Dead Transitions using invariants and state equation in 697 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 692/942 places, 1834/2084 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20039 ms. Remains : 692/942 places, 1834/2084 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p3)), (X (AND (NOT p0) (NOT p3))), (X (X (AND (NOT p0) (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 171 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p3))]
Finished random walk after 61 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=30 )
Knowledge obtained : [(AND (NOT p0) (NOT p3)), (X (AND (NOT p0) (NOT p3))), (X (X (AND (NOT p0) (NOT p3))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p3))))]
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p0) (NOT p3))]
[2023-03-15 01:24:49] [INFO ] Flow matrix only has 1794 transitions (discarded 40 similar events)
[2023-03-15 01:24:49] [INFO ] Invariant cache hit.
[2023-03-15 01:24:50] [INFO ] [Real]Absence check using 18 positive place invariants in 42 ms returned sat
[2023-03-15 01:24:50] [INFO ] [Real]Absence check using 18 positive and 40 generalized place invariants in 155 ms returned sat
[2023-03-15 01:24:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 01:24:53] [INFO ] [Real]Absence check using state equation in 2576 ms returned sat
[2023-03-15 01:24:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 01:24:55] [INFO ] [Nat]Absence check using 18 positive place invariants in 32 ms returned sat
[2023-03-15 01:24:55] [INFO ] [Nat]Absence check using 18 positive and 40 generalized place invariants in 102 ms returned sat
[2023-03-15 01:24:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 01:24:58] [INFO ] [Nat]Absence check using state equation in 3410 ms returned sat
[2023-03-15 01:24:58] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 01:25:01] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 01:25:03] [INFO ] [Nat]Added 200 Read/Feed constraints in 4814 ms returned sat
[2023-03-15 01:25:03] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 0 ms to minimize.
[2023-03-15 01:25:03] [INFO ] Deduced a trap composed of 56 places in 49 ms of which 0 ms to minimize.
[2023-03-15 01:25:04] [INFO ] Deduced a trap composed of 56 places in 37 ms of which 0 ms to minimize.
[2023-03-15 01:25:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1311 ms
[2023-03-15 01:25:04] [INFO ] Computed and/alt/rep : 780/3626/750 causal constraints (skipped 1040 transitions) in 126 ms.
[2023-03-15 01:25:07] [INFO ] Added : 53 causal constraints over 12 iterations in 2451 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3))
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 2129 reset in 587 ms.
Product exploration explored 100000 steps with 2087 reset in 605 ms.
Support contains 28 out of 692 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 692/692 places, 1834/1834 transitions.
Applied a total of 0 rules in 25 ms. Remains 692 /692 variables (removed 0) and now considering 1834/1834 (removed 0) transitions.
[2023-03-15 01:25:08] [INFO ] Flow matrix only has 1794 transitions (discarded 40 similar events)
[2023-03-15 01:25:08] [INFO ] Invariant cache hit.
[2023-03-15 01:25:09] [INFO ] Dead Transitions using invariants and state equation in 724 ms found 0 transitions.
[2023-03-15 01:25:09] [INFO ] Flow matrix only has 1794 transitions (discarded 40 similar events)
[2023-03-15 01:25:09] [INFO ] Invariant cache hit.
[2023-03-15 01:25:09] [INFO ] Implicit Places using invariants in 541 ms returned [594, 595, 596, 597, 598, 599, 600, 601, 602, 603]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 543 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 682/692 places, 1834/1834 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 672 transition count 1824
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 672 transition count 1824
Applied a total of 20 rules in 36 ms. Remains 672 /682 variables (removed 10) and now considering 1824/1834 (removed 10) transitions.
[2023-03-15 01:25:09] [INFO ] Flow matrix only has 1784 transitions (discarded 40 similar events)
// Phase 1: matrix 1784 rows 672 cols
[2023-03-15 01:25:09] [INFO ] Computed 48 place invariants in 30 ms
[2023-03-15 01:25:10] [INFO ] Implicit Places using invariants in 615 ms returned []
[2023-03-15 01:25:10] [INFO ] Flow matrix only has 1784 transitions (discarded 40 similar events)
[2023-03-15 01:25:10] [INFO ] Invariant cache hit.
[2023-03-15 01:25:10] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 01:25:24] [INFO ] Implicit Places using invariants and state equation in 13961 ms returned []
Implicit Place search using SMT with State Equation took 14577 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 672/692 places, 1824/1834 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 15908 ms. Remains : 672/692 places, 1824/1834 transitions.
Treatment of property PolyORBLF-COL-S04J06T10-LTLFireability-09 finished in 238464 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) U p1)))'
Support contains 23 out of 966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 966/966 places, 2104/2104 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 962 transition count 2104
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 14 place count 952 transition count 2094
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 952 transition count 2094
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 34 place count 942 transition count 2084
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 942 transition count 2084
Applied a total of 44 rules in 53 ms. Remains 942 /966 variables (removed 24) and now considering 2084/2104 (removed 20) transitions.
[2023-03-15 01:25:24] [INFO ] Flow matrix only has 2044 transitions (discarded 40 similar events)
// Phase 1: matrix 2044 rows 942 cols
[2023-03-15 01:25:24] [INFO ] Computed 58 place invariants in 39 ms
[2023-03-15 01:25:25] [INFO ] Dead Transitions using invariants and state equation in 814 ms found 0 transitions.
[2023-03-15 01:25:25] [INFO ] Flow matrix only has 2044 transitions (discarded 40 similar events)
[2023-03-15 01:25:25] [INFO ] Invariant cache hit.
[2023-03-15 01:25:25] [INFO ] Implicit Places using invariants in 636 ms returned [744, 745, 746, 747, 748, 749, 750, 751, 752, 753]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 638 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 932/966 places, 2084/2104 transitions.
Applied a total of 0 rules in 15 ms. Remains 932 /932 variables (removed 0) and now considering 2084/2084 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1521 ms. Remains : 932/966 places, 2084/2104 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J06T10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (GEQ s474 1) (GEQ s727 1) (GEQ s807 1)) (AND (GEQ s474 1) (GEQ s722 1) (GEQ s807 1)) (AND (GEQ s474 1) (GEQ s721 1) (GEQ s807 1)) (AND (GEQ s4...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 62960 steps with 270 reset in 222 ms.
FORMULA PolyORBLF-COL-S04J06T10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J06T10-LTLFireability-10 finished in 1875 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 10 out of 966 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 966/966 places, 2104/2104 transitions.
Ensure Unique test removed 4 places
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 962 transition count 2034
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 892 transition count 2034
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 120 Pre rules applied. Total rules applied 140 place count 892 transition count 1914
Deduced a syphon composed of 120 places in 2 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 240 rules applied. Total rules applied 380 place count 772 transition count 1914
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 2 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 580 place count 672 transition count 1814
Applied a total of 580 rules in 63 ms. Remains 672 /966 variables (removed 294) and now considering 1814/2104 (removed 290) transitions.
[2023-03-15 01:25:26] [INFO ] Flow matrix only has 1774 transitions (discarded 40 similar events)
// Phase 1: matrix 1774 rows 672 cols
[2023-03-15 01:25:26] [INFO ] Computed 58 place invariants in 33 ms
[2023-03-15 01:25:27] [INFO ] Dead Transitions using invariants and state equation in 746 ms found 0 transitions.
[2023-03-15 01:25:27] [INFO ] Flow matrix only has 1774 transitions (discarded 40 similar events)
[2023-03-15 01:25:27] [INFO ] Invariant cache hit.
[2023-03-15 01:25:27] [INFO ] Implicit Places using invariants in 590 ms returned [574, 575, 576, 577, 578, 579, 580, 581, 582, 583]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 592 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 662/966 places, 1814/2104 transitions.
Applied a total of 0 rules in 26 ms. Remains 662 /662 variables (removed 0) and now considering 1814/1814 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1427 ms. Remains : 662/966 places, 1814/2104 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J06T10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s594 1) (LT s595 1) (LT s600 1) (LT s601 1) (LT s602 1) (LT s603 1) (LT s596 1) (LT s597 1) (LT s598 1) (LT s599 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 4 reset in 412 ms.
Stack based approach found an accepted trace after 658 steps with 0 reset with depth 659 and stack size 659 in 3 ms.
FORMULA PolyORBLF-COL-S04J06T10-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-COL-S04J06T10-LTLFireability-11 finished in 1905 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 12 out of 966 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 966/966 places, 2104/2104 transitions.
Ensure Unique test removed 4 places
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 962 transition count 2014
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 180 place count 872 transition count 2014
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 120 Pre rules applied. Total rules applied 180 place count 872 transition count 1894
Deduced a syphon composed of 120 places in 2 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 240 rules applied. Total rules applied 420 place count 752 transition count 1894
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 2 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 620 place count 652 transition count 1794
Applied a total of 620 rules in 67 ms. Remains 652 /966 variables (removed 314) and now considering 1794/2104 (removed 310) transitions.
[2023-03-15 01:25:28] [INFO ] Flow matrix only has 1754 transitions (discarded 40 similar events)
// Phase 1: matrix 1754 rows 652 cols
[2023-03-15 01:25:28] [INFO ] Computed 58 place invariants in 30 ms
[2023-03-15 01:25:28] [INFO ] Dead Transitions using invariants and state equation in 714 ms found 0 transitions.
[2023-03-15 01:25:28] [INFO ] Flow matrix only has 1754 transitions (discarded 40 similar events)
[2023-03-15 01:25:29] [INFO ] Invariant cache hit.
[2023-03-15 01:25:29] [INFO ] Implicit Places using invariants in 548 ms returned [574, 575, 576, 577, 578, 579, 580, 581, 582, 583]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 550 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 642/966 places, 1794/2104 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 632 transition count 1784
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 632 transition count 1784
Applied a total of 20 rules in 34 ms. Remains 632 /642 variables (removed 10) and now considering 1784/1794 (removed 10) transitions.
[2023-03-15 01:25:29] [INFO ] Flow matrix only has 1744 transitions (discarded 40 similar events)
// Phase 1: matrix 1744 rows 632 cols
[2023-03-15 01:25:29] [INFO ] Computed 48 place invariants in 31 ms
[2023-03-15 01:25:30] [INFO ] Implicit Places using invariants in 578 ms returned []
[2023-03-15 01:25:30] [INFO ] Flow matrix only has 1744 transitions (discarded 40 similar events)
[2023-03-15 01:25:30] [INFO ] Invariant cache hit.
[2023-03-15 01:25:30] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 01:25:43] [INFO ] Implicit Places using invariants and state equation in 13616 ms returned []
Implicit Place search using SMT with State Equation took 14197 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 632/966 places, 1784/2104 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 15565 ms. Remains : 632/966 places, 1784/2104 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J06T10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s0 10) (GEQ s582 1) (GEQ s586 1)) (AND (GEQ s0 10) (GEQ s577 1) (GEQ s586 1)) (AND (GEQ s0 10) (GEQ s576 1) (GEQ s586 1)) (AND (GEQ s0 10...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 3131 steps with 0 reset in 20 ms.
FORMULA PolyORBLF-COL-S04J06T10-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J06T10-LTLFireability-12 finished in 15633 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 U p1))))'
Support contains 31 out of 966 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 966/966 places, 2104/2104 transitions.
Ensure Unique test removed 4 places
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 962 transition count 2034
Reduce places removed 70 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 80 rules applied. Total rules applied 150 place count 892 transition count 2024
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 160 place count 882 transition count 2024
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 120 Pre rules applied. Total rules applied 160 place count 882 transition count 1904
Deduced a syphon composed of 120 places in 1 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 3 with 240 rules applied. Total rules applied 400 place count 762 transition count 1904
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 600 place count 662 transition count 1804
Applied a total of 600 rules in 64 ms. Remains 662 /966 variables (removed 304) and now considering 1804/2104 (removed 300) transitions.
[2023-03-15 01:25:43] [INFO ] Flow matrix only has 1764 transitions (discarded 40 similar events)
// Phase 1: matrix 1764 rows 662 cols
[2023-03-15 01:25:43] [INFO ] Computed 58 place invariants in 34 ms
[2023-03-15 01:25:44] [INFO ] Dead Transitions using invariants and state equation in 728 ms found 0 transitions.
[2023-03-15 01:25:44] [INFO ] Flow matrix only has 1764 transitions (discarded 40 similar events)
[2023-03-15 01:25:44] [INFO ] Invariant cache hit.
[2023-03-15 01:25:45] [INFO ] Implicit Places using invariants in 553 ms returned [584, 585, 586, 587, 588, 589, 590, 591, 592, 593]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 558 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 652/966 places, 1804/2104 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 642 transition count 1794
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 642 transition count 1794
Applied a total of 20 rules in 39 ms. Remains 642 /652 variables (removed 10) and now considering 1794/1804 (removed 10) transitions.
[2023-03-15 01:25:45] [INFO ] Flow matrix only has 1754 transitions (discarded 40 similar events)
// Phase 1: matrix 1754 rows 642 cols
[2023-03-15 01:25:45] [INFO ] Computed 48 place invariants in 34 ms
[2023-03-15 01:25:45] [INFO ] Implicit Places using invariants in 600 ms returned []
[2023-03-15 01:25:45] [INFO ] Flow matrix only has 1754 transitions (discarded 40 similar events)
[2023-03-15 01:25:45] [INFO ] Invariant cache hit.
[2023-03-15 01:25:46] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 01:25:55] [INFO ] Implicit Places using invariants and state equation in 9164 ms returned []
Implicit Place search using SMT with State Equation took 9764 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 642/966 places, 1794/2104 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11155 ms. Remains : 642/966 places, 1794/2104 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S04J06T10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(OR p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (GEQ s173 1) (GEQ s183 1)) (AND (GEQ s174 1) (GEQ s184 1)) (AND (GEQ s177 1) (GEQ s187 1)) (AND (GEQ s178 1) (GEQ s188 1)) (AND (GEQ s181 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1295 reset in 599 ms.
Product exploration explored 100000 steps with 1304 reset in 632 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 (OR p1 (NOT p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (X (OR p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 226 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
Finished random walk after 13 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (OR p1 (NOT p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (X (OR p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 296 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), (NOT p1)]
[2023-03-15 01:25:57] [INFO ] Flow matrix only has 1754 transitions (discarded 40 similar events)
[2023-03-15 01:25:57] [INFO ] Invariant cache hit.
[2023-03-15 01:25:57] [INFO ] [Real]Absence check using 18 positive place invariants in 15 ms returned sat
[2023-03-15 01:25:58] [INFO ] [Real]Absence check using 18 positive and 30 generalized place invariants in 119 ms returned sat
[2023-03-15 01:25:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 01:25:59] [INFO ] [Real]Absence check using state equation in 1634 ms returned sat
[2023-03-15 01:25:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 01:26:00] [INFO ] [Nat]Absence check using 18 positive place invariants in 374 ms returned sat
[2023-03-15 01:26:01] [INFO ] [Nat]Absence check using 18 positive and 30 generalized place invariants in 172 ms returned sat
[2023-03-15 01:26:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 01:26:04] [INFO ] [Nat]Absence check using state equation in 3451 ms returned sat
[2023-03-15 01:26:04] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 01:26:06] [INFO ] [Nat]Added 200 Read/Feed constraints in 2118 ms returned sat
[2023-03-15 01:26:06] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 1 ms to minimize.
[2023-03-15 01:26:08] [INFO ] Deduced a trap composed of 53 places in 50 ms of which 0 ms to minimize.
[2023-03-15 01:26:10] [INFO ] Deduced a trap composed of 53 places in 49 ms of which 0 ms to minimize.
[2023-03-15 01:26:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 6710 ms
[2023-03-15 01:26:13] [INFO ] Computed and/alt/rep : 740/3576/710 causal constraints (skipped 1040 transitions) in 107 ms.
[2023-03-15 01:26:14] [INFO ] Added : 25 causal constraints over 5 iterations in 1322 ms. Result :unknown
Could not prove EG (NOT p1)
Support contains 31 out of 642 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 642/642 places, 1794/1794 transitions.
Applied a total of 0 rules in 30 ms. Remains 642 /642 variables (removed 0) and now considering 1794/1794 (removed 0) transitions.
[2023-03-15 01:26:14] [INFO ] Flow matrix only has 1754 transitions (discarded 40 similar events)
[2023-03-15 01:26:14] [INFO ] Invariant cache hit.
[2023-03-15 01:26:15] [INFO ] Dead Transitions using invariants and state equation in 708 ms found 0 transitions.
[2023-03-15 01:26:15] [INFO ] Flow matrix only has 1754 transitions (discarded 40 similar events)
[2023-03-15 01:26:15] [INFO ] Invariant cache hit.
[2023-03-15 01:26:16] [INFO ] Implicit Places using invariants in 564 ms returned []
[2023-03-15 01:26:16] [INFO ] Flow matrix only has 1754 transitions (discarded 40 similar events)
[2023-03-15 01:26:16] [INFO ] Invariant cache hit.
[2023-03-15 01:26:16] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 01:26:30] [INFO ] Implicit Places using invariants and state equation in 14359 ms returned []
Implicit Place search using SMT with State Equation took 14925 ms to find 0 implicit places.
[2023-03-15 01:26:30] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-15 01:26:30] [INFO ] Flow matrix only has 1754 transitions (discarded 40 similar events)
[2023-03-15 01:26:30] [INFO ] Invariant cache hit.
[2023-03-15 01:26:31] [INFO ] Dead Transitions using invariants and state equation in 699 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16399 ms. Remains : 642/642 places, 1794/1794 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (OR (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (OR (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 234 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p1), (NOT p1)]
Finished random walk after 98 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (OR (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (OR (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 303 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p1), (NOT p1)]
[2023-03-15 01:26:31] [INFO ] Flow matrix only has 1754 transitions (discarded 40 similar events)
[2023-03-15 01:26:31] [INFO ] Invariant cache hit.
[2023-03-15 01:26:32] [INFO ] [Real]Absence check using 18 positive place invariants in 15 ms returned sat
[2023-03-15 01:26:32] [INFO ] [Real]Absence check using 18 positive and 30 generalized place invariants in 118 ms returned sat
[2023-03-15 01:26:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 01:26:34] [INFO ] [Real]Absence check using state equation in 1658 ms returned sat
[2023-03-15 01:26:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 01:26:35] [INFO ] [Nat]Absence check using 18 positive place invariants in 372 ms returned sat
[2023-03-15 01:26:36] [INFO ] [Nat]Absence check using 18 positive and 30 generalized place invariants in 165 ms returned sat
[2023-03-15 01:26:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 01:26:39] [INFO ] [Nat]Absence check using state equation in 3472 ms returned sat
[2023-03-15 01:26:39] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 01:26:41] [INFO ] [Nat]Added 200 Read/Feed constraints in 2116 ms returned sat
[2023-03-15 01:26:41] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 1 ms to minimize.
[2023-03-15 01:26:43] [INFO ] Deduced a trap composed of 53 places in 51 ms of which 0 ms to minimize.
[2023-03-15 01:26:45] [INFO ] Deduced a trap composed of 53 places in 50 ms of which 0 ms to minimize.
[2023-03-15 01:26:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 6713 ms
[2023-03-15 01:26:48] [INFO ] Computed and/alt/rep : 740/3576/710 causal constraints (skipped 1040 transitions) in 89 ms.
[2023-03-15 01:26:49] [INFO ] Added : 25 causal constraints over 5 iterations in 1303 ms. Result :unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1297 reset in 558 ms.
Product exploration explored 100000 steps with 1289 reset in 569 ms.
Support contains 31 out of 642 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 642/642 places, 1794/1794 transitions.
Applied a total of 0 rules in 23 ms. Remains 642 /642 variables (removed 0) and now considering 1794/1794 (removed 0) transitions.
[2023-03-15 01:26:50] [INFO ] Flow matrix only has 1754 transitions (discarded 40 similar events)
[2023-03-15 01:26:50] [INFO ] Invariant cache hit.
[2023-03-15 01:26:51] [INFO ] Dead Transitions using invariants and state equation in 683 ms found 0 transitions.
[2023-03-15 01:26:51] [INFO ] Flow matrix only has 1754 transitions (discarded 40 similar events)
[2023-03-15 01:26:51] [INFO ] Invariant cache hit.
[2023-03-15 01:26:52] [INFO ] Implicit Places using invariants in 574 ms returned []
[2023-03-15 01:26:52] [INFO ] Flow matrix only has 1754 transitions (discarded 40 similar events)
[2023-03-15 01:26:52] [INFO ] Invariant cache hit.
[2023-03-15 01:26:52] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 01:27:02] [INFO ] Implicit Places using invariants and state equation in 10519 ms returned []
Implicit Place search using SMT with State Equation took 11095 ms to find 0 implicit places.
[2023-03-15 01:27:02] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-15 01:27:02] [INFO ] Flow matrix only has 1754 transitions (discarded 40 similar events)
[2023-03-15 01:27:02] [INFO ] Invariant cache hit.
[2023-03-15 01:27:03] [INFO ] Dead Transitions using invariants and state equation in 696 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12541 ms. Remains : 642/642 places, 1794/1794 transitions.
Treatment of property PolyORBLF-COL-S04J06T10-LTLFireability-13 finished in 79669 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(p1)||p0))&&X(G(p2))))'
Support contains 21 out of 966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 966/966 places, 2104/2104 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 962 transition count 2104
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 14 place count 952 transition count 2094
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 952 transition count 2094
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 34 place count 942 transition count 2084
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 942 transition count 2084
Applied a total of 44 rules in 51 ms. Remains 942 /966 variables (removed 24) and now considering 2084/2104 (removed 20) transitions.
[2023-03-15 01:27:03] [INFO ] Flow matrix only has 2044 transitions (discarded 40 similar events)
// Phase 1: matrix 2044 rows 942 cols
[2023-03-15 01:27:03] [INFO ] Computed 58 place invariants in 37 ms
[2023-03-15 01:27:04] [INFO ] Dead Transitions using invariants and state equation in 811 ms found 0 transitions.
[2023-03-15 01:27:04] [INFO ] Flow matrix only has 2044 transitions (discarded 40 similar events)
[2023-03-15 01:27:04] [INFO ] Invariant cache hit.
[2023-03-15 01:27:05] [INFO ] Implicit Places using invariants in 670 ms returned [744, 745, 746, 747, 748, 749, 750, 751, 752, 753]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 671 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 932/966 places, 2084/2104 transitions.
Applied a total of 0 rules in 16 ms. Remains 932 /932 variables (removed 0) and now considering 2084/2084 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1549 ms. Remains : 932/966 places, 2084/2104 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p2), true]
Running random walk in product with property : PolyORBLF-COL-S04J06T10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s558 1) (GEQ s567 1)) (AND (GEQ s558 1) (GEQ s566 1)) (AND (GEQ s558 1) (GEQ s569 1)) (AND (GEQ s558 1) (GEQ s568 1)) (AND (GEQ s558 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1759 steps with 4 reset in 6 ms.
FORMULA PolyORBLF-COL-S04J06T10-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J06T10-LTLFireability-14 finished in 1706 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(p1)||p0)))'
Support contains 35 out of 966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 966/966 places, 2104/2104 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 962 transition count 2104
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 14 place count 952 transition count 2094
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 952 transition count 2094
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 34 place count 942 transition count 2084
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 942 transition count 2084
Applied a total of 44 rules in 45 ms. Remains 942 /966 variables (removed 24) and now considering 2084/2104 (removed 20) transitions.
[2023-03-15 01:27:05] [INFO ] Flow matrix only has 2044 transitions (discarded 40 similar events)
[2023-03-15 01:27:05] [INFO ] Invariant cache hit.
[2023-03-15 01:27:06] [INFO ] Dead Transitions using invariants and state equation in 762 ms found 0 transitions.
[2023-03-15 01:27:06] [INFO ] Flow matrix only has 2044 transitions (discarded 40 similar events)
[2023-03-15 01:27:06] [INFO ] Invariant cache hit.
[2023-03-15 01:27:06] [INFO ] Implicit Places using invariants in 645 ms returned [744, 745, 746, 747, 748, 749, 750, 751, 752, 753]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 648 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 932/966 places, 2084/2104 transitions.
Applied a total of 0 rules in 17 ms. Remains 932 /932 variables (removed 0) and now considering 2084/2084 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1474 ms. Remains : 932/966 places, 2084/2104 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-COL-S04J06T10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (AND (GEQ s639 8) (GEQ s645 1) (GEQ s740 1) (GEQ s742 1)) (AND (GEQ s639 8) (GEQ s642 1) (GEQ s742 2)) (AND (GEQ s639 8) (GEQ s646 1) (GEQ s742 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S04J06T10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J06T10-LTLFireability-15 finished in 1607 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((G((X((!p1 U (G(!p1)||p2)))&&p0))||(X((X(F(p4))&&(!p1 U (G(!p1)||p5))))&&p3)))))'
Found a Shortening insensitive property : PolyORBLF-COL-S04J06T10-LTLFireability-00
Stuttering acceptance computed with spot in 343 ms :[(OR (AND (NOT p0) p1 (NOT p5)) (AND p1 (NOT p2) (NOT p4)) (AND p1 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p5)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR (AND (NOT p0) p1 (NOT p5)) (AND p1 (NOT p2) (NOT p4)) (AND p1 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p5)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR (AND (NOT p0) p1 (NOT p5)) (AND p1 (NOT p2) (NOT p5)) (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p4))), (OR (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p4))), (OR (AND (NOT p0) p1 (NOT p5)) (AND p1 (NOT p2) (NOT p5)))]
Support contains 42 out of 966 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 966/966 places, 2104/2104 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 966 transition count 2024
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 886 transition count 2024
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 120 Pre rules applied. Total rules applied 160 place count 886 transition count 1904
Deduced a syphon composed of 120 places in 2 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 240 rules applied. Total rules applied 400 place count 766 transition count 1904
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 500 place count 716 transition count 1854
Applied a total of 500 rules in 74 ms. Remains 716 /966 variables (removed 250) and now considering 1854/2104 (removed 250) transitions.
[2023-03-15 01:27:07] [INFO ] Flow matrix only has 1814 transitions (discarded 40 similar events)
// Phase 1: matrix 1814 rows 716 cols
[2023-03-15 01:27:07] [INFO ] Computed 62 place invariants in 29 ms
[2023-03-15 01:27:08] [INFO ] Dead Transitions using invariants and state equation in 774 ms found 0 transitions.
[2023-03-15 01:27:08] [INFO ] Flow matrix only has 1814 transitions (discarded 40 similar events)
[2023-03-15 01:27:08] [INFO ] Invariant cache hit.
[2023-03-15 01:27:08] [INFO ] Implicit Places using invariants in 529 ms returned [638, 639, 640, 641, 642, 643, 644, 645, 646, 647]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 531 ms to find 10 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 706/966 places, 1854/2104 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 696 transition count 1844
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 696 transition count 1844
Applied a total of 20 rules in 27 ms. Remains 696 /706 variables (removed 10) and now considering 1844/1854 (removed 10) transitions.
[2023-03-15 01:27:08] [INFO ] Flow matrix only has 1804 transitions (discarded 40 similar events)
// Phase 1: matrix 1804 rows 696 cols
[2023-03-15 01:27:08] [INFO ] Computed 52 place invariants in 34 ms
[2023-03-15 01:27:09] [INFO ] Implicit Places using invariants in 553 ms returned []
[2023-03-15 01:27:09] [INFO ] Flow matrix only has 1804 transitions (discarded 40 similar events)
[2023-03-15 01:27:09] [INFO ] Invariant cache hit.
[2023-03-15 01:27:10] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 01:27:23] [INFO ] Implicit Places using invariants and state equation in 14425 ms returned []
Implicit Place search using SMT with State Equation took 14978 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 696/966 places, 1844/2104 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 16385 ms. Remains : 696/966 places, 1844/2104 transitions.
Running random walk in product with property : PolyORBLF-COL-S04J06T10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p3), acceptance={} source=0 dest: 1}, { cond=p3, acceptance={} source=0 dest: 2}], [{ cond=(OR (AND p0 (NOT p3) (NOT p1)) (AND p0 (NOT p3) p2)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p3) p1 (NOT p2))), acceptance={0, 1} source=1 dest: 1}, { cond=(OR (AND p0 p3 (NOT p1)) (AND p0 p3 p2)), acceptance={0} source=1 dest: 2}, { cond=(OR (AND (NOT p0) p3) (AND p3 p1 (NOT p2))), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND p0 (NOT p3) (NOT p5) p1 p2), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p3) (NOT p5) p1) (AND (NOT p3) (NOT p5) p1 (NOT p2))), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 p3 (NOT p5) p1 p2), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p0) p3 (NOT p5) p1) (AND p3 (NOT p5) p1 (NOT p2))), acceptance={0, 1} source=2 dest: 2}, { cond=(OR p5 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p5) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p5) (NOT p1)), acceptance={1} source=2 dest: 4}], [{ cond=(OR (AND p0 (NOT p1) (NOT p4)) (AND p0 p2 (NOT p4))), acceptance={0} source=3 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p4)) (AND p1 (NOT p2) (NOT p4))), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND p0 (NOT p3) (NOT p5) p1 p2), acceptance={0} source=4 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p3) (NOT p5) p1) (AND (NOT p3) (NOT p5) p1 (NOT p2))), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p0 p3 (NOT p5) p1 p2), acceptance={0} source=4 dest: 2}, { cond=(OR (AND (NOT p0) p3 (NOT p5) p1) (AND p3 (NOT p5) p1 (NOT p2))), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p0 (NOT p5) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p5) (NOT p1)), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p3:(AND (OR (LT s345 1) (LT s350 1) (LT s360 1)) (OR (LT s345 1) (LT s350 1) (LT s362 1)) (OR (LT s345 1) (LT s355 1) (LT s357 1)) (OR (LT s345 1) (LT s34...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2240 reset in 7558 ms.
Product exploration explored 100000 steps with 2252 reset in 7602 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 p3 p0 (NOT p1) (NOT p2) (NOT p5) p4), (X (OR p5 (NOT p1))), (X (NOT (AND p0 (NOT p3) (NOT p5) p1 p2))), (X (NOT (OR (AND (NOT p0) p3 (NOT p5) p1) (AND p3 (NOT p5) p1 (NOT p2))))), (X (NOT (AND p0 p3 (NOT p5) p1 p2))), (X (AND p0 (NOT p5) (NOT p1))), (X (NOT (OR (AND (NOT p0) (NOT p3) (NOT p5) p1) (AND (NOT p3) (NOT p5) p1 (NOT p2))))), (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p3) p1 (NOT p2))))), (X (NOT (OR (AND p0 (NOT p3) (NOT p1)) (AND p0 (NOT p3) p2)))), (X (OR (AND p0 p3 (NOT p1)) (AND p0 p3 p2))), (X (NOT (OR (AND (NOT p0) p3) (AND p3 p1 (NOT p2))))), (X (NOT (AND (NOT p0) (NOT p5) (NOT p1)))), (X (X (NOT (AND p0 (NOT p3) (NOT p5) p1 p2)))), (X (X (AND p0 (NOT p5) (NOT p1)))), (X (X (NOT (OR (AND (NOT p0) (NOT p3) (NOT p5) p1) (AND (NOT p3) (NOT p5) p1 (NOT p2)))))), (X (X (NOT (OR (AND (NOT p0) (NOT p4)) (AND p1 (NOT p2) (NOT p4)))))), (X (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p3) p1 (NOT p2)))))), (X (X (NOT (OR (AND p0 (NOT p3) (NOT p1)) (AND p0 (NOT p3) p2))))), (X (X (NOT (AND (NOT p0) (NOT p5) (NOT p1))))), (X (X (OR p5 (NOT p1)))), (X (X (NOT (OR (AND (NOT p0) p3 (NOT p5) p1) (AND p3 (NOT p5) p1 (NOT p2)))))), (X (X (NOT (AND p0 p3 (NOT p5) p1 p2)))), (X (X (OR (AND p0 p3 (NOT p1)) (AND p0 p3 p2)))), (X (X (NOT (OR (AND (NOT p0) p3) (AND p3 p1 (NOT p2))))))]
False Knowledge obtained : [(X (X (OR (AND p0 (NOT p1) (NOT p4)) (AND p0 p2 (NOT p4))))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p4)) (AND p0 p2 (NOT p4))))))]
Knowledge based reduction with 24 factoid took 2606 ms. Reduced automaton from 5 states, 22 edges and 6 AP (stutter sensitive) to 5 states, 22 edges and 6 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[(OR (AND p1 (NOT p2) (NOT p5)) (AND p1 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) p1 (NOT p5)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR (AND p1 (NOT p2) (NOT p5)) (AND p1 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) p1 (NOT p5)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR (AND (NOT p0) p1 (NOT p5)) (AND p1 (NOT p2) (NOT p5)) (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p4))), (OR (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p4))), (OR (AND (NOT p0) p1 (NOT p5)) (AND p1 (NOT p2) (NOT p5)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 637 ms. (steps per millisecond=15 ) properties (out of 14) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 710 ms. (steps per millisecond=14 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 769 ms. (steps per millisecond=13 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1133 ms. (steps per millisecond=8 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1135 ms. (steps per millisecond=8 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1662 ms. (steps per millisecond=6 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 591 ms. (steps per millisecond=16 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-15 01:27:48] [INFO ] Flow matrix only has 1804 transitions (discarded 40 similar events)
[2023-03-15 01:27:48] [INFO ] Invariant cache hit.
[2023-03-15 01:27:54] [INFO ] After 181ms SMT Verify possible using all constraints in real domain returned unsat :6 sat :0
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND p3 p0 (NOT p1) (NOT p2) (NOT p5) p4), (X (OR p5 (NOT p1))), (X (NOT (AND p0 (NOT p3) (NOT p5) p1 p2))), (X (NOT (OR (AND (NOT p0) p3 (NOT p5) p1) (AND p3 (NOT p5) p1 (NOT p2))))), (X (NOT (AND p0 p3 (NOT p5) p1 p2))), (X (AND p0 (NOT p5) (NOT p1))), (X (NOT (OR (AND (NOT p0) (NOT p3) (NOT p5) p1) (AND (NOT p3) (NOT p5) p1 (NOT p2))))), (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p3) p1 (NOT p2))))), (X (NOT (OR (AND p0 (NOT p3) (NOT p1)) (AND p0 (NOT p3) p2)))), (X (OR (AND p0 p3 (NOT p1)) (AND p0 p3 p2))), (X (NOT (OR (AND (NOT p0) p3) (AND p3 p1 (NOT p2))))), (X (NOT (AND (NOT p0) (NOT p5) (NOT p1)))), (X (X (NOT (AND p0 (NOT p3) (NOT p5) p1 p2)))), (X (X (AND p0 (NOT p5) (NOT p1)))), (X (X (NOT (OR (AND (NOT p0) (NOT p3) (NOT p5) p1) (AND (NOT p3) (NOT p5) p1 (NOT p2)))))), (X (X (NOT (OR (AND (NOT p0) (NOT p4)) (AND p1 (NOT p2) (NOT p4)))))), (X (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p3) p1 (NOT p2)))))), (X (X (NOT (OR (AND p0 (NOT p3) (NOT p1)) (AND p0 (NOT p3) p2))))), (X (X (NOT (AND (NOT p0) (NOT p5) (NOT p1))))), (X (X (OR p5 (NOT p1)))), (X (X (NOT (OR (AND (NOT p0) p3 (NOT p5) p1) (AND p3 (NOT p5) p1 (NOT p2)))))), (X (X (NOT (AND p0 p3 (NOT p5) p1 p2)))), (X (X (OR (AND p0 p3 (NOT p1)) (AND p0 p3 p2)))), (X (X (NOT (OR (AND (NOT p0) p3) (AND p3 p1 (NOT p2)))))), (G (NOT (OR (AND p3 p1 (NOT p0) (NOT p5)) (AND p3 p1 (NOT p2) (NOT p5))))), (G (NOT (AND p3 p1 p0 p2 (NOT p5)))), (G (NOT (OR (AND p3 p1 (NOT p2)) (AND p3 (NOT p0))))), (G (NOT (AND (NOT p3) p1 p0 p2 (NOT p5)))), (G (NOT (OR (AND (NOT p3) (NOT p1) p0) (AND (NOT p3) p0 p2)))), (G (NOT (AND (NOT p1) (NOT p0) (NOT p5))))]
False Knowledge obtained : [(X (X (OR (AND p0 (NOT p1) (NOT p4)) (AND p0 p2 (NOT p4))))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p4)) (AND p0 p2 (NOT p4)))))), (F (NOT (OR (NOT p1) p5))), (F (NOT (OR (AND p3 (NOT p1) p0) (AND p3 p0 p2)))), (F (OR (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p4)))), (F (OR (AND (NOT p3) p1 (NOT p0) (NOT p5)) (AND (NOT p3) p1 (NOT p2) (NOT p5)))), (F (OR (AND (NOT p1) p0 (NOT p4)) (AND p0 p2 (NOT p4)))), (F (NOT p3)), (F (OR (AND (NOT p3) p1 (NOT p2)) (AND (NOT p3) (NOT p0)))), (F (NOT (AND (NOT p1) p0 (NOT p5))))]
Knowledge based reduction with 30 factoid took 3539 ms. Reduced automaton from 5 states, 22 edges and 6 AP (stutter sensitive) to 5 states, 12 edges and 6 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (AND p1 (NOT p2) (NOT p5)) (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p5)) (AND (NOT p0) (NOT p4))), (OR (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p4))), (OR (AND p1 (NOT p2) (NOT p5)) (AND (NOT p0) (NOT p5)))]
Stuttering acceptance computed with spot in 311 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (AND p1 (NOT p2) (NOT p5)) (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p5)) (AND (NOT p0) (NOT p4))), (OR (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p4))), (OR (AND p1 (NOT p2) (NOT p5)) (AND (NOT p0) (NOT p5)))]
Support contains 42 out of 696 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 696/696 places, 1844/1844 transitions.
Applied a total of 0 rules in 9 ms. Remains 696 /696 variables (removed 0) and now considering 1844/1844 (removed 0) transitions.
[2023-03-15 01:27:58] [INFO ] Flow matrix only has 1804 transitions (discarded 40 similar events)
[2023-03-15 01:27:58] [INFO ] Invariant cache hit.
[2023-03-15 01:27:59] [INFO ] Dead Transitions using invariants and state equation in 872 ms found 0 transitions.
[2023-03-15 01:27:59] [INFO ] Flow matrix only has 1804 transitions (discarded 40 similar events)
[2023-03-15 01:27:59] [INFO ] Invariant cache hit.
[2023-03-15 01:27:59] [INFO ] Implicit Places using invariants in 514 ms returned []
[2023-03-15 01:27:59] [INFO ] Flow matrix only has 1804 transitions (discarded 40 similar events)
[2023-03-15 01:27:59] [INFO ] Invariant cache hit.
[2023-03-15 01:28:00] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 01:28:15] [INFO ] Implicit Places using invariants and state equation in 15877 ms returned []
Implicit Place search using SMT with State Equation took 16404 ms to find 0 implicit places.
[2023-03-15 01:28:15] [INFO ] Flow matrix only has 1804 transitions (discarded 40 similar events)
[2023-03-15 01:28:15] [INFO ] Invariant cache hit.
[2023-03-15 01:28:16] [INFO ] Dead Transitions using invariants and state equation in 722 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18009 ms. Remains : 696/696 places, 1844/1844 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p5) p3 p0 (NOT p2) p4), (X p3), (X (OR p1 p5 p3)), (X (OR p5 p3)), (X (AND p0 (NOT p1) (NOT p5) p3)), (X (NOT (OR (AND (NOT p0) (NOT p5)) (AND p1 (NOT p5) (NOT p2))))), (X (NOT (OR (NOT p0) (AND p1 (NOT p2))))), (X (X p3)), (X (X (OR p1 p5 p3))), (X (X (OR p5 p3))), (X (X (AND p0 (NOT p1) (NOT p5) p3))), (X (X (NOT (OR (AND (NOT p0) (NOT p5)) (AND p1 (NOT p5) (NOT p2)))))), (X (X (NOT (OR (AND (NOT p0) (NOT p4)) (AND p1 (NOT p2) (NOT p4)))))), (X (X (NOT (OR (NOT p0) (AND p1 (NOT p2))))))]
False Knowledge obtained : [(X (X (OR (AND p0 (NOT p1) (NOT p4)) (AND p0 p2 (NOT p4))))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p4)) (AND p0 p2 (NOT p4))))))]
Knowledge based reduction with 14 factoid took 1851 ms. Reduced automaton from 5 states, 12 edges and 6 AP (stutter sensitive) to 5 states, 12 edges and 6 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (AND p1 (NOT p2) (NOT p5)) (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p5)) (AND (NOT p0) (NOT p4))), (OR (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p4))), (OR (AND p1 (NOT p2) (NOT p5)) (AND (NOT p0) (NOT p5)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 300 ms. (steps per millisecond=33 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 406 ms. (steps per millisecond=24 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 01:28:19] [INFO ] Flow matrix only has 1804 transitions (discarded 40 similar events)
[2023-03-15 01:28:19] [INFO ] Invariant cache hit.
[2023-03-15 01:28:19] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p5) p3 p0 (NOT p2) p4), (X p3), (X (OR p1 p5 p3)), (X (OR p5 p3)), (X (AND p0 (NOT p1) (NOT p5) p3)), (X (NOT (OR (AND (NOT p0) (NOT p5)) (AND p1 (NOT p5) (NOT p2))))), (X (NOT (OR (NOT p0) (AND p1 (NOT p2))))), (X (X p3)), (X (X (OR p1 p5 p3))), (X (X (OR p5 p3))), (X (X (AND p0 (NOT p1) (NOT p5) p3))), (X (X (NOT (OR (AND (NOT p0) (NOT p5)) (AND p1 (NOT p5) (NOT p2)))))), (X (X (NOT (OR (AND (NOT p0) (NOT p4)) (AND p1 (NOT p2) (NOT p4)))))), (X (X (NOT (OR (NOT p0) (AND p1 (NOT p2)))))), (G (OR p1 p5 p3))]
False Knowledge obtained : [(X (X (OR (AND p0 (NOT p1) (NOT p4)) (AND p0 p2 (NOT p4))))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p4)) (AND p0 p2 (NOT p4)))))), (F (NOT (OR p5 p3))), (F (OR (AND p1 (NOT p2) (NOT p5)) (AND (NOT p0) (NOT p5)))), (F (OR (AND (NOT p1) p0 (NOT p4)) (AND p2 p0 (NOT p4)))), (F (NOT (AND (NOT p1) p0 (NOT p5) p3))), (F (NOT p3)), (F (OR (AND p1 (NOT p2)) (NOT p0))), (F (OR (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p4))))]
Knowledge based reduction with 15 factoid took 1892 ms. Reduced automaton from 5 states, 12 edges and 6 AP (stutter sensitive) to 5 states, 12 edges and 6 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (AND p1 (NOT p2) (NOT p5)) (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p5)) (AND (NOT p0) (NOT p4))), (OR (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p4))), (OR (AND p1 (NOT p2) (NOT p5)) (AND (NOT p0) (NOT p5)))]
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (AND p1 (NOT p2) (NOT p5)) (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p5)) (AND (NOT p0) (NOT p4))), (OR (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p4))), (OR (AND p1 (NOT p2) (NOT p5)) (AND (NOT p0) (NOT p5)))]
Stuttering acceptance computed with spot in 270 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (AND p1 (NOT p2) (NOT p5)) (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p5)) (AND (NOT p0) (NOT p4))), (OR (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p4))), (OR (AND p1 (NOT p2) (NOT p5)) (AND (NOT p0) (NOT p5)))]
Product exploration explored 100000 steps with 2282 reset in 3991 ms.
Product exploration explored 100000 steps with 2254 reset in 4038 ms.
Applying partial POR strategy [false, false, false, true, false]
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (AND p1 (NOT p2) (NOT p5)) (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p5)) (AND (NOT p0) (NOT p4))), (OR (AND p1 (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p4))), (OR (AND p1 (NOT p2) (NOT p5)) (AND (NOT p0) (NOT p5)))]
Support contains 42 out of 696 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 696/696 places, 1844/1844 transitions.
Applied a total of 0 rules in 26 ms. Remains 696 /696 variables (removed 0) and now considering 1844/1844 (removed 0) transitions.
[2023-03-15 01:28:30] [INFO ] Flow matrix only has 1804 transitions (discarded 40 similar events)
[2023-03-15 01:28:30] [INFO ] Invariant cache hit.
[2023-03-15 01:28:31] [INFO ] Dead Transitions using invariants and state equation in 723 ms found 0 transitions.
[2023-03-15 01:28:31] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-15 01:28:31] [INFO ] Flow matrix only has 1804 transitions (discarded 40 similar events)
[2023-03-15 01:28:31] [INFO ] Invariant cache hit.
[2023-03-15 01:28:32] [INFO ] Dead Transitions using invariants and state equation in 726 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1518 ms. Remains : 696/696 places, 1844/1844 transitions.
Support contains 42 out of 696 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 696/696 places, 1844/1844 transitions.
Applied a total of 0 rules in 8 ms. Remains 696 /696 variables (removed 0) and now considering 1844/1844 (removed 0) transitions.
[2023-03-15 01:28:32] [INFO ] Flow matrix only has 1804 transitions (discarded 40 similar events)
[2023-03-15 01:28:32] [INFO ] Invariant cache hit.
[2023-03-15 01:28:32] [INFO ] Dead Transitions using invariants and state equation in 723 ms found 0 transitions.
[2023-03-15 01:28:32] [INFO ] Flow matrix only has 1804 transitions (discarded 40 similar events)
[2023-03-15 01:28:32] [INFO ] Invariant cache hit.
[2023-03-15 01:28:33] [INFO ] Implicit Places using invariants in 519 ms returned []
[2023-03-15 01:28:33] [INFO ] Flow matrix only has 1804 transitions (discarded 40 similar events)
[2023-03-15 01:28:33] [INFO ] Invariant cache hit.
[2023-03-15 01:28:34] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 01:28:46] [INFO ] Implicit Places using invariants and state equation in 12590 ms returned []
Implicit Place search using SMT with State Equation took 13111 ms to find 0 implicit places.
[2023-03-15 01:28:46] [INFO ] Flow matrix only has 1804 transitions (discarded 40 similar events)
[2023-03-15 01:28:46] [INFO ] Invariant cache hit.
[2023-03-15 01:28:46] [INFO ] Dead Transitions using invariants and state equation in 714 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14575 ms. Remains : 696/696 places, 1844/1844 transitions.
Treatment of property PolyORBLF-COL-S04J06T10-LTLFireability-00 finished in 100036 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(F(p1))&&p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(p1))||p0))))'
Found a Shortening insensitive property : PolyORBLF-COL-S04J06T10-LTLFireability-02
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 21 out of 966 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 966/966 places, 2104/2104 transitions.
Ensure Unique test removed 4 places
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 962 transition count 2044
Reduce places removed 60 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 70 rules applied. Total rules applied 130 place count 902 transition count 2034
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 140 place count 892 transition count 2034
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 120 Pre rules applied. Total rules applied 140 place count 892 transition count 1914
Deduced a syphon composed of 120 places in 1 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 3 with 240 rules applied. Total rules applied 380 place count 772 transition count 1914
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 2 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 560 place count 682 transition count 1824
Applied a total of 560 rules in 64 ms. Remains 682 /966 variables (removed 284) and now considering 1824/2104 (removed 280) transitions.
[2023-03-15 01:28:47] [INFO ] Flow matrix only has 1784 transitions (discarded 40 similar events)
// Phase 1: matrix 1784 rows 682 cols
[2023-03-15 01:28:47] [INFO ] Computed 58 place invariants in 30 ms
[2023-03-15 01:28:47] [INFO ] Dead Transitions using invariants and state equation in 714 ms found 0 transitions.
[2023-03-15 01:28:47] [INFO ] Flow matrix only has 1784 transitions (discarded 40 similar events)
[2023-03-15 01:28:47] [INFO ] Invariant cache hit.
[2023-03-15 01:28:48] [INFO ] Implicit Places using invariants in 564 ms returned [594, 595, 596, 597, 598, 599, 600, 601, 602, 603]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 566 ms to find 10 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 672/966 places, 1824/2104 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 662 transition count 1814
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 662 transition count 1814
Applied a total of 20 rules in 28 ms. Remains 662 /672 variables (removed 10) and now considering 1814/1824 (removed 10) transitions.
[2023-03-15 01:28:48] [INFO ] Flow matrix only has 1774 transitions (discarded 40 similar events)
// Phase 1: matrix 1774 rows 662 cols
[2023-03-15 01:28:48] [INFO ] Computed 48 place invariants in 25 ms
[2023-03-15 01:28:49] [INFO ] Implicit Places using invariants in 619 ms returned []
[2023-03-15 01:28:49] [INFO ] Flow matrix only has 1774 transitions (discarded 40 similar events)
[2023-03-15 01:28:49] [INFO ] Invariant cache hit.
[2023-03-15 01:28:49] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 01:28:58] [INFO ] Implicit Places using invariants and state equation in 9755 ms returned []
Implicit Place search using SMT with State Equation took 10375 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 662/966 places, 1814/2104 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 11749 ms. Remains : 662/966 places, 1814/2104 transitions.
Running random walk in product with property : PolyORBLF-COL-S04J06T10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s602 1) (GEQ s603 1) (GEQ s598 1) (GEQ s599 1) (GEQ s600 1) (GEQ s601 1) (GEQ s594 1) (GEQ s595 1) (GEQ s596 1) (GEQ s597 1)), p1:(OR (AND (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1901 reset in 430 ms.
Product exploration explored 100000 steps with 1918 reset in 457 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 p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 165 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 70 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=35 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 5 factoid took 174 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (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)), (AND (NOT p0) (NOT p1))]
[2023-03-15 01:29:00] [INFO ] Flow matrix only has 1774 transitions (discarded 40 similar events)
[2023-03-15 01:29:00] [INFO ] Invariant cache hit.
[2023-03-15 01:29:01] [INFO ] [Real]Absence check using 18 positive place invariants in 25 ms returned sat
[2023-03-15 01:29:01] [INFO ] [Real]Absence check using 18 positive and 30 generalized place invariants in 108 ms returned sat
[2023-03-15 01:29:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 01:29:03] [INFO ] [Real]Absence check using state equation in 1686 ms returned sat
[2023-03-15 01:29:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 01:29:03] [INFO ] [Nat]Absence check using 18 positive place invariants in 24 ms returned sat
[2023-03-15 01:29:04] [INFO ] [Nat]Absence check using 18 positive and 30 generalized place invariants in 112 ms returned sat
[2023-03-15 01:29:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 01:29:08] [INFO ] [Nat]Absence check using state equation in 4860 ms returned sat
[2023-03-15 01:29:08] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 01:29:11] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 01:29:13] [INFO ] [Nat]Added 200 Read/Feed constraints in 4547 ms returned sat
[2023-03-15 01:29:13] [INFO ] Deduced a trap composed of 300 places in 293 ms of which 0 ms to minimize.
[2023-03-15 01:29:14] [INFO ] Deduced a trap composed of 274 places in 286 ms of which 1 ms to minimize.
[2023-03-15 01:29:15] [INFO ] Deduced a trap composed of 55 places in 54 ms of which 0 ms to minimize.
[2023-03-15 01:29:18] [INFO ] Trap strengthening (SAT) tested/added 3/3 trap constraints in 4595 ms
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 21 out of 662 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 662/662 places, 1814/1814 transitions.
Applied a total of 0 rules in 14 ms. Remains 662 /662 variables (removed 0) and now considering 1814/1814 (removed 0) transitions.
[2023-03-15 01:29:18] [INFO ] Flow matrix only has 1774 transitions (discarded 40 similar events)
[2023-03-15 01:29:18] [INFO ] Invariant cache hit.
[2023-03-15 01:29:18] [INFO ] Dead Transitions using invariants and state equation in 667 ms found 0 transitions.
[2023-03-15 01:29:18] [INFO ] Flow matrix only has 1774 transitions (discarded 40 similar events)
[2023-03-15 01:29:18] [INFO ] Invariant cache hit.
[2023-03-15 01:29:19] [INFO ] Implicit Places using invariants in 581 ms returned []
[2023-03-15 01:29:19] [INFO ] Flow matrix only has 1774 transitions (discarded 40 similar events)
[2023-03-15 01:29:19] [INFO ] Invariant cache hit.
[2023-03-15 01:29:19] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 01:29:30] [INFO ] Implicit Places using invariants and state equation in 10917 ms returned []
Implicit Place search using SMT with State Equation took 11498 ms to find 0 implicit places.
[2023-03-15 01:29:30] [INFO ] Flow matrix only has 1774 transitions (discarded 40 similar events)
[2023-03-15 01:29:30] [INFO ] Invariant cache hit.
[2023-03-15 01:29:30] [INFO ] Dead Transitions using invariants and state equation in 678 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12858 ms. Remains : 662/662 places, 1814/1814 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 184 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 65 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=65 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 5 factoid took 209 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-15 01:29:31] [INFO ] Flow matrix only has 1774 transitions (discarded 40 similar events)
[2023-03-15 01:29:31] [INFO ] Invariant cache hit.
[2023-03-15 01:29:32] [INFO ] [Real]Absence check using 18 positive place invariants in 28 ms returned sat
[2023-03-15 01:29:32] [INFO ] [Real]Absence check using 18 positive and 30 generalized place invariants in 114 ms returned sat
[2023-03-15 01:29:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 01:29:34] [INFO ] [Real]Absence check using state equation in 1668 ms returned sat
[2023-03-15 01:29:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 01:29:35] [INFO ] [Nat]Absence check using 18 positive place invariants in 23 ms returned sat
[2023-03-15 01:29:35] [INFO ] [Nat]Absence check using 18 positive and 30 generalized place invariants in 112 ms returned sat
[2023-03-15 01:29:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 01:29:40] [INFO ] [Nat]Absence check using state equation in 4858 ms returned sat
[2023-03-15 01:29:40] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 01:29:43] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 01:29:46] [INFO ] [Nat]Added 200 Read/Feed constraints in 6021 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1892 reset in 430 ms.
Product exploration explored 100000 steps with 1882 reset in 447 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 21 out of 662 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 662/662 places, 1814/1814 transitions.
Applied a total of 0 rules in 28 ms. Remains 662 /662 variables (removed 0) and now considering 1814/1814 (removed 0) transitions.
[2023-03-15 01:29:47] [INFO ] Flow matrix only has 1774 transitions (discarded 40 similar events)
[2023-03-15 01:29:47] [INFO ] Invariant cache hit.
[2023-03-15 01:29:48] [INFO ] Dead Transitions using invariants and state equation in 664 ms found 0 transitions.
[2023-03-15 01:29:48] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-15 01:29:48] [INFO ] Flow matrix only has 1774 transitions (discarded 40 similar events)
[2023-03-15 01:29:48] [INFO ] Invariant cache hit.
[2023-03-15 01:29:48] [INFO ] Dead Transitions using invariants and state equation in 671 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1391 ms. Remains : 662/662 places, 1814/1814 transitions.
Support contains 21 out of 662 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 662/662 places, 1814/1814 transitions.
Applied a total of 0 rules in 7 ms. Remains 662 /662 variables (removed 0) and now considering 1814/1814 (removed 0) transitions.
[2023-03-15 01:29:48] [INFO ] Flow matrix only has 1774 transitions (discarded 40 similar events)
[2023-03-15 01:29:48] [INFO ] Invariant cache hit.
[2023-03-15 01:29:49] [INFO ] Dead Transitions using invariants and state equation in 672 ms found 0 transitions.
[2023-03-15 01:29:49] [INFO ] Flow matrix only has 1774 transitions (discarded 40 similar events)
[2023-03-15 01:29:49] [INFO ] Invariant cache hit.
[2023-03-15 01:29:50] [INFO ] Implicit Places using invariants in 577 ms returned []
[2023-03-15 01:29:50] [INFO ] Flow matrix only has 1774 transitions (discarded 40 similar events)
[2023-03-15 01:29:50] [INFO ] Invariant cache hit.
[2023-03-15 01:29:50] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 01:29:59] [INFO ] Implicit Places using invariants and state equation in 9456 ms returned []
Implicit Place search using SMT with State Equation took 10034 ms to find 0 implicit places.
[2023-03-15 01:29:59] [INFO ] Flow matrix only has 1774 transitions (discarded 40 similar events)
[2023-03-15 01:29:59] [INFO ] Invariant cache hit.
[2023-03-15 01:30:00] [INFO ] Dead Transitions using invariants and state equation in 666 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11381 ms. Remains : 662/662 places, 1814/1814 transitions.
Treatment of property PolyORBLF-COL-S04J06T10-LTLFireability-02 finished in 73371 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((X(((G(F(!p2))||p1) U (!p3&&(G(F(!p2))||p4))))||p0)))'
Found a Shortening insensitive property : PolyORBLF-COL-S04J06T10-LTLFireability-08
Stuttering acceptance computed with spot in 161 ms :[(OR (AND (NOT p0) p2 (NOT p4)) (AND (NOT p0) p3)), (OR (AND (NOT p0) p2 (NOT p4)) (AND (NOT p0) p3)), (OR (AND (NOT p0) p2 (NOT p4)) (AND (NOT p0) p2 p3)), (OR (AND (NOT p0) p2 (NOT p4)) (AND (NOT p0) p2 p3))]
Support contains 40 out of 966 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 966/966 places, 2104/2104 transitions.
Ensure Unique test removed 4 places
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 962 transition count 2034
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 892 transition count 2034
Performed 130 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 130 Pre rules applied. Total rules applied 140 place count 892 transition count 1904
Deduced a syphon composed of 130 places in 2 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 260 rules applied. Total rules applied 400 place count 762 transition count 1904
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 410 place count 752 transition count 1894
Iterating global reduction 2 with 10 rules applied. Total rules applied 420 place count 752 transition count 1894
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 580 place count 672 transition count 1814
Applied a total of 580 rules in 63 ms. Remains 672 /966 variables (removed 294) and now considering 1814/2104 (removed 290) transitions.
[2023-03-15 01:30:00] [INFO ] Flow matrix only has 1774 transitions (discarded 40 similar events)
// Phase 1: matrix 1774 rows 672 cols
[2023-03-15 01:30:00] [INFO ] Computed 58 place invariants in 33 ms
[2023-03-15 01:30:01] [INFO ] Dead Transitions using invariants and state equation in 737 ms found 0 transitions.
[2023-03-15 01:30:01] [INFO ] Flow matrix only has 1774 transitions (discarded 40 similar events)
[2023-03-15 01:30:01] [INFO ] Invariant cache hit.
[2023-03-15 01:30:01] [INFO ] Implicit Places using invariants in 549 ms returned [584, 585, 586, 587, 588, 589, 590, 591, 592, 593]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 551 ms to find 10 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 662/966 places, 1814/2104 transitions.
Applied a total of 0 rules in 14 ms. Remains 662 /662 variables (removed 0) and now considering 1814/1814 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1368 ms. Remains : 662/966 places, 1814/2104 transitions.
Running random walk in product with property : PolyORBLF-COL-S04J06T10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p3), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p4)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p3) (NOT p4) p2), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p0) p3) (AND (NOT p0) (NOT p4))), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p0) p3 p2) (AND (NOT p0) (NOT p4) p2)), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p0) p3 p2) (AND (NOT p0) (NOT p4) p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s214 1) (GEQ s342 1) (GEQ s594 1)) (AND (GEQ s214 1) (GEQ s337 1) (GEQ s594 1)) (AND (GEQ s214 1) (GEQ s341 1) (GEQ s594 1)) (AND (GEQ s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3928 reset in 725 ms.
Product exploration explored 100000 steps with 3945 reset in 747 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 p0) p3 (NOT p4) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p3) (NOT p4) p2))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p4)))), (X (AND (NOT p0) p3)), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p4) p2)))), (X (X (OR (AND (NOT p0) p3) (AND (NOT p0) (NOT p4))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p4))))), (X (X (NOT (OR (AND (NOT p0) p3 p2) (AND (NOT p0) (NOT p4) p2))))), (X (X (AND (NOT p0) p3)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 402 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(OR (AND (NOT p0) p2 (NOT p4)) (AND (NOT p0) p3)), (OR (AND (NOT p0) p2 (NOT p4)) (AND (NOT p0) p3)), (OR (AND (NOT p0) p2 (NOT p4)) (AND (NOT p0) p2 p3)), (OR (AND (NOT p0) p2 (NOT p4)) (AND (NOT p0) p2 p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-15 01:30:04] [INFO ] Flow matrix only has 1774 transitions (discarded 40 similar events)
// Phase 1: matrix 1774 rows 662 cols
[2023-03-15 01:30:04] [INFO ] Computed 48 place invariants in 36 ms
[2023-03-15 01:30:04] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p3 (NOT p4) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p3) (NOT p4) p2))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p4)))), (X (AND (NOT p0) p3)), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p4) p2)))), (X (X (OR (AND (NOT p0) p3) (AND (NOT p0) (NOT p4))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p4))))), (X (X (NOT (OR (AND (NOT p0) p3 p2) (AND (NOT p0) (NOT p4) p2))))), (X (X (AND (NOT p0) p3))), (G (NOT (AND (NOT p4) p2 (NOT p0) (NOT p3)))), (G (NOT (AND (NOT p4) (NOT p0) (NOT p3))))]
False Knowledge obtained : [(F (OR (AND (NOT p4) p2 (NOT p0)) (AND p2 (NOT p0) p3))), (F (NOT (OR (AND (NOT p4) (NOT p0)) (AND (NOT p0) p3)))), (F (NOT (AND (NOT p0) p3)))]
Knowledge based reduction with 11 factoid took 421 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 2 states, 2 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) p3), (AND (NOT p0) p3)]
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) p3), (AND (NOT p0) p3)]
[2023-03-15 01:30:05] [INFO ] Flow matrix only has 1774 transitions (discarded 40 similar events)
[2023-03-15 01:30:05] [INFO ] Invariant cache hit.
[2023-03-15 01:30:06] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-15 01:30:06] [INFO ] [Real]Absence check using 17 positive and 31 generalized place invariants in 47 ms returned sat
[2023-03-15 01:30:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 01:30:08] [INFO ] [Real]Absence check using state equation in 1934 ms returned sat
[2023-03-15 01:30:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 01:30:09] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-15 01:30:09] [INFO ] [Nat]Absence check using 17 positive and 31 generalized place invariants in 79 ms returned sat
[2023-03-15 01:30:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 01:30:12] [INFO ] [Nat]Absence check using state equation in 3719 ms returned sat
[2023-03-15 01:30:12] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 01:30:15] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 01:30:18] [INFO ] [Nat]Added 200 Read/Feed constraints in 6063 ms returned unknown
Could not prove EG (AND (NOT p0) p3)
Support contains 12 out of 662 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 662/662 places, 1814/1814 transitions.
Applied a total of 0 rules in 7 ms. Remains 662 /662 variables (removed 0) and now considering 1814/1814 (removed 0) transitions.
[2023-03-15 01:30:18] [INFO ] Flow matrix only has 1774 transitions (discarded 40 similar events)
[2023-03-15 01:30:18] [INFO ] Invariant cache hit.
[2023-03-15 01:30:19] [INFO ] Dead Transitions using invariants and state equation in 703 ms found 0 transitions.
[2023-03-15 01:30:19] [INFO ] Flow matrix only has 1774 transitions (discarded 40 similar events)
[2023-03-15 01:30:19] [INFO ] Invariant cache hit.
[2023-03-15 01:30:20] [INFO ] Implicit Places using invariants in 523 ms returned []
[2023-03-15 01:30:20] [INFO ] Flow matrix only has 1774 transitions (discarded 40 similar events)
[2023-03-15 01:30:20] [INFO ] Invariant cache hit.
[2023-03-15 01:30:20] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 01:30:37] [INFO ] Implicit Places using invariants and state equation in 17224 ms returned []
Implicit Place search using SMT with State Equation took 17750 ms to find 0 implicit places.
[2023-03-15 01:30:37] [INFO ] Flow matrix only has 1774 transitions (discarded 40 similar events)
[2023-03-15 01:30:37] [INFO ] Invariant cache hit.
[2023-03-15 01:30:38] [INFO ] Dead Transitions using invariants and state equation in 696 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19160 ms. Remains : 662/662 places, 1814/1814 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p3), (X (AND (NOT p0) p3)), (X (X (AND (NOT p0) p3)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p0) p3)]
Finished random walk after 22 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND (NOT p0) p3), (X (AND (NOT p0) p3)), (X (X (AND (NOT p0) p3)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p3)))]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 23 ms :[(AND (NOT p0) p3)]
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) p3)]
[2023-03-15 01:30:38] [INFO ] Flow matrix only has 1774 transitions (discarded 40 similar events)
[2023-03-15 01:30:38] [INFO ] Invariant cache hit.
[2023-03-15 01:30:39] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-15 01:30:39] [INFO ] [Real]Absence check using 17 positive and 31 generalized place invariants in 52 ms returned sat
[2023-03-15 01:30:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 01:30:41] [INFO ] [Real]Absence check using state equation in 1927 ms returned sat
[2023-03-15 01:30:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 01:30:42] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 01:30:42] [INFO ] [Nat]Absence check using 17 positive and 31 generalized place invariants in 80 ms returned sat
[2023-03-15 01:30:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 01:30:45] [INFO ] [Nat]Absence check using state equation in 3676 ms returned sat
[2023-03-15 01:30:45] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 01:30:49] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 01:30:52] [INFO ] [Nat]Added 200 Read/Feed constraints in 6050 ms returned unknown
Could not prove EG (AND (NOT p0) p3)
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) p3)]
Product exploration explored 100000 steps with 3948 reset in 498 ms.
Product exploration explored 100000 steps with 3955 reset in 514 ms.
Support contains 12 out of 662 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 662/662 places, 1814/1814 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 652 transition count 1804
Applied a total of 20 rules in 33 ms. Remains 652 /662 variables (removed 10) and now considering 1804/1814 (removed 10) transitions.
[2023-03-15 01:30:53] [INFO ] Flow matrix only has 1764 transitions (discarded 40 similar events)
// Phase 1: matrix 1764 rows 652 cols
[2023-03-15 01:30:53] [INFO ] Computed 48 place invariants in 36 ms
[2023-03-15 01:30:53] [INFO ] Dead Transitions using invariants and state equation in 714 ms found 0 transitions.
[2023-03-15 01:30:53] [INFO ] Flow matrix only has 1764 transitions (discarded 40 similar events)
[2023-03-15 01:30:53] [INFO ] Invariant cache hit.
[2023-03-15 01:30:54] [INFO ] Implicit Places using invariants in 532 ms returned []
[2023-03-15 01:30:54] [INFO ] Flow matrix only has 1764 transitions (discarded 40 similar events)
[2023-03-15 01:30:54] [INFO ] Invariant cache hit.
[2023-03-15 01:30:54] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 01:31:12] [INFO ] Implicit Places using invariants and state equation in 18290 ms returned []
Implicit Place search using SMT with State Equation took 18824 ms to find 0 implicit places.
[2023-03-15 01:31:12] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-15 01:31:12] [INFO ] Flow matrix only has 1764 transitions (discarded 40 similar events)
[2023-03-15 01:31:12] [INFO ] Invariant cache hit.
[2023-03-15 01:31:13] [INFO ] Dead Transitions using invariants and state equation in 665 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 652/662 places, 1804/1814 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20273 ms. Remains : 652/662 places, 1804/1814 transitions.
Treatment of property PolyORBLF-COL-S04J06T10-LTLFireability-08 finished in 73135 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(((F((p1&&F(!p2))) U X(p3))||p0)))'
Found a Shortening insensitive property : PolyORBLF-COL-S04J06T10-LTLFireability-09
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Support contains 28 out of 966 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LI_LTL mode, iteration 0 : 966/966 places, 2104/2104 transitions.
Ensure Unique test removed 4 places
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 962 transition count 2054
Reduce places removed 50 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 1 with 70 rules applied. Total rules applied 120 place count 912 transition count 2034
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 140 place count 892 transition count 2034
Performed 130 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 130 Pre rules applied. Total rules applied 140 place count 892 transition count 1904
Deduced a syphon composed of 130 places in 1 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 260 rules applied. Total rules applied 400 place count 762 transition count 1904
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 540 place count 692 transition count 1834
Applied a total of 540 rules in 58 ms. Remains 692 /966 variables (removed 274) and now considering 1834/2104 (removed 270) transitions.
[2023-03-15 01:31:13] [INFO ] Flow matrix only has 1794 transitions (discarded 40 similar events)
// Phase 1: matrix 1794 rows 692 cols
[2023-03-15 01:31:13] [INFO ] Computed 58 place invariants in 33 ms
[2023-03-15 01:31:14] [INFO ] Dead Transitions using invariants and state equation in 751 ms found 0 transitions.
[2023-03-15 01:31:14] [INFO ] Flow matrix only has 1794 transitions (discarded 40 similar events)
[2023-03-15 01:31:14] [INFO ] Invariant cache hit.
[2023-03-15 01:31:14] [INFO ] Implicit Places using invariants in 541 ms returned []
[2023-03-15 01:31:14] [INFO ] Flow matrix only has 1794 transitions (discarded 40 similar events)
[2023-03-15 01:31:14] [INFO ] Invariant cache hit.
[2023-03-15 01:31:15] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 01:31:34] [INFO ] Implicit Places using invariants and state equation in 19172 ms returned []
Implicit Place search using SMT with State Equation took 19714 ms to find 0 implicit places.
[2023-03-15 01:31:34] [INFO ] Flow matrix only has 1794 transitions (discarded 40 similar events)
[2023-03-15 01:31:34] [INFO ] Invariant cache hit.
[2023-03-15 01:31:34] [INFO ] Dead Transitions using invariants and state equation in 717 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 692/966 places, 1834/2104 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 21244 ms. Remains : 692/966 places, 1834/2104 transitions.
Running random walk in product with property : PolyORBLF-COL-S04J06T10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s439 1) (GEQ s444 1)) (AND (GEQ s439 1) (GEQ s443 1)) (AND (GEQ s439 1) (GEQ s442 1)) (AND (GEQ s439 1) (GEQ s441 1)) (AND (GEQ s439 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 2135 reset in 575 ms.
Product exploration explored 100000 steps with 2098 reset in 600 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 p0) (NOT p3)), (X (AND (NOT p0) (NOT p3))), (X (X (AND (NOT p0) (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(AND (NOT p0) (NOT p3))]
Finished random walk after 59 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=59 )
Knowledge obtained : [(AND (NOT p0) (NOT p3)), (X (AND (NOT p0) (NOT p3))), (X (X (AND (NOT p0) (NOT p3))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p3))))]
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p3))]
[2023-03-15 01:31:36] [INFO ] Flow matrix only has 1794 transitions (discarded 40 similar events)
[2023-03-15 01:31:36] [INFO ] Invariant cache hit.
[2023-03-15 01:31:37] [INFO ] [Real]Absence check using 18 positive place invariants in 38 ms returned sat
[2023-03-15 01:31:38] [INFO ] [Real]Absence check using 18 positive and 40 generalized place invariants in 182 ms returned sat
[2023-03-15 01:31:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 01:31:39] [INFO ] [Real]Absence check using state equation in 1818 ms returned sat
[2023-03-15 01:31:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 01:31:41] [INFO ] [Nat]Absence check using 18 positive place invariants in 44 ms returned sat
[2023-03-15 01:31:42] [INFO ] [Nat]Absence check using 18 positive and 40 generalized place invariants in 922 ms returned sat
[2023-03-15 01:31:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 01:31:48] [INFO ] [Nat]Absence check using state equation in 5983 ms returned sat
[2023-03-15 01:31:48] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 01:31:50] [INFO ] [Nat]Added 200 Read/Feed constraints in 2381 ms returned sat
[2023-03-15 01:31:51] [INFO ] Deduced a trap composed of 56 places in 298 ms of which 1 ms to minimize.
[2023-03-15 01:31:52] [INFO ] Deduced a trap composed of 56 places in 289 ms of which 0 ms to minimize.
[2023-03-15 01:31:54] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 4240 ms
Could not prove EG (AND (NOT p0) (NOT p3))
Support contains 28 out of 692 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 692/692 places, 1834/1834 transitions.
Applied a total of 0 rules in 32 ms. Remains 692 /692 variables (removed 0) and now considering 1834/1834 (removed 0) transitions.
[2023-03-15 01:31:55] [INFO ] Flow matrix only has 1794 transitions (discarded 40 similar events)
[2023-03-15 01:31:55] [INFO ] Invariant cache hit.
[2023-03-15 01:31:55] [INFO ] Dead Transitions using invariants and state equation in 723 ms found 0 transitions.
[2023-03-15 01:31:55] [INFO ] Flow matrix only has 1794 transitions (discarded 40 similar events)
[2023-03-15 01:31:55] [INFO ] Invariant cache hit.
[2023-03-15 01:31:56] [INFO ] Implicit Places using invariants in 503 ms returned []
[2023-03-15 01:31:56] [INFO ] Flow matrix only has 1794 transitions (discarded 40 similar events)
[2023-03-15 01:31:56] [INFO ] Invariant cache hit.
[2023-03-15 01:31:56] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 01:32:10] [INFO ] Implicit Places using invariants and state equation in 14197 ms returned []
Implicit Place search using SMT with State Equation took 14701 ms to find 0 implicit places.
[2023-03-15 01:32:10] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-15 01:32:10] [INFO ] Flow matrix only has 1794 transitions (discarded 40 similar events)
[2023-03-15 01:32:10] [INFO ] Invariant cache hit.
[2023-03-15 01:32:11] [INFO ] Dead Transitions using invariants and state equation in 737 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16236 ms. Remains : 692/692 places, 1834/1834 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p3)), (X (AND (NOT p0) (NOT p3))), (X (X (AND (NOT p0) (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p3))]
Finished random walk after 75 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=75 )
Knowledge obtained : [(AND (NOT p0) (NOT p3)), (X (AND (NOT p0) (NOT p3))), (X (X (AND (NOT p0) (NOT p3))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p3))))]
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 22 ms :[(AND (NOT p0) (NOT p3))]
[2023-03-15 01:32:11] [INFO ] Flow matrix only has 1794 transitions (discarded 40 similar events)
[2023-03-15 01:32:11] [INFO ] Invariant cache hit.
[2023-03-15 01:32:13] [INFO ] [Real]Absence check using 18 positive place invariants in 39 ms returned sat
[2023-03-15 01:32:13] [INFO ] [Real]Absence check using 18 positive and 40 generalized place invariants in 187 ms returned sat
[2023-03-15 01:32:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 01:32:15] [INFO ] [Real]Absence check using state equation in 1872 ms returned sat
[2023-03-15 01:32:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 01:32:16] [INFO ] [Nat]Absence check using 18 positive place invariants in 44 ms returned sat
[2023-03-15 01:32:17] [INFO ] [Nat]Absence check using 18 positive and 40 generalized place invariants in 925 ms returned sat
[2023-03-15 01:32:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 01:32:23] [INFO ] [Nat]Absence check using state equation in 6029 ms returned sat
[2023-03-15 01:32:23] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 01:32:26] [INFO ] [Nat]Added 200 Read/Feed constraints in 2377 ms returned sat
[2023-03-15 01:32:26] [INFO ] Deduced a trap composed of 56 places in 294 ms of which 1 ms to minimize.
[2023-03-15 01:32:28] [INFO ] Deduced a trap composed of 56 places in 294 ms of which 1 ms to minimize.
[2023-03-15 01:32:30] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 4198 ms
Could not prove EG (AND (NOT p0) (NOT p3))
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 2140 reset in 584 ms.
Product exploration explored 100000 steps with 2128 reset in 613 ms.
Support contains 28 out of 692 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 692/692 places, 1834/1834 transitions.
Applied a total of 0 rules in 24 ms. Remains 692 /692 variables (removed 0) and now considering 1834/1834 (removed 0) transitions.
[2023-03-15 01:32:31] [INFO ] Flow matrix only has 1794 transitions (discarded 40 similar events)
[2023-03-15 01:32:31] [INFO ] Invariant cache hit.
[2023-03-15 01:32:32] [INFO ] Dead Transitions using invariants and state equation in 727 ms found 0 transitions.
[2023-03-15 01:32:32] [INFO ] Flow matrix only has 1794 transitions (discarded 40 similar events)
[2023-03-15 01:32:32] [INFO ] Invariant cache hit.
[2023-03-15 01:32:32] [INFO ] Implicit Places using invariants in 551 ms returned [594, 595, 596, 597, 598, 599, 600, 601, 602, 603]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 552 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 682/692 places, 1834/1834 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 672 transition count 1824
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 672 transition count 1824
Applied a total of 20 rules in 36 ms. Remains 672 /682 variables (removed 10) and now considering 1824/1834 (removed 10) transitions.
[2023-03-15 01:32:32] [INFO ] Flow matrix only has 1784 transitions (discarded 40 similar events)
// Phase 1: matrix 1784 rows 672 cols
[2023-03-15 01:32:32] [INFO ] Computed 48 place invariants in 34 ms
[2023-03-15 01:32:33] [INFO ] Implicit Places using invariants in 591 ms returned []
[2023-03-15 01:32:33] [INFO ] Flow matrix only has 1784 transitions (discarded 40 similar events)
[2023-03-15 01:32:33] [INFO ] Invariant cache hit.
[2023-03-15 01:32:34] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-15 01:32:48] [INFO ] Implicit Places using invariants and state equation in 14635 ms returned []
Implicit Place search using SMT with State Equation took 15226 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 672/692 places, 1824/1834 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 16577 ms. Remains : 672/692 places, 1824/1834 transitions.
Treatment of property PolyORBLF-COL-S04J06T10-LTLFireability-09 finished in 94683 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 U p1))))'
[2023-03-15 01:32:48] [INFO ] Flatten gal took : 115 ms
[2023-03-15 01:32:48] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/LTLFireability.sr.xml took 27 ms.
[2023-03-15 01:32:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 966 places, 2104 transitions and 9424 arcs took 15 ms.
Total runtime 1095089 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT PolyORBLF-COL-S04J06T10
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability
FORMULA PolyORBLF-COL-S04J06T10-LTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1678844571961
--------------------
content from stderr:
+ 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:550
lola: rewrite Frontend/Parser/formula_rewrite.k:550
lola: rewrite Frontend/Parser/formula_rewrite.k:550
lola: rewrite Frontend/Parser/formula_rewrite.k:550
lola: rewrite Frontend/Parser/formula_rewrite.k:550
lola: rewrite Frontend/Parser/formula_rewrite.k:550
lola: rewrite Frontend/Parser/formula_rewrite.k:550
lola: rewrite Frontend/Parser/formula_rewrite.k:550
lola: rewrite Frontend/Parser/formula_rewrite.k:376
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 6 (type EXCL) for 3 PolyORBLF-COL-S04J06T10-LTLFireability-01
lola: time limit : 253 sec
lola: memory limit: 32 pages
lola: FINISHED task # 6 (type EXCL) for PolyORBLF-COL-S04J06T10-LTLFireability-01
lola: result : true
lola: markings : 5
lola: fired transitions : 4
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 10 (type EXCL) for 3 PolyORBLF-COL-S04J06T10-LTLFireability-01
lola: time limit : 272 sec
lola: memory limit: 32 pages
lola: FINISHED task # 10 (type EXCL) for PolyORBLF-COL-S04J06T10-LTLFireability-01
lola: result : true
lola: markings : 5
lola: fired transitions : 4
lola: time used : 0.000000
lola: memory pages used : 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL 1 0 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 7 0 0 0 11 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 1 0 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 1 0 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 1 0 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 1 0 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 62 secs. Pages in use: 1
# running tasks: 0 of 4 Visible: 6
lola: LAUNCH task # 45 (type EXCL) for 44 PolyORBLF-COL-S04J06T10-LTLFireability-09
lola: time limit : 294 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 7 0 0 11 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
45 LTL EXCL 4/294 4/32 PolyORBLF-COL-S04J06T10-LTLFireability-09 213591 m, 42718 m/sec, 401494 t fired, .
Time elapsed: 67 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 7 0 0 11 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
45 LTL EXCL 9/294 8/32 PolyORBLF-COL-S04J06T10-LTLFireability-09 485816 m, 54445 m/sec, 975199 t fired, .
Time elapsed: 72 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 7 0 0 11 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
45 LTL EXCL 14/294 12/32 PolyORBLF-COL-S04J06T10-LTLFireability-09 754342 m, 53705 m/sec, 1539778 t fired, .
Time elapsed: 77 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 7 0 0 11 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
45 LTL EXCL 19/294 16/32 PolyORBLF-COL-S04J06T10-LTLFireability-09 1025578 m, 54247 m/sec, 2104395 t fired, .
Time elapsed: 82 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 7 0 0 11 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
45 LTL EXCL 24/294 20/32 PolyORBLF-COL-S04J06T10-LTLFireability-09 1291204 m, 53125 m/sec, 2677214 t fired, .
Time elapsed: 87 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 7 0 0 11 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
45 LTL EXCL 29/294 23/32 PolyORBLF-COL-S04J06T10-LTLFireability-09 1553895 m, 52538 m/sec, 3240994 t fired, .
Time elapsed: 92 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 7 0 0 11 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
45 LTL EXCL 34/294 27/32 PolyORBLF-COL-S04J06T10-LTLFireability-09 1827262 m, 54673 m/sec, 3815487 t fired, .
Time elapsed: 97 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 7 0 0 11 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
45 LTL EXCL 39/294 31/32 PolyORBLF-COL-S04J06T10-LTLFireability-09 2102523 m, 55052 m/sec, 4390103 t fired, .
Time elapsed: 102 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 6
lola: CANCELED task # 45 (type EXCL) for PolyORBLF-COL-S04J06T10-LTLFireability-09 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 7 0 0 11 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 107 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: LAUNCH task # 42 (type EXCL) for 41 PolyORBLF-COL-S04J06T10-LTLFireability-08
lola: time limit : 317 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 7 0 0 11 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
42 LTL EXCL 5/317 3/32 PolyORBLF-COL-S04J06T10-LTLFireability-08 187941 m, 37588 m/sec, 351927 t fired, .
Time elapsed: 112 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 7 0 0 11 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
42 LTL EXCL 10/317 5/32 PolyORBLF-COL-S04J06T10-LTLFireability-08 360790 m, 34569 m/sec, 770917 t fired, .
Time elapsed: 117 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 7 0 0 11 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
42 LTL EXCL 15/317 7/32 PolyORBLF-COL-S04J06T10-LTLFireability-08 518602 m, 31562 m/sec, 1240865 t fired, .
Time elapsed: 122 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 7 0 0 11 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
42 LTL EXCL 20/317 10/32 PolyORBLF-COL-S04J06T10-LTLFireability-08 693252 m, 34930 m/sec, 1672473 t fired, .
Time elapsed: 127 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 7 0 0 11 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
42 LTL EXCL 25/317 12/32 PolyORBLF-COL-S04J06T10-LTLFireability-08 869579 m, 35265 m/sec, 2107382 t fired, .
Time elapsed: 132 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 7 0 0 11 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
42 LTL EXCL 30/317 14/32 PolyORBLF-COL-S04J06T10-LTLFireability-08 1044022 m, 34888 m/sec, 2540742 t fired, .
Time elapsed: 137 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 7 0 0 11 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
42 LTL EXCL 35/317 16/32 PolyORBLF-COL-S04J06T10-LTLFireability-08 1211251 m, 33445 m/sec, 2978862 t fired, .
Time elapsed: 142 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 7 0 0 11 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
42 LTL EXCL 40/317 19/32 PolyORBLF-COL-S04J06T10-LTLFireability-08 1387388 m, 35227 m/sec, 3372311 t fired, .
Time elapsed: 147 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 7 0 0 11 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
42 LTL EXCL 45/317 21/32 PolyORBLF-COL-S04J06T10-LTLFireability-08 1547388 m, 32000 m/sec, 3825056 t fired, .
Time elapsed: 152 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 7 0 0 11 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
42 LTL EXCL 50/317 23/32 PolyORBLF-COL-S04J06T10-LTLFireability-08 1713179 m, 33158 m/sec, 4261511 t fired, .
Time elapsed: 157 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 7 0 0 11 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
42 LTL EXCL 55/317 25/32 PolyORBLF-COL-S04J06T10-LTLFireability-08 1886349 m, 34634 m/sec, 4691439 t fired, .
Time elapsed: 162 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 7 0 0 11 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
42 LTL EXCL 60/317 27/32 PolyORBLF-COL-S04J06T10-LTLFireability-08 2061109 m, 34952 m/sec, 5124045 t fired, .
Time elapsed: 167 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 7 0 0 11 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
42 LTL EXCL 65/317 30/32 PolyORBLF-COL-S04J06T10-LTLFireability-08 2234928 m, 34763 m/sec, 5564633 t fired, .
Time elapsed: 172 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 7 0 0 11 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
42 LTL EXCL 70/317 32/32 PolyORBLF-COL-S04J06T10-LTLFireability-08 2413519 m, 35718 m/sec, 5981701 t fired, .
Time elapsed: 177 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: CANCELED task # 42 (type EXCL) for PolyORBLF-COL-S04J06T10-LTLFireability-08 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 7 0 0 11 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 182 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: LAUNCH task # 39 (type EXCL) for 38 PolyORBLF-COL-S04J06T10-LTLFireability-02
lola: time limit : 341 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 7 0 0 11 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
39 LTL EXCL 5/341 4/32 PolyORBLF-COL-S04J06T10-LTLFireability-02 310219 m, 62043 m/sec, 851904 t fired, .
Time elapsed: 187 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 7 0 0 11 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
39 LTL EXCL 10/341 7/32 PolyORBLF-COL-S04J06T10-LTLFireability-02 565239 m, 51004 m/sec, 1738881 t fired, .
Time elapsed: 192 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 7 0 0 11 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
39 LTL EXCL 15/341 9/32 PolyORBLF-COL-S04J06T10-LTLFireability-02 818362 m, 50624 m/sec, 2616335 t fired, .
Time elapsed: 197 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 7 0 0 11 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
39 LTL EXCL 20/341 12/32 PolyORBLF-COL-S04J06T10-LTLFireability-02 1065129 m, 49353 m/sec, 3498330 t fired, .
Time elapsed: 202 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 7 0 0 11 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
39 LTL EXCL 25/341 15/32 PolyORBLF-COL-S04J06T10-LTLFireability-02 1309193 m, 48812 m/sec, 4385389 t fired, .
Time elapsed: 207 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 7 0 0 11 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
39 LTL EXCL 30/341 17/32 PolyORBLF-COL-S04J06T10-LTLFireability-02 1562557 m, 50672 m/sec, 5264605 t fired, .
Time elapsed: 212 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 7 0 0 11 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
39 LTL EXCL 35/341 20/32 PolyORBLF-COL-S04J06T10-LTLFireability-02 1804926 m, 48473 m/sec, 6149775 t fired, .
Time elapsed: 217 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 7 0 0 11 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
39 LTL EXCL 40/341 22/32 PolyORBLF-COL-S04J06T10-LTLFireability-02 2056150 m, 50244 m/sec, 7034591 t fired, .
Time elapsed: 222 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 7 0 0 11 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
39 LTL EXCL 45/341 25/32 PolyORBLF-COL-S04J06T10-LTLFireability-02 2284106 m, 45591 m/sec, 7925013 t fired, .
Time elapsed: 227 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 7 0 0 11 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
39 LTL EXCL 50/341 27/32 PolyORBLF-COL-S04J06T10-LTLFireability-02 2524413 m, 48061 m/sec, 8809218 t fired, .
Time elapsed: 232 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 7 0 0 11 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
39 LTL EXCL 55/341 30/32 PolyORBLF-COL-S04J06T10-LTLFireability-02 2763931 m, 47903 m/sec, 9689535 t fired, .
Time elapsed: 237 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 7 0 0 11 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
39 LTL EXCL 60/341 32/32 PolyORBLF-COL-S04J06T10-LTLFireability-02 3003589 m, 47931 m/sec, 10579186 t fired, .
Time elapsed: 242 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: CANCELED task # 39 (type EXCL) for PolyORBLF-COL-S04J06T10-LTLFireability-02 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 7 0 0 11 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 247 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: LAUNCH task # 34 (type EXCL) for 3 PolyORBLF-COL-S04J06T10-LTLFireability-01
lola: time limit : 372 sec
lola: memory limit: 32 pages
lola: FINISHED task # 34 (type EXCL) for PolyORBLF-COL-S04J06T10-LTLFireability-01
lola: result : true
lola: markings : 5
lola: fired transitions : 4
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 30 (type EXCL) for 3 PolyORBLF-COL-S04J06T10-LTLFireability-01
lola: time limit : 419 sec
lola: memory limit: 32 pages
lola: FINISHED task # 30 (type EXCL) for PolyORBLF-COL-S04J06T10-LTLFireability-01
lola: result : true
lola: markings : 5
lola: fired transitions : 4
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 26 (type EXCL) for 3 PolyORBLF-COL-S04J06T10-LTLFireability-01
lola: time limit : 479 sec
lola: memory limit: 32 pages
lola: FINISHED task # 26 (type EXCL) for PolyORBLF-COL-S04J06T10-LTLFireability-01
lola: result : true
lola: markings : 5
lola: fired transitions : 4
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 22 (type EXCL) for 3 PolyORBLF-COL-S04J06T10-LTLFireability-01
lola: time limit : 558 sec
lola: memory limit: 32 pages
lola: FINISHED task # 22 (type EXCL) for PolyORBLF-COL-S04J06T10-LTLFireability-01
lola: result : true
lola: markings : 5
lola: fired transitions : 4
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 18 (type EXCL) for 3 PolyORBLF-COL-S04J06T10-LTLFireability-01
lola: time limit : 670 sec
lola: memory limit: 32 pages
lola: FINISHED task # 18 (type EXCL) for PolyORBLF-COL-S04J06T10-LTLFireability-01
lola: result : true
lola: markings : 5
lola: fired transitions : 4
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 14 (type EXCL) for 3 PolyORBLF-COL-S04J06T10-LTLFireability-01
lola: time limit : 838 sec
lola: memory limit: 32 pages
lola: FINISHED task # 14 (type EXCL) for PolyORBLF-COL-S04J06T10-LTLFireability-01
lola: result : true
lola: markings : 5
lola: fired transitions : 4
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 PolyORBLF-COL-S04J06T10-LTLFireability-00
lola: time limit : 1117 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 1 0 0 17 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/1117 1/32 PolyORBLF-COL-S04J06T10-LTLFireability-00 225 m, 45 m/sec, 252 t fired, .
Time elapsed: 252 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 1 0 0 17 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/1117 1/32 PolyORBLF-COL-S04J06T10-LTLFireability-00 353 m, 25 m/sec, 384 t fired, .
Time elapsed: 257 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: FINISHED task # 1 (type EXCL) for PolyORBLF-COL-S04J06T10-LTLFireability-00
lola: result : false
lola: markings : 430
lola: fired transitions : 466
lola: time used : 13.000000
lola: memory pages used : 1
lola: LAUNCH task # 36 (type EXCL) for 3 PolyORBLF-COL-S04J06T10-LTLFireability-01
lola: time limit : 1670 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 1 0 17 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
36 LTL EXCL 2/1670 1/32 PolyORBLF-COL-S04J06T10-LTLFireability-01 47896 m, 9579 m/sec, 60338 t fired, .
Time elapsed: 262 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 1 0 17 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
36 LTL EXCL 7/1670 2/32 PolyORBLF-COL-S04J06T10-LTLFireability-01 149273 m, 20275 m/sec, 198173 t fired, .
Time elapsed: 267 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 1 0 17 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
36 LTL EXCL 12/1670 4/32 PolyORBLF-COL-S04J06T10-LTLFireability-01 251523 m, 20450 m/sec, 342492 t fired, .
Time elapsed: 272 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 1 0 17 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
36 LTL EXCL 17/1670 5/32 PolyORBLF-COL-S04J06T10-LTLFireability-01 351174 m, 19930 m/sec, 484899 t fired, .
Time elapsed: 277 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 1 0 17 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
36 LTL EXCL 22/1670 6/32 PolyORBLF-COL-S04J06T10-LTLFireability-01 450189 m, 19803 m/sec, 626954 t fired, .
Time elapsed: 282 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 1 0 17 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
36 LTL EXCL 27/1670 7/32 PolyORBLF-COL-S04J06T10-LTLFireability-01 548681 m, 19698 m/sec, 769380 t fired, .
Time elapsed: 287 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 1 0 17 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
36 LTL EXCL 32/1670 8/32 PolyORBLF-COL-S04J06T10-LTLFireability-01 646420 m, 19547 m/sec, 910559 t fired, .
Time elapsed: 292 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 1 0 17 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
36 LTL EXCL 37/1670 10/32 PolyORBLF-COL-S04J06T10-LTLFireability-01 742959 m, 19307 m/sec, 1052946 t fired, .
Time elapsed: 297 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 1 0 17 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
36 LTL EXCL 42/1670 11/32 PolyORBLF-COL-S04J06T10-LTLFireability-01 839614 m, 19331 m/sec, 1194386 t fired, .
Time elapsed: 302 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 1 0 17 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
36 LTL EXCL 47/1670 12/32 PolyORBLF-COL-S04J06T10-LTLFireability-01 935948 m, 19266 m/sec, 1335986 t fired, .
Time elapsed: 307 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 1 0 17 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
36 LTL EXCL 52/1670 13/32 PolyORBLF-COL-S04J06T10-LTLFireability-01 1030947 m, 18999 m/sec, 1475276 t fired, .
Time elapsed: 312 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 1 0 17 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
36 LTL EXCL 57/1670 14/32 PolyORBLF-COL-S04J06T10-LTLFireability-01 1127144 m, 19239 m/sec, 1619650 t fired, .
Time elapsed: 317 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 1 0 17 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
36 LTL EXCL 62/1670 15/32 PolyORBLF-COL-S04J06T10-LTLFireability-01 1221569 m, 18885 m/sec, 1761065 t fired, .
Time elapsed: 322 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 1 0 17 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
36 LTL EXCL 67/1670 16/32 PolyORBLF-COL-S04J06T10-LTLFireability-01 1315076 m, 18701 m/sec, 1901095 t fired, .
Time elapsed: 327 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 1 0 17 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
36 LTL EXCL 72/1670 17/32 PolyORBLF-COL-S04J06T10-LTLFireability-01 1408989 m, 18782 m/sec, 2042833 t fired, .
Time elapsed: 332 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 1 0 17 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
36 LTL EXCL 77/1670 18/32 PolyORBLF-COL-S04J06T10-LTLFireability-01 1501912 m, 18584 m/sec, 2180627 t fired, .
Time elapsed: 337 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 1 0 17 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
36 LTL EXCL 82/1670 20/32 PolyORBLF-COL-S04J06T10-LTLFireability-01 1596166 m, 18850 m/sec, 2321703 t fired, .
Time elapsed: 342 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 1 0 17 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
36 LTL EXCL 87/1670 21/32 PolyORBLF-COL-S04J06T10-LTLFireability-01 1691259 m, 19018 m/sec, 2463919 t fired, .
Time elapsed: 347 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 1 0 17 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
36 LTL EXCL 92/1670 22/32 PolyORBLF-COL-S04J06T10-LTLFireability-01 1786203 m, 18988 m/sec, 2605145 t fired, .
Time elapsed: 352 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 1 0 17 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
36 LTL EXCL 97/1670 23/32 PolyORBLF-COL-S04J06T10-LTLFireability-01 1879233 m, 18606 m/sec, 2744010 t fired, .
Time elapsed: 357 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 1 0 17 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
36 LTL EXCL 102/1670 24/32 PolyORBLF-COL-S04J06T10-LTLFireability-01 1973805 m, 18914 m/sec, 2886510 t fired, .
Time elapsed: 362 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 1 0 17 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
36 LTL EXCL 107/1670 25/32 PolyORBLF-COL-S04J06T10-LTLFireability-01 2068709 m, 18980 m/sec, 3030935 t fired, .
Time elapsed: 367 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 1 0 17 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
36 LTL EXCL 112/1670 26/32 PolyORBLF-COL-S04J06T10-LTLFireability-01 2162662 m, 18790 m/sec, 3173522 t fired, .
Time elapsed: 372 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 1 0 17 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
36 LTL EXCL 117/1670 27/32 PolyORBLF-COL-S04J06T10-LTLFireability-01 2258064 m, 19080 m/sec, 3320076 t fired, .
Time elapsed: 377 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 1 0 17 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
36 LTL EXCL 122/1670 28/32 PolyORBLF-COL-S04J06T10-LTLFireability-01 2354196 m, 19226 m/sec, 3467457 t fired, .
Time elapsed: 382 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 1 0 17 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
36 LTL EXCL 127/1670 29/32 PolyORBLF-COL-S04J06T10-LTLFireability-01 2447723 m, 18705 m/sec, 3610877 t fired, .
Time elapsed: 387 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 1 0 17 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
36 LTL EXCL 132/1670 30/32 PolyORBLF-COL-S04J06T10-LTLFireability-01 2542976 m, 19050 m/sec, 3755732 t fired, .
Time elapsed: 392 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 1 0 17 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
36 LTL EXCL 137/1670 31/32 PolyORBLF-COL-S04J06T10-LTLFireability-01 2637860 m, 18976 m/sec, 3900254 t fired, .
Time elapsed: 397 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 1 0 17 0 0 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
36 LTL EXCL 142/1670 32/32 PolyORBLF-COL-S04J06T10-LTLFireability-01 2733139 m, 19055 m/sec, 4045936 t fired, .
Time elapsed: 402 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: CANCELED task # 36 (type EXCL) for PolyORBLF-COL-S04J06T10-LTLFireability-01 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 0 0 17 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 407 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: LAUNCH task # 48 (type EXCL) for 47 PolyORBLF-COL-S04J06T10-LTLFireability-13
lola: time limit : 3193 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 0 0 17 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
48 LTL EXCL 5/3193 2/32 PolyORBLF-COL-S04J06T10-LTLFireability-13 91611 m, 18322 m/sec, 159159 t fired, .
Time elapsed: 412 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 0 0 17 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
48 LTL EXCL 10/3193 2/32 PolyORBLF-COL-S04J06T10-LTLFireability-13 177358 m, 17149 m/sec, 319227 t fired, .
Time elapsed: 417 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 0 0 17 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
48 LTL EXCL 15/3193 3/32 PolyORBLF-COL-S04J06T10-LTLFireability-13 260277 m, 16583 m/sec, 479001 t fired, .
Time elapsed: 422 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 0 0 17 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
48 LTL EXCL 20/3193 4/32 PolyORBLF-COL-S04J06T10-LTLFireability-13 341648 m, 16274 m/sec, 641082 t fired, .
Time elapsed: 427 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 0 0 17 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
48 LTL EXCL 25/3193 5/32 PolyORBLF-COL-S04J06T10-LTLFireability-13 430352 m, 17740 m/sec, 804773 t fired, .
Time elapsed: 432 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 0 0 17 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
48 LTL EXCL 30/3193 6/32 PolyORBLF-COL-S04J06T10-LTLFireability-13 519617 m, 17853 m/sec, 964571 t fired, .
Time elapsed: 437 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 0 0 17 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
48 LTL EXCL 35/3193 7/32 PolyORBLF-COL-S04J06T10-LTLFireability-13 606391 m, 17354 m/sec, 1122321 t fired, .
Time elapsed: 442 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 0 0 17 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
48 LTL EXCL 40/3193 8/32 PolyORBLF-COL-S04J06T10-LTLFireability-13 690173 m, 16756 m/sec, 1280880 t fired, .
Time elapsed: 447 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 0 0 17 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
48 LTL EXCL 45/3193 9/32 PolyORBLF-COL-S04J06T10-LTLFireability-13 775038 m, 16973 m/sec, 1436111 t fired, .
Time elapsed: 452 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 0 0 17 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
48 LTL EXCL 50/3193 10/32 PolyORBLF-COL-S04J06T10-LTLFireability-13 859142 m, 16820 m/sec, 1592190 t fired, .
Time elapsed: 457 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 0 0 17 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
48 LTL EXCL 55/3193 11/32 PolyORBLF-COL-S04J06T10-LTLFireability-13 939649 m, 16101 m/sec, 1747721 t fired, .
Time elapsed: 462 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 0 0 17 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
48 LTL EXCL 60/3193 11/32 PolyORBLF-COL-S04J06T10-LTLFireability-13 1022992 m, 16668 m/sec, 1906378 t fired, .
Time elapsed: 467 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 0 0 17 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
48 LTL EXCL 65/3193 12/32 PolyORBLF-COL-S04J06T10-LTLFireability-13 1104816 m, 16364 m/sec, 2063904 t fired, .
Time elapsed: 472 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 0 0 17 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
48 LTL EXCL 70/3193 13/32 PolyORBLF-COL-S04J06T10-LTLFireability-13 1183045 m, 15645 m/sec, 2218710 t fired, .
Time elapsed: 477 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 0 0 17 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
48 LTL EXCL 75/3193 14/32 PolyORBLF-COL-S04J06T10-LTLFireability-13 1264636 m, 16318 m/sec, 2376081 t fired, .
Time elapsed: 482 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 0 0 17 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
48 LTL EXCL 80/3193 15/32 PolyORBLF-COL-S04J06T10-LTLFireability-13 1343416 m, 15756 m/sec, 2534361 t fired, .
Time elapsed: 487 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 0 0 17 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
48 LTL EXCL 85/3193 16/32 PolyORBLF-COL-S04J06T10-LTLFireability-13 1421589 m, 15634 m/sec, 2691613 t fired, .
Time elapsed: 492 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 0 0 17 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
48 LTL EXCL 90/3193 16/32 PolyORBLF-COL-S04J06T10-LTLFireability-13 1500686 m, 15819 m/sec, 2851535 t fired, .
Time elapsed: 497 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 0 0 17 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
48 LTL EXCL 95/3193 17/32 PolyORBLF-COL-S04J06T10-LTLFireability-13 1580451 m, 15953 m/sec, 3002631 t fired, .
Time elapsed: 502 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 0 0 17 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
48 LTL EXCL 100/3193 18/32 PolyORBLF-COL-S04J06T10-LTLFireability-13 1661406 m, 16191 m/sec, 3158573 t fired, .
Time elapsed: 507 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 0 0 17 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
48 LTL EXCL 105/3193 19/32 PolyORBLF-COL-S04J06T10-LTLFireability-13 1738198 m, 15358 m/sec, 3311652 t fired, .
Time elapsed: 512 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 0 0 17 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
48 LTL EXCL 110/3193 20/32 PolyORBLF-COL-S04J06T10-LTLFireability-13 1817455 m, 15851 m/sec, 3466189 t fired, .
Time elapsed: 517 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 0 0 17 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
48 LTL EXCL 115/3193 20/32 PolyORBLF-COL-S04J06T10-LTLFireability-13 1895439 m, 15596 m/sec, 3621634 t fired, .
Time elapsed: 522 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 0 0 17 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
48 LTL EXCL 120/3193 21/32 PolyORBLF-COL-S04J06T10-LTLFireability-13 1972193 m, 15350 m/sec, 3776185 t fired, .
Time elapsed: 527 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 0 0 17 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
48 LTL EXCL 125/3193 22/32 PolyORBLF-COL-S04J06T10-LTLFireability-13 2049144 m, 15390 m/sec, 3933528 t fired, .
Time elapsed: 532 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 0 0 17 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
48 LTL EXCL 130/3193 23/32 PolyORBLF-COL-S04J06T10-LTLFireability-13 2124637 m, 15098 m/sec, 4088905 t fired, .
Time elapsed: 537 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 0 0 17 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
48 LTL EXCL 135/3193 24/32 PolyORBLF-COL-S04J06T10-LTLFireability-13 2199491 m, 14970 m/sec, 4246655 t fired, .
Time elapsed: 542 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 0 0 17 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
48 LTL EXCL 140/3193 24/32 PolyORBLF-COL-S04J06T10-LTLFireability-13 2279268 m, 15955 m/sec, 4402550 t fired, .
Time elapsed: 547 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 0 0 17 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
48 LTL EXCL 145/3193 25/32 PolyORBLF-COL-S04J06T10-LTLFireability-13 2355900 m, 15326 m/sec, 4558140 t fired, .
Time elapsed: 552 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 0 0 17 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
48 LTL EXCL 150/3193 26/32 PolyORBLF-COL-S04J06T10-LTLFireability-13 2433052 m, 15430 m/sec, 4714576 t fired, .
Time elapsed: 557 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 0 0 17 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
48 LTL EXCL 155/3193 27/32 PolyORBLF-COL-S04J06T10-LTLFireability-13 2509462 m, 15282 m/sec, 4871708 t fired, .
Time elapsed: 562 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 0 0 17 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
48 LTL EXCL 160/3193 28/32 PolyORBLF-COL-S04J06T10-LTLFireability-13 2584530 m, 15013 m/sec, 5028653 t fired, .
Time elapsed: 567 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 0 0 17 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
48 LTL EXCL 165/3193 28/32 PolyORBLF-COL-S04J06T10-LTLFireability-13 2658794 m, 14852 m/sec, 5187311 t fired, .
Time elapsed: 572 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 0 0 17 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
48 LTL EXCL 170/3193 29/32 PolyORBLF-COL-S04J06T10-LTLFireability-13 2735611 m, 15363 m/sec, 5344498 t fired, .
Time elapsed: 577 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 0 0 17 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
48 LTL EXCL 175/3193 30/32 PolyORBLF-COL-S04J06T10-LTLFireability-13 2810614 m, 15000 m/sec, 5501255 t fired, .
Time elapsed: 582 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 0 0 17 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
48 LTL EXCL 180/3193 31/32 PolyORBLF-COL-S04J06T10-LTLFireability-13 2884203 m, 14717 m/sec, 5659704 t fired, .
Time elapsed: 587 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 0 0 17 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
48 LTL EXCL 185/3193 32/32 PolyORBLF-COL-S04J06T10-LTLFireability-13 2958414 m, 14842 m/sec, 5819627 t fired, .
Time elapsed: 592 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 0 0 17 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
48 LTL EXCL 190/3193 32/32 PolyORBLF-COL-S04J06T10-LTLFireability-13 3032432 m, 14803 m/sec, 5978512 t fired, .
Time elapsed: 597 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: CANCELED task # 48 (type EXCL) for PolyORBLF-COL-S04J06T10-LTLFireability-13 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ 0 0 0 0 17 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 602 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: Portfolio finished: no open tasks 6
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-COL-S04J06T10-LTLFireability-00: LTL false LTL model checker
PolyORBLF-COL-S04J06T10-LTLFireability-01: CONJ unknown CONJ
PolyORBLF-COL-S04J06T10-LTLFireability-02: LTL unknown AGGR
PolyORBLF-COL-S04J06T10-LTLFireability-08: LTL unknown AGGR
PolyORBLF-COL-S04J06T10-LTLFireability-09: LTL unknown AGGR
PolyORBLF-COL-S04J06T10-LTLFireability-13: LTL unknown AGGR
Time elapsed: 602 secs. Pages in use: 32
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="PolyORBLF-COL-S04J06T10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is PolyORBLF-COL-S04J06T10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r295-tall-167873947900436"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S04J06T10.tgz
mv PolyORBLF-COL-S04J06T10 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;