About the Execution of ITS-Tools for FlexibleBarrier-PT-14b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15193.336 | 3600000.00 | 13901630.00 | 968.80 | FTFFTFFTF?TTFTTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r096-smll-165260575700091.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is FlexibleBarrier-PT-14b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-smll-165260575700091
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 944K
-rw-r--r-- 1 mcc users 6.9K Apr 29 13:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 29 13:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 29 13:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 29 13:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 726K May 10 09:33 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 FlexibleBarrier-PT-14b-LTLCardinality-00
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-01
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-02
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-03
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-04
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-05
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-06
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-07
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-08
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-09
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-10
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-11
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-12
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-13
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-14
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1652633928591
Running Version 202205111006
[2022-05-15 16:58:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 16:58:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 16:58:51] [INFO ] Load time of PNML (sax parser for PT used): 498 ms
[2022-05-15 16:58:51] [INFO ] Transformed 2678 places.
[2022-05-15 16:58:51] [INFO ] Transformed 3085 transitions.
[2022-05-15 16:58:51] [INFO ] Found NUPN structural information;
[2022-05-15 16:58:51] [INFO ] Parsed PT model containing 2678 places and 3085 transitions in 763 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 125 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 2678 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2678/2678 places, 3085/3085 transitions.
Discarding 1074 places :
Symmetric choice reduction at 0 with 1074 rule applications. Total rules 1074 place count 1604 transition count 2011
Iterating global reduction 0 with 1074 rules applied. Total rules applied 2148 place count 1604 transition count 2011
Discarding 503 places :
Symmetric choice reduction at 0 with 503 rule applications. Total rules 2651 place count 1101 transition count 1508
Iterating global reduction 0 with 503 rules applied. Total rules applied 3154 place count 1101 transition count 1508
Discarding 317 places :
Symmetric choice reduction at 0 with 317 rule applications. Total rules 3471 place count 784 transition count 1191
Iterating global reduction 0 with 317 rules applied. Total rules applied 3788 place count 784 transition count 1191
Ensure Unique test removed 148 transitions
Reduce isomorphic transitions removed 148 transitions.
Iterating post reduction 0 with 148 rules applied. Total rules applied 3936 place count 784 transition count 1043
Applied a total of 3936 rules in 808 ms. Remains 784 /2678 variables (removed 1894) and now considering 1043/3085 (removed 2042) transitions.
// Phase 1: matrix 1043 rows 784 cols
[2022-05-15 16:58:53] [INFO ] Computed 16 place invariants in 50 ms
[2022-05-15 16:58:54] [INFO ] Implicit Places using invariants in 1441 ms returned []
// Phase 1: matrix 1043 rows 784 cols
[2022-05-15 16:58:54] [INFO ] Computed 16 place invariants in 33 ms
[2022-05-15 16:58:56] [INFO ] Implicit Places using invariants and state equation in 1963 ms returned []
Implicit Place search using SMT with State Equation took 3468 ms to find 0 implicit places.
// Phase 1: matrix 1043 rows 784 cols
[2022-05-15 16:58:56] [INFO ] Computed 16 place invariants in 15 ms
[2022-05-15 16:58:57] [INFO ] Dead Transitions using invariants and state equation in 1332 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 784/2678 places, 1043/3085 transitions.
Finished structural reductions, in 1 iterations. Remains : 784/2678 places, 1043/3085 transitions.
Support contains 27 out of 784 places after structural reductions.
[2022-05-15 16:58:58] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2022-05-15 16:58:58] [INFO ] Flatten gal took : 218 ms
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-15 16:58:58] [INFO ] Flatten gal took : 123 ms
[2022-05-15 16:58:58] [INFO ] Input system was already deterministic with 1043 transitions.
Incomplete random walk after 10000 steps, including 100 resets, run finished after 808 ms. (steps per millisecond=12 ) properties (out of 17) seen :5
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 12) seen :2
Running SMT prover for 10 properties.
// Phase 1: matrix 1043 rows 784 cols
[2022-05-15 16:59:00] [INFO ] Computed 16 place invariants in 14 ms
[2022-05-15 16:59:00] [INFO ] After 512ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-05-15 16:59:01] [INFO ] [Nat]Absence check using 16 positive place invariants in 18 ms returned sat
[2022-05-15 16:59:02] [INFO ] After 1077ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :9
[2022-05-15 16:59:02] [INFO ] Deduced a trap composed of 129 places in 181 ms of which 8 ms to minimize.
[2022-05-15 16:59:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 319 ms
[2022-05-15 16:59:03] [INFO ] After 2113ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :9
Attempting to minimize the solution found.
Minimization took 495 ms.
[2022-05-15 16:59:04] [INFO ] After 3268ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :9
Fused 10 Parikh solutions to 8 different solutions.
Parikh walk visited 5 properties in 108 ms.
Support contains 8 out of 784 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 784/784 places, 1043/1043 transitions.
Graph (trivial) has 727 edges and 784 vertex of which 85 / 784 are part of one of the 14 SCC in 7 ms
Free SCC test removed 71 places
Drop transitions removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 69 place count 713 transition count 889
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 137 place count 645 transition count 889
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 137 place count 645 transition count 857
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 201 place count 613 transition count 857
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 242 place count 572 transition count 816
Iterating global reduction 2 with 41 rules applied. Total rules applied 283 place count 572 transition count 816
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 287 place count 572 transition count 812
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 298 place count 561 transition count 801
Iterating global reduction 3 with 11 rules applied. Total rules applied 309 place count 561 transition count 801
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 317 place count 561 transition count 793
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 493 place count 473 transition count 705
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 521 place count 473 transition count 677
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 536 place count 458 transition count 662
Iterating global reduction 5 with 15 rules applied. Total rules applied 551 place count 458 transition count 662
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 552 place count 458 transition count 661
Free-agglomeration rule applied 372 times.
Iterating global reduction 6 with 372 rules applied. Total rules applied 924 place count 458 transition count 289
Reduce places removed 372 places and 0 transitions.
Drop transitions removed 169 transitions
Reduce isomorphic transitions removed 169 transitions.
Graph (complete) has 234 edges and 86 vertex of which 61 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.4 ms
Discarding 25 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 542 rules applied. Total rules applied 1466 place count 61 transition count 120
Drop transitions removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 7 with 35 rules applied. Total rules applied 1501 place count 61 transition count 85
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1502 place count 60 transition count 84
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 63 edges and 58 vertex of which 45 / 58 are part of one of the 9 SCC in 0 ms
Free SCC test removed 36 places
Iterating post reduction 8 with 3 rules applied. Total rules applied 1505 place count 22 transition count 84
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 9 with 68 rules applied. Total rules applied 1573 place count 17 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 1573 place count 17 transition count 20
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1575 place count 16 transition count 20
Free-agglomeration rule applied 3 times.
Iterating global reduction 10 with 3 rules applied. Total rules applied 1578 place count 16 transition count 17
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 1581 place count 13 transition count 17
Applied a total of 1581 rules in 430 ms. Remains 13 /784 variables (removed 771) and now considering 17/1043 (removed 1026) transitions.
Finished structural reductions, in 1 iterations. Remains : 13/784 places, 17/1043 transitions.
Finished random walk after 299 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=74 )
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 16 stabilizing places and 16 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0 U ((G(p0) U p2)||p1)))))'
Support contains 3 out of 784 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 784/784 places, 1043/1043 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 764 transition count 1023
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 764 transition count 1023
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 764 transition count 1020
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 57 place count 750 transition count 1006
Iterating global reduction 1 with 14 rules applied. Total rules applied 71 place count 750 transition count 1006
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 79 place count 750 transition count 998
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 85 place count 744 transition count 992
Iterating global reduction 2 with 6 rules applied. Total rules applied 91 place count 744 transition count 992
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 97 place count 744 transition count 986
Applied a total of 97 rules in 214 ms. Remains 744 /784 variables (removed 40) and now considering 986/1043 (removed 57) transitions.
// Phase 1: matrix 986 rows 744 cols
[2022-05-15 16:59:05] [INFO ] Computed 16 place invariants in 9 ms
[2022-05-15 16:59:05] [INFO ] Implicit Places using invariants in 471 ms returned []
// Phase 1: matrix 986 rows 744 cols
[2022-05-15 16:59:05] [INFO ] Computed 16 place invariants in 10 ms
[2022-05-15 16:59:07] [INFO ] Implicit Places using invariants and state equation in 1280 ms returned []
Implicit Place search using SMT with State Equation took 1775 ms to find 0 implicit places.
// Phase 1: matrix 986 rows 744 cols
[2022-05-15 16:59:07] [INFO ] Computed 16 place invariants in 10 ms
[2022-05-15 16:59:07] [INFO ] Dead Transitions using invariants and state equation in 903 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 744/784 places, 986/1043 transitions.
Finished structural reductions, in 1 iterations. Remains : 744/784 places, 986/1043 transitions.
Stuttering acceptance computed with spot in 297 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s18 0) (EQ s28 1)), p2:(EQ s66 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 50000 reset in 1052 ms.
Product exploration explored 100000 steps with 50000 reset in 988 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p1 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p2))))
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 2 states, 2 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-14b-LTLCardinality-01 finished in 5400 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(p0)) U G((G(F(p0))&&F(!p0))))))'
Support contains 2 out of 784 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 784/784 places, 1043/1043 transitions.
Graph (trivial) has 738 edges and 784 vertex of which 85 / 784 are part of one of the 14 SCC in 2 ms
Free SCC test removed 71 places
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 74 place count 712 transition count 897
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 1 with 73 rules applied. Total rules applied 147 place count 639 transition count 897
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 147 place count 639 transition count 862
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 217 place count 604 transition count 862
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 263 place count 558 transition count 816
Iterating global reduction 2 with 46 rules applied. Total rules applied 309 place count 558 transition count 816
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 314 place count 558 transition count 811
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 325 place count 547 transition count 800
Iterating global reduction 3 with 11 rules applied. Total rules applied 336 place count 547 transition count 800
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 347 place count 547 transition count 789
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 4 with 172 rules applied. Total rules applied 519 place count 461 transition count 703
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 522 place count 458 transition count 700
Iterating global reduction 4 with 3 rules applied. Total rules applied 525 place count 458 transition count 700
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 528 place count 458 transition count 697
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 542 place count 458 transition count 683
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 544 place count 456 transition count 681
Applied a total of 544 rules in 632 ms. Remains 456 /784 variables (removed 328) and now considering 681/1043 (removed 362) transitions.
[2022-05-15 16:59:11] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
// Phase 1: matrix 654 rows 456 cols
[2022-05-15 16:59:11] [INFO ] Computed 16 place invariants in 9 ms
[2022-05-15 16:59:11] [INFO ] Implicit Places using invariants in 354 ms returned []
[2022-05-15 16:59:11] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
// Phase 1: matrix 654 rows 456 cols
[2022-05-15 16:59:11] [INFO ] Computed 16 place invariants in 9 ms
[2022-05-15 16:59:12] [INFO ] Implicit Places using invariants and state equation in 731 ms returned []
Implicit Place search using SMT with State Equation took 1106 ms to find 0 implicit places.
[2022-05-15 16:59:12] [INFO ] Redundant transitions in 63 ms returned []
[2022-05-15 16:59:12] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
// Phase 1: matrix 654 rows 456 cols
[2022-05-15 16:59:12] [INFO ] Computed 16 place invariants in 14 ms
[2022-05-15 16:59:12] [INFO ] Dead Transitions using invariants and state equation in 566 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 456/784 places, 681/1043 transitions.
Finished structural reductions, in 1 iterations. Remains : 456/784 places, 681/1043 transitions.
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p0), p0]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s386 0) (EQ s374 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14b-LTLCardinality-02 finished in 2546 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((F(!(G(p1) U p2))||p3))))'
Support contains 8 out of 784 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 784/784 places, 1043/1043 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 767 transition count 1026
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 767 transition count 1026
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 39 place count 767 transition count 1021
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 49 place count 757 transition count 1011
Iterating global reduction 1 with 10 rules applied. Total rules applied 59 place count 757 transition count 1011
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 66 place count 757 transition count 1004
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 69 place count 754 transition count 1001
Iterating global reduction 2 with 3 rules applied. Total rules applied 72 place count 754 transition count 1001
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 75 place count 754 transition count 998
Applied a total of 75 rules in 814 ms. Remains 754 /784 variables (removed 30) and now considering 998/1043 (removed 45) transitions.
// Phase 1: matrix 998 rows 754 cols
[2022-05-15 16:59:13] [INFO ] Computed 16 place invariants in 9 ms
[2022-05-15 16:59:14] [INFO ] Implicit Places using invariants in 528 ms returned []
// Phase 1: matrix 998 rows 754 cols
[2022-05-15 16:59:14] [INFO ] Computed 16 place invariants in 9 ms
[2022-05-15 16:59:15] [INFO ] Implicit Places using invariants and state equation in 1052 ms returned []
Implicit Place search using SMT with State Equation took 1587 ms to find 0 implicit places.
// Phase 1: matrix 998 rows 754 cols
[2022-05-15 16:59:15] [INFO ] Computed 16 place invariants in 9 ms
[2022-05-15 16:59:16] [INFO ] Dead Transitions using invariants and state equation in 982 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 754/784 places, 998/1043 transitions.
Finished structural reductions, in 1 iterations. Remains : 754/784 places, 998/1043 transitions.
Stuttering acceptance computed with spot in 267 ms :[(OR (NOT p0) (AND p2 (NOT p3))), (NOT p0), (AND p2 (NOT p3)), p2, (AND p2 p1)]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p3) p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=p2, acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p1 p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s264 0) (EQ s461 1)), p3:(AND (EQ s218 0) (EQ s18 1)), p2:(OR (EQ s652 0) (EQ s15 1)), p1:(OR (EQ s451 0) (EQ s301 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 100 steps with 0 reset in 2 ms.
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14b-LTLCardinality-03 finished in 3720 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X((X(F(!(F(G(p0)) U X(p1))))&&F(p0))))))'
Support contains 3 out of 784 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 784/784 places, 1043/1043 transitions.
Graph (trivial) has 736 edges and 784 vertex of which 85 / 784 are part of one of the 14 SCC in 1 ms
Free SCC test removed 71 places
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 73 place count 712 transition count 898
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 145 place count 640 transition count 898
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 145 place count 640 transition count 864
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 213 place count 606 transition count 864
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 259 place count 560 transition count 818
Iterating global reduction 2 with 46 rules applied. Total rules applied 305 place count 560 transition count 818
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 310 place count 560 transition count 813
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 322 place count 548 transition count 801
Iterating global reduction 3 with 12 rules applied. Total rules applied 334 place count 548 transition count 801
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 345 place count 548 transition count 790
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 4 with 172 rules applied. Total rules applied 517 place count 462 transition count 704
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 519 place count 460 transition count 702
Iterating global reduction 4 with 2 rules applied. Total rules applied 521 place count 460 transition count 702
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 523 place count 460 transition count 700
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 537 place count 460 transition count 686
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 539 place count 458 transition count 684
Applied a total of 539 rules in 363 ms. Remains 458 /784 variables (removed 326) and now considering 684/1043 (removed 359) transitions.
[2022-05-15 16:59:17] [INFO ] Flow matrix only has 657 transitions (discarded 27 similar events)
// Phase 1: matrix 657 rows 458 cols
[2022-05-15 16:59:17] [INFO ] Computed 16 place invariants in 15 ms
[2022-05-15 16:59:17] [INFO ] Implicit Places using invariants in 636 ms returned []
[2022-05-15 16:59:17] [INFO ] Flow matrix only has 657 transitions (discarded 27 similar events)
// Phase 1: matrix 657 rows 458 cols
[2022-05-15 16:59:17] [INFO ] Computed 16 place invariants in 8 ms
[2022-05-15 16:59:18] [INFO ] Implicit Places using invariants and state equation in 892 ms returned []
Implicit Place search using SMT with State Equation took 1536 ms to find 0 implicit places.
[2022-05-15 16:59:18] [INFO ] Redundant transitions in 18 ms returned []
[2022-05-15 16:59:18] [INFO ] Flow matrix only has 657 transitions (discarded 27 similar events)
// Phase 1: matrix 657 rows 458 cols
[2022-05-15 16:59:18] [INFO ] Computed 16 place invariants in 14 ms
[2022-05-15 16:59:19] [INFO ] Dead Transitions using invariants and state equation in 669 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 458/784 places, 684/1043 transitions.
Finished structural reductions, in 1 iterations. Remains : 458/784 places, 684/1043 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) p1), (NOT p0), p1, (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s222 0) (EQ s12 1)), p1:(EQ s441 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 4873 reset in 1137 ms.
Stuttering criterion allowed to conclude after 62450 steps with 3047 reset in 635 ms.
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14b-LTLCardinality-05 finished in 4606 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0)||p1||G(p2)))))'
Support contains 4 out of 784 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 784/784 places, 1043/1043 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 764 transition count 1023
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 764 transition count 1023
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 44 place count 764 transition count 1019
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 58 place count 750 transition count 1005
Iterating global reduction 1 with 14 rules applied. Total rules applied 72 place count 750 transition count 1005
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 79 place count 750 transition count 998
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 86 place count 743 transition count 991
Iterating global reduction 2 with 7 rules applied. Total rules applied 93 place count 743 transition count 991
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 100 place count 743 transition count 984
Applied a total of 100 rules in 78 ms. Remains 743 /784 variables (removed 41) and now considering 984/1043 (removed 59) transitions.
// Phase 1: matrix 984 rows 743 cols
[2022-05-15 16:59:21] [INFO ] Computed 16 place invariants in 9 ms
[2022-05-15 16:59:21] [INFO ] Implicit Places using invariants in 573 ms returned []
// Phase 1: matrix 984 rows 743 cols
[2022-05-15 16:59:21] [INFO ] Computed 16 place invariants in 19 ms
[2022-05-15 16:59:23] [INFO ] Implicit Places using invariants and state equation in 1439 ms returned []
Implicit Place search using SMT with State Equation took 2014 ms to find 0 implicit places.
// Phase 1: matrix 984 rows 743 cols
[2022-05-15 16:59:23] [INFO ] Computed 16 place invariants in 12 ms
[2022-05-15 16:59:24] [INFO ] Dead Transitions using invariants and state equation in 735 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 743/784 places, 984/1043 transitions.
Finished structural reductions, in 1 iterations. Remains : 743/784 places, 984/1043 transitions.
Stuttering acceptance computed with spot in 213 ms :[true, (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(OR (EQ s172 0) (EQ s635 1)), p2:(EQ s295 0), p1:(EQ s63 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 995 reset in 302 ms.
Product exploration explored 100000 steps with 999 reset in 364 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (AND (NOT p1) p0 p2)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p2)), true, (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 18 factoid took 878 ms. Reduced automaton from 6 states, 15 edges and 3 AP to 5 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 168 ms :[true, (AND (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (AND (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 101 resets, run finished after 370 ms. (steps per millisecond=27 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 984 rows 743 cols
[2022-05-15 16:59:26] [INFO ] Computed 16 place invariants in 14 ms
[2022-05-15 16:59:26] [INFO ] After 178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 16:59:26] [INFO ] [Nat]Absence check using 16 positive place invariants in 14 ms returned sat
[2022-05-15 16:59:27] [INFO ] After 501ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 16:59:27] [INFO ] Deduced a trap composed of 35 places in 181 ms of which 3 ms to minimize.
[2022-05-15 16:59:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 253 ms
[2022-05-15 16:59:27] [INFO ] After 908ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 113 ms.
[2022-05-15 16:59:28] [INFO ] After 1233ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 67 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=67 )
Parikh walk visited 3 properties in 6 ms.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (AND (NOT p1) p0 p2)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p2)), true, (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p2) p0)), (F (AND p2 (NOT p0))), (F (NOT (AND p2 p0))), (F (NOT p2)), (F (AND (NOT p2) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 18 factoid took 1168 ms. Reduced automaton from 5 states, 10 edges and 2 AP to 5 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 146 ms :[true, (AND (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 184 ms :[true, (AND (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (AND (NOT p2) (NOT p0))]
Support contains 3 out of 743 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 743/743 places, 984/984 transitions.
Applied a total of 0 rules in 24 ms. Remains 743 /743 variables (removed 0) and now considering 984/984 (removed 0) transitions.
// Phase 1: matrix 984 rows 743 cols
[2022-05-15 16:59:29] [INFO ] Computed 16 place invariants in 8 ms
[2022-05-15 16:59:30] [INFO ] Implicit Places using invariants in 730 ms returned []
// Phase 1: matrix 984 rows 743 cols
[2022-05-15 16:59:30] [INFO ] Computed 16 place invariants in 8 ms
[2022-05-15 16:59:31] [INFO ] Implicit Places using invariants and state equation in 1206 ms returned []
Implicit Place search using SMT with State Equation took 1939 ms to find 0 implicit places.
// Phase 1: matrix 984 rows 743 cols
[2022-05-15 16:59:31] [INFO ] Computed 16 place invariants in 17 ms
[2022-05-15 16:59:32] [INFO ] Dead Transitions using invariants and state equation in 901 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 743/743 places, 984/984 transitions.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p2 p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 (NOT p0)))), (X (AND p2 p0)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (NOT (AND (NOT p2) p0)))), (X (X p0)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p2 p0)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 651 ms. Reduced automaton from 5 states, 10 edges and 2 AP to 5 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 222 ms :[true, (AND (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (AND (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 98 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 984 rows 743 cols
[2022-05-15 16:59:33] [INFO ] Computed 16 place invariants in 8 ms
[2022-05-15 16:59:33] [INFO ] After 216ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 16:59:34] [INFO ] [Nat]Absence check using 16 positive place invariants in 11 ms returned sat
[2022-05-15 16:59:34] [INFO ] After 526ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 16:59:34] [INFO ] Deduced a trap composed of 35 places in 191 ms of which 2 ms to minimize.
[2022-05-15 16:59:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 284 ms
[2022-05-15 16:59:35] [INFO ] After 1045ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 168 ms.
[2022-05-15 16:59:35] [INFO ] After 1413ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 68 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=22 )
Parikh walk visited 3 properties in 4 ms.
Knowledge obtained : [(AND p2 p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 (NOT p0)))), (X (AND p2 p0)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (NOT (AND (NOT p2) p0)))), (X (X p0)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p2 p0)))]
False Knowledge obtained : [(F (AND p0 (NOT p2))), (F (AND (NOT p0) p2)), (F (NOT (AND p0 p2))), (F (NOT p2)), (F (AND (NOT p0) (NOT p2))), (F (NOT p0))]
Knowledge based reduction with 12 factoid took 810 ms. Reduced automaton from 5 states, 10 edges and 2 AP to 5 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 206 ms :[true, (AND (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 203 ms :[true, (AND (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 220 ms :[true, (AND (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 995 reset in 504 ms.
Product exploration explored 100000 steps with 995 reset in 491 ms.
Applying partial POR strategy [true, false, true, true, true]
Stuttering acceptance computed with spot in 229 ms :[true, (AND (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (AND (NOT p2) (NOT p0))]
Support contains 3 out of 743 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 743/743 places, 984/984 transitions.
Graph (trivial) has 695 edges and 743 vertex of which 79 / 743 are part of one of the 13 SCC in 2 ms
Free SCC test removed 66 places
Ensure Unique test removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 677 transition count 917
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 41 Pre rules applied. Total rules applied 57 place count 677 transition count 918
Deduced a syphon composed of 97 places in 1 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 98 place count 677 transition count 918
Discarding 65 places :
Symmetric choice reduction at 1 with 65 rule applications. Total rules 163 place count 612 transition count 853
Deduced a syphon composed of 58 places in 1 ms
Iterating global reduction 1 with 65 rules applied. Total rules applied 228 place count 612 transition count 853
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 229 place count 612 transition count 852
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 230 place count 611 transition count 851
Deduced a syphon composed of 58 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 231 place count 611 transition count 851
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 137 places in 0 ms
Iterating global reduction 2 with 79 rules applied. Total rules applied 310 place count 611 transition count 879
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 344 place count 577 transition count 845
Deduced a syphon composed of 103 places in 0 ms
Iterating global reduction 2 with 34 rules applied. Total rules applied 378 place count 577 transition count 845
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 118 places in 1 ms
Iterating global reduction 2 with 15 rules applied. Total rules applied 393 place count 577 transition count 876
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 394 place count 576 transition count 874
Deduced a syphon composed of 117 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 395 place count 576 transition count 874
Deduced a syphon composed of 117 places in 1 ms
Drop transitions removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 2 with 29 rules applied. Total rules applied 424 place count 576 transition count 845
Deduced a syphon composed of 117 places in 1 ms
Applied a total of 424 rules in 547 ms. Remains 576 /743 variables (removed 167) and now considering 845/984 (removed 139) transitions.
[2022-05-15 16:59:38] [INFO ] Redundant transitions in 12 ms returned []
[2022-05-15 16:59:38] [INFO ] Flow matrix only has 819 transitions (discarded 26 similar events)
// Phase 1: matrix 819 rows 576 cols
[2022-05-15 16:59:38] [INFO ] Computed 16 place invariants in 20 ms
[2022-05-15 16:59:39] [INFO ] Dead Transitions using invariants and state equation in 639 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 576/743 places, 845/984 transitions.
Finished structural reductions, in 1 iterations. Remains : 576/743 places, 845/984 transitions.
Product exploration explored 100000 steps with 4087 reset in 1180 ms.
Product exploration explored 100000 steps with 4070 reset in 1312 ms.
Built C files in :
/tmp/ltsmin3714447577159262078
[2022-05-15 16:59:42] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3714447577159262078
Running compilation step : cd /tmp/ltsmin3714447577159262078;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3714447577159262078;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3714447577159262078;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 3 out of 743 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 743/743 places, 984/984 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 742 transition count 983
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 742 transition count 983
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 742 transition count 982
Applied a total of 3 rules in 92 ms. Remains 742 /743 variables (removed 1) and now considering 982/984 (removed 2) transitions.
// Phase 1: matrix 982 rows 742 cols
[2022-05-15 16:59:45] [INFO ] Computed 16 place invariants in 13 ms
[2022-05-15 16:59:45] [INFO ] Implicit Places using invariants in 621 ms returned []
// Phase 1: matrix 982 rows 742 cols
[2022-05-15 16:59:45] [INFO ] Computed 16 place invariants in 8 ms
[2022-05-15 16:59:46] [INFO ] Implicit Places using invariants and state equation in 956 ms returned []
Implicit Place search using SMT with State Equation took 1584 ms to find 0 implicit places.
// Phase 1: matrix 982 rows 742 cols
[2022-05-15 16:59:46] [INFO ] Computed 16 place invariants in 11 ms
[2022-05-15 16:59:48] [INFO ] Dead Transitions using invariants and state equation in 1200 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 742/743 places, 982/984 transitions.
Finished structural reductions, in 1 iterations. Remains : 742/743 places, 982/984 transitions.
Built C files in :
/tmp/ltsmin6156217639080403646
[2022-05-15 16:59:48] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6156217639080403646
Running compilation step : cd /tmp/ltsmin6156217639080403646;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2595 ms.
Running link step : cd /tmp/ltsmin6156217639080403646;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin6156217639080403646;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17959796222620237344.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 17:00:03] [INFO ] Flatten gal took : 54 ms
[2022-05-15 17:00:03] [INFO ] Flatten gal took : 53 ms
[2022-05-15 17:00:03] [INFO ] Time to serialize gal into /tmp/LTL12084608780361856301.gal : 13 ms
[2022-05-15 17:00:03] [INFO ] Time to serialize properties into /tmp/LTL13435089786094376269.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12084608780361856301.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13435089786094376269.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1208460...268
Read 1 LTL properties
Checking formula 0 : !((X(G(((G("((p543==0)||(p2158==1))"))||("(p217==1)"))||(G("(p961==0)"))))))
Formula 0 simplified : !XG("(p217==1)" | G"((p543==0)||(p2158==1))" | G"(p961==0)")
Detected timeout of ITS tools.
[2022-05-15 17:00:18] [INFO ] Flatten gal took : 48 ms
[2022-05-15 17:00:18] [INFO ] Applying decomposition
[2022-05-15 17:00:18] [INFO ] Flatten gal took : 46 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph844454754107764977.txt' '-o' '/tmp/graph844454754107764977.bin' '-w' '/tmp/graph844454754107764977.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph844454754107764977.bin' '-l' '-1' '-v' '-w' '/tmp/graph844454754107764977.weights' '-q' '0' '-e' '0.001'
[2022-05-15 17:00:18] [INFO ] Decomposing Gal with order
[2022-05-15 17:00:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 17:00:19] [INFO ] Removed a total of 269 redundant transitions.
[2022-05-15 17:00:19] [INFO ] Flatten gal took : 515 ms
[2022-05-15 17:00:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 56 ms.
[2022-05-15 17:00:19] [INFO ] Time to serialize gal into /tmp/LTL879258514706670504.gal : 47 ms
[2022-05-15 17:00:19] [INFO ] Time to serialize properties into /tmp/LTL11602398606752851229.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL879258514706670504.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11602398606752851229.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8792585...245
Read 1 LTL properties
Checking formula 0 : !((X(G(((G("((i4.u50.p543==0)||(u151.p2158==1))"))||("(i1.i0.i1.u19.p217==1)"))||(G("(i7.u81.p961==0)"))))))
Formula 0 simplified : !XG("(i1.i0.i1.u19.p217==1)" | G"((i4.u50.p543==0)||(u151.p2158==1))" | G"(i7.u81.p961==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin262466256684129277
[2022-05-15 17:00:34] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin262466256684129277
Running compilation step : cd /tmp/ltsmin262466256684129277;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2466 ms.
Running link step : cd /tmp/ltsmin262466256684129277;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin262466256684129277;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](([]((LTLAPp0==true))||(LTLAPp1==true)||[]((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FlexibleBarrier-PT-14b-LTLCardinality-09 finished in 88789 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)||G(p1))))'
Support contains 2 out of 784 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 784/784 places, 1043/1043 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 762 transition count 1021
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 762 transition count 1021
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 48 place count 762 transition count 1017
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 64 place count 746 transition count 1001
Iterating global reduction 1 with 16 rules applied. Total rules applied 80 place count 746 transition count 1001
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 89 place count 746 transition count 992
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 96 place count 739 transition count 985
Iterating global reduction 2 with 7 rules applied. Total rules applied 103 place count 739 transition count 985
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 110 place count 739 transition count 978
Applied a total of 110 rules in 80 ms. Remains 739 /784 variables (removed 45) and now considering 978/1043 (removed 65) transitions.
// Phase 1: matrix 978 rows 739 cols
[2022-05-15 17:00:50] [INFO ] Computed 16 place invariants in 12 ms
[2022-05-15 17:00:50] [INFO ] Implicit Places using invariants in 736 ms returned []
// Phase 1: matrix 978 rows 739 cols
[2022-05-15 17:00:50] [INFO ] Computed 16 place invariants in 13 ms
[2022-05-15 17:00:52] [INFO ] Implicit Places using invariants and state equation in 1474 ms returned []
Implicit Place search using SMT with State Equation took 2212 ms to find 0 implicit places.
// Phase 1: matrix 978 rows 739 cols
[2022-05-15 17:00:52] [INFO ] Computed 16 place invariants in 15 ms
[2022-05-15 17:00:53] [INFO ] Dead Transitions using invariants and state equation in 982 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 739/784 places, 978/1043 transitions.
Finished structural reductions, in 1 iterations. Remains : 739/784 places, 978/1043 transitions.
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NEQ s462 0) (NEQ s225 1)), p0:(AND (EQ s225 0) (EQ s462 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 99 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14b-LTLCardinality-12 finished in 3398 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0)||p1||G(p2)))))'
Found a SL insensitive property : FlexibleBarrier-PT-14b-LTLCardinality-09
Stuttering acceptance computed with spot in 230 ms :[true, (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (NOT p0)]
Support contains 4 out of 784 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 784/784 places, 1043/1043 transitions.
Graph (trivial) has 735 edges and 784 vertex of which 79 / 784 are part of one of the 13 SCC in 2 ms
Free SCC test removed 66 places
Ensure Unique test removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 74 place count 717 transition count 902
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 1 with 73 rules applied. Total rules applied 147 place count 644 transition count 902
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 147 place count 644 transition count 867
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 217 place count 609 transition count 867
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 260 place count 566 transition count 824
Iterating global reduction 2 with 43 rules applied. Total rules applied 303 place count 566 transition count 824
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 307 place count 566 transition count 820
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 318 place count 555 transition count 809
Iterating global reduction 3 with 11 rules applied. Total rules applied 329 place count 555 transition count 809
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 339 place count 555 transition count 799
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 178 rules applied. Total rules applied 517 place count 466 transition count 710
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 521 place count 462 transition count 706
Iterating global reduction 4 with 4 rules applied. Total rules applied 525 place count 462 transition count 706
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 529 place count 462 transition count 702
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 531 place count 461 transition count 702
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 5 with 15 rules applied. Total rules applied 546 place count 461 transition count 687
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 548 place count 459 transition count 685
Applied a total of 548 rules in 256 ms. Remains 459 /784 variables (removed 325) and now considering 685/1043 (removed 358) transitions.
[2022-05-15 17:00:54] [INFO ] Flow matrix only has 659 transitions (discarded 26 similar events)
// Phase 1: matrix 659 rows 459 cols
[2022-05-15 17:00:54] [INFO ] Computed 16 place invariants in 7 ms
[2022-05-15 17:00:54] [INFO ] Implicit Places using invariants in 505 ms returned []
[2022-05-15 17:00:54] [INFO ] Flow matrix only has 659 transitions (discarded 26 similar events)
// Phase 1: matrix 659 rows 459 cols
[2022-05-15 17:00:54] [INFO ] Computed 16 place invariants in 7 ms
[2022-05-15 17:00:55] [INFO ] Implicit Places using invariants and state equation in 697 ms returned []
Implicit Place search using SMT with State Equation took 1208 ms to find 0 implicit places.
[2022-05-15 17:00:55] [INFO ] Flow matrix only has 659 transitions (discarded 26 similar events)
// Phase 1: matrix 659 rows 459 cols
[2022-05-15 17:00:55] [INFO ] Computed 16 place invariants in 7 ms
[2022-05-15 17:00:55] [INFO ] Dead Transitions using invariants and state equation in 552 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 459/784 places, 685/1043 transitions.
Finished structural reductions, in 1 iterations. Remains : 459/784 places, 685/1043 transitions.
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(OR (EQ s81 0) (EQ s355 1)), p2:(EQ s145 0), p1:(EQ s25 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4651 reset in 822 ms.
Product exploration explored 100000 steps with 4647 reset in 839 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 p2 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p2)), true, (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (AND (NOT p1) p0 p2)), (X (NOT (AND (NOT p1) p0 p2))), (X p1), (X (NOT p1)), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 872 ms. Reduced automaton from 6 states, 15 edges and 3 AP to 6 states, 15 edges and 3 AP.
Stuttering acceptance computed with spot in 216 ms :[true, (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 474 resets, run finished after 668 ms. (steps per millisecond=14 ) properties (out of 11) seen :6
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2022-05-15 17:00:59] [INFO ] Flow matrix only has 659 transitions (discarded 26 similar events)
// Phase 1: matrix 659 rows 459 cols
[2022-05-15 17:00:59] [INFO ] Computed 16 place invariants in 7 ms
[2022-05-15 17:00:59] [INFO ] After 199ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-15 17:01:00] [INFO ] [Nat]Absence check using 16 positive place invariants in 14 ms returned sat
[2022-05-15 17:01:00] [INFO ] After 595ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-15 17:01:01] [INFO ] After 915ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 201 ms.
[2022-05-15 17:01:01] [INFO ] After 1407ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 17 ms.
Support contains 4 out of 459 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 459/459 places, 685/685 transitions.
Drop transitions removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 459 transition count 658
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 41 place count 445 transition count 644
Iterating global reduction 1 with 14 rules applied. Total rules applied 55 place count 445 transition count 644
Free-agglomeration rule applied 368 times.
Iterating global reduction 1 with 368 rules applied. Total rules applied 423 place count 445 transition count 276
Reduce places removed 369 places and 0 transitions.
Drop transitions removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Graph (trivial) has 71 edges and 76 vertex of which 26 / 76 are part of one of the 13 SCC in 0 ms
Free SCC test removed 13 places
Iterating post reduction 1 with 514 rules applied. Total rules applied 937 place count 63 transition count 132
Drop transitions removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 963 place count 63 transition count 106
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 963 place count 63 transition count 92
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 991 place count 49 transition count 92
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 1005 place count 49 transition count 78
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 1035 place count 34 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1036 place count 34 transition count 62
Drop transitions removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 5 with 25 rules applied. Total rules applied 1061 place count 34 transition count 37
Graph (complete) has 56 edges and 34 vertex of which 16 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Iterating post reduction 5 with 1 rules applied. Total rules applied 1062 place count 16 transition count 28
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 1071 place count 16 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1073 place count 15 transition count 18
Free-agglomeration rule applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 1077 place count 15 transition count 14
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 1087 place count 9 transition count 10
Applied a total of 1087 rules in 184 ms. Remains 9 /459 variables (removed 450) and now considering 10/685 (removed 675) transitions.
Finished structural reductions, in 1 iterations. Remains : 9/459 places, 10/685 transitions.
Finished random walk after 6 steps, including 0 resets, run visited all 5 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p2)), true, (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (AND (NOT p1) p0 p2)), (X (NOT (AND (NOT p1) p0 p2))), (X p1), (X (NOT p1)), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X p1)), (X (X (NOT p1))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) p2)), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F (NOT (AND p0 p2))), (F (NOT p2)), (F (AND (NOT p0) (NOT p2))), (F (NOT p0)), (F (AND (NOT p1) p0 (NOT p2))), (F p1), (F (AND (NOT p1) (NOT p0) p2)), (F (NOT (AND (NOT p1) p0 p2)))]
Knowledge based reduction with 9 factoid took 1080 ms. Reduced automaton from 6 states, 15 edges and 3 AP to 6 states, 15 edges and 3 AP.
Stuttering acceptance computed with spot in 197 ms :[true, (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 206 ms :[true, (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1))]
Support contains 4 out of 459 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 459/459 places, 685/685 transitions.
Applied a total of 0 rules in 14 ms. Remains 459 /459 variables (removed 0) and now considering 685/685 (removed 0) transitions.
[2022-05-15 17:01:02] [INFO ] Flow matrix only has 659 transitions (discarded 26 similar events)
// Phase 1: matrix 659 rows 459 cols
[2022-05-15 17:01:03] [INFO ] Computed 16 place invariants in 7 ms
[2022-05-15 17:01:03] [INFO ] Implicit Places using invariants in 661 ms returned []
[2022-05-15 17:01:03] [INFO ] Flow matrix only has 659 transitions (discarded 26 similar events)
// Phase 1: matrix 659 rows 459 cols
[2022-05-15 17:01:03] [INFO ] Computed 16 place invariants in 12 ms
[2022-05-15 17:01:04] [INFO ] Implicit Places using invariants and state equation in 1008 ms returned []
Implicit Place search using SMT with State Equation took 1672 ms to find 0 implicit places.
[2022-05-15 17:01:04] [INFO ] Flow matrix only has 659 transitions (discarded 26 similar events)
// Phase 1: matrix 659 rows 459 cols
[2022-05-15 17:01:04] [INFO ] Computed 16 place invariants in 14 ms
[2022-05-15 17:01:05] [INFO ] Dead Transitions using invariants and state equation in 708 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 459/459 places, 685/685 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 p2 p0 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), true, (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (AND (NOT p1) p0 p2)), (X (NOT (AND (NOT p1) p0 p2))), (X p1), (X (NOT p1)), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 958 ms. Reduced automaton from 6 states, 15 edges and 3 AP to 6 states, 15 edges and 3 AP.
Stuttering acceptance computed with spot in 216 ms :[true, (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 473 resets, run finished after 699 ms. (steps per millisecond=14 ) properties (out of 11) seen :6
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2022-05-15 17:01:07] [INFO ] Flow matrix only has 659 transitions (discarded 26 similar events)
// Phase 1: matrix 659 rows 459 cols
[2022-05-15 17:01:07] [INFO ] Computed 16 place invariants in 7 ms
[2022-05-15 17:01:07] [INFO ] After 184ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-15 17:01:07] [INFO ] [Nat]Absence check using 16 positive place invariants in 11 ms returned sat
[2022-05-15 17:01:08] [INFO ] After 462ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-15 17:01:08] [INFO ] After 719ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 164 ms.
[2022-05-15 17:01:08] [INFO ] After 1090ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 4 out of 459 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 459/459 places, 685/685 transitions.
Drop transitions removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 459 transition count 658
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 41 place count 445 transition count 644
Iterating global reduction 1 with 14 rules applied. Total rules applied 55 place count 445 transition count 644
Free-agglomeration rule applied 368 times.
Iterating global reduction 1 with 368 rules applied. Total rules applied 423 place count 445 transition count 276
Reduce places removed 369 places and 0 transitions.
Drop transitions removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Graph (trivial) has 71 edges and 76 vertex of which 26 / 76 are part of one of the 13 SCC in 0 ms
Free SCC test removed 13 places
Iterating post reduction 1 with 514 rules applied. Total rules applied 937 place count 63 transition count 132
Drop transitions removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 963 place count 63 transition count 106
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 963 place count 63 transition count 92
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 991 place count 49 transition count 92
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 1005 place count 49 transition count 78
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 1035 place count 34 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1036 place count 34 transition count 62
Drop transitions removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 5 with 25 rules applied. Total rules applied 1061 place count 34 transition count 37
Graph (complete) has 56 edges and 34 vertex of which 16 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.0 ms
Discarding 18 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Iterating post reduction 5 with 1 rules applied. Total rules applied 1062 place count 16 transition count 28
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 1071 place count 16 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1073 place count 15 transition count 18
Free-agglomeration rule applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 1077 place count 15 transition count 14
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 1087 place count 9 transition count 10
Applied a total of 1087 rules in 54 ms. Remains 9 /459 variables (removed 450) and now considering 10/685 (removed 675) transitions.
Finished structural reductions, in 1 iterations. Remains : 9/459 places, 10/685 transitions.
Finished random walk after 70 steps, including 0 resets, run visited all 5 properties in 1 ms. (steps per millisecond=70 )
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), true, (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (AND (NOT p1) p0 p2)), (X (NOT (AND (NOT p1) p0 p2))), (X p1), (X (NOT p1)), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X p1)), (X (X (NOT p1))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) p2)), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F (NOT (AND p0 p2))), (F (NOT p2)), (F (AND (NOT p0) (NOT p2))), (F (NOT p0)), (F (AND (NOT p1) p0 (NOT p2))), (F p1), (F (AND (NOT p1) (NOT p0) p2)), (F (NOT (AND (NOT p1) p0 p2)))]
Knowledge based reduction with 9 factoid took 1181 ms. Reduced automaton from 6 states, 15 edges and 3 AP to 6 states, 15 edges and 3 AP.
Stuttering acceptance computed with spot in 223 ms :[true, (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 254 ms :[true, (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 423 ms :[true, (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4669 reset in 1099 ms.
Product exploration explored 100000 steps with 4660 reset in 1030 ms.
Applying partial POR strategy [true, false, true, true, true, true]
Stuttering acceptance computed with spot in 194 ms :[true, (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1))]
Support contains 4 out of 459 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 459/459 places, 685/685 transitions.
Applied a total of 0 rules in 31 ms. Remains 459 /459 variables (removed 0) and now considering 685/685 (removed 0) transitions.
[2022-05-15 17:01:13] [INFO ] Redundant transitions in 5 ms returned []
[2022-05-15 17:01:13] [INFO ] Flow matrix only has 659 transitions (discarded 26 similar events)
// Phase 1: matrix 659 rows 459 cols
[2022-05-15 17:01:13] [INFO ] Computed 16 place invariants in 9 ms
[2022-05-15 17:01:14] [INFO ] Dead Transitions using invariants and state equation in 536 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 459/459 places, 685/685 transitions.
Product exploration explored 100000 steps with 4651 reset in 959 ms.
Product exploration explored 100000 steps with 4665 reset in 1054 ms.
Built C files in :
/tmp/ltsmin7784998829641189713
[2022-05-15 17:01:16] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7784998829641189713
Running compilation step : cd /tmp/ltsmin7784998829641189713;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2037 ms.
Running link step : cd /tmp/ltsmin7784998829641189713;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin7784998829641189713;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3490247117967852801.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 459 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 459/459 places, 685/685 transitions.
Applied a total of 0 rules in 8 ms. Remains 459 /459 variables (removed 0) and now considering 685/685 (removed 0) transitions.
[2022-05-15 17:01:31] [INFO ] Flow matrix only has 659 transitions (discarded 26 similar events)
// Phase 1: matrix 659 rows 459 cols
[2022-05-15 17:01:31] [INFO ] Computed 16 place invariants in 7 ms
[2022-05-15 17:01:31] [INFO ] Implicit Places using invariants in 496 ms returned []
[2022-05-15 17:01:31] [INFO ] Flow matrix only has 659 transitions (discarded 26 similar events)
// Phase 1: matrix 659 rows 459 cols
[2022-05-15 17:01:31] [INFO ] Computed 16 place invariants in 8 ms
[2022-05-15 17:01:33] [INFO ] Implicit Places using invariants and state equation in 1204 ms returned []
Implicit Place search using SMT with State Equation took 1707 ms to find 0 implicit places.
[2022-05-15 17:01:33] [INFO ] Flow matrix only has 659 transitions (discarded 26 similar events)
// Phase 1: matrix 659 rows 459 cols
[2022-05-15 17:01:33] [INFO ] Computed 16 place invariants in 13 ms
[2022-05-15 17:01:33] [INFO ] Dead Transitions using invariants and state equation in 664 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 459/459 places, 685/685 transitions.
Built C files in :
/tmp/ltsmin8533301051244649265
[2022-05-15 17:01:33] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8533301051244649265
Running compilation step : cd /tmp/ltsmin8533301051244649265;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2007 ms.
Running link step : cd /tmp/ltsmin8533301051244649265;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin8533301051244649265;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2520624058948699418.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 17:01:48] [INFO ] Flatten gal took : 32 ms
[2022-05-15 17:01:48] [INFO ] Flatten gal took : 27 ms
[2022-05-15 17:01:48] [INFO ] Time to serialize gal into /tmp/LTL8468775397742066185.gal : 6 ms
[2022-05-15 17:01:48] [INFO ] Time to serialize properties into /tmp/LTL12185565865693262821.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8468775397742066185.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12185565865693262821.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8468775...267
Read 1 LTL properties
Checking formula 0 : !((X(G(((G("((p543==0)||(p2158==1))"))||("(p217==1)"))||(G("(p961==0)"))))))
Formula 0 simplified : !XG("(p217==1)" | G"((p543==0)||(p2158==1))" | G"(p961==0)")
Detected timeout of ITS tools.
[2022-05-15 17:02:03] [INFO ] Flatten gal took : 27 ms
[2022-05-15 17:02:03] [INFO ] Applying decomposition
[2022-05-15 17:02:03] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5344922167906839287.txt' '-o' '/tmp/graph5344922167906839287.bin' '-w' '/tmp/graph5344922167906839287.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5344922167906839287.bin' '-l' '-1' '-v' '-w' '/tmp/graph5344922167906839287.weights' '-q' '0' '-e' '0.001'
[2022-05-15 17:02:04] [INFO ] Decomposing Gal with order
[2022-05-15 17:02:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 17:02:04] [INFO ] Removed a total of 283 redundant transitions.
[2022-05-15 17:02:04] [INFO ] Flatten gal took : 118 ms
[2022-05-15 17:02:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 69 labels/synchronizations in 12 ms.
[2022-05-15 17:02:04] [INFO ] Time to serialize gal into /tmp/LTL18192288237884002343.gal : 9 ms
[2022-05-15 17:02:04] [INFO ] Time to serialize properties into /tmp/LTL14186567109495933533.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18192288237884002343.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14186567109495933533.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1819228...247
Read 1 LTL properties
Checking formula 0 : !((X(G(((G("((i4.u14.p543==0)||(u42.p2158==1))"))||("(i1.u5.p217==1)"))||(G("(u23.p961==0)"))))))
Formula 0 simplified : !XG("(i1.u5.p217==1)" | G"((i4.u14.p543==0)||(u42.p2158==1))" | G"(u23.p961==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7388982777491869243
[2022-05-15 17:02:19] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7388982777491869243
Running compilation step : cd /tmp/ltsmin7388982777491869243;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1826 ms.
Running link step : cd /tmp/ltsmin7388982777491869243;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin7388982777491869243;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](([]((LTLAPp0==true))||(LTLAPp1==true)||[]((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FlexibleBarrier-PT-14b-LTLCardinality-09 finished in 100941 ms.
[2022-05-15 17:02:34] [INFO ] Flatten gal took : 32 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17192681032213647618
[2022-05-15 17:02:34] [INFO ] Computing symmetric may disable matrix : 1043 transitions.
[2022-05-15 17:02:34] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 17:02:34] [INFO ] Applying decomposition
[2022-05-15 17:02:34] [INFO ] Computing symmetric may enable matrix : 1043 transitions.
[2022-05-15 17:02:34] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 17:02:34] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10012027389598088423.txt' '-o' '/tmp/graph10012027389598088423.bin' '-w' '/tmp/graph10012027389598088423.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10012027389598088423.bin' '-l' '-1' '-v' '-w' '/tmp/graph10012027389598088423.weights' '-q' '0' '-e' '0.001'
[2022-05-15 17:02:34] [INFO ] Decomposing Gal with order
[2022-05-15 17:02:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 17:02:34] [INFO ] Computing Do-Not-Accords matrix : 1043 transitions.
[2022-05-15 17:02:34] [INFO ] Removed a total of 317 redundant transitions.
[2022-05-15 17:02:34] [INFO ] Computation of Completed DNA matrix. took 74 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 17:02:34] [INFO ] Built C files in 390ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17192681032213647618
Running compilation step : cd /tmp/ltsmin17192681032213647618;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-15 17:02:34] [INFO ] Flatten gal took : 126 ms
[2022-05-15 17:02:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 15 ms.
[2022-05-15 17:02:34] [INFO ] Time to serialize gal into /tmp/LTLCardinality17504162252174115836.gal : 13 ms
[2022-05-15 17:02:34] [INFO ] Time to serialize properties into /tmp/LTLCardinality11473435459887924638.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17504162252174115836.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11473435459887924638.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...269
Read 1 LTL properties
Checking formula 0 : !((X(G(((G("((i5.u59.p543==0)||(i15.u160.p2158==1))"))||("(i2.u25.p217==1)"))||(G("(i8.u82.p961==0)"))))))
Formula 0 simplified : !XG("(i2.u25.p217==1)" | G"((i5.u59.p543==0)||(i15.u160.p2158==1))" | G"(i8.u82.p961==0)")
Compilation finished in 4660 ms.
Running link step : cd /tmp/ltsmin17192681032213647618;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 97 ms.
Running LTSmin : cd /tmp/ltsmin17192681032213647618;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](([]((LTLAPp0==true))||(LTLAPp1==true)||[]((LTLAPp2==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-15 17:23:50] [INFO ] Applying decomposition
[2022-05-15 17:23:50] [INFO ] Flatten gal took : 96 ms
[2022-05-15 17:23:50] [INFO ] Decomposing Gal with order
[2022-05-15 17:23:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 17:23:50] [INFO ] Removed a total of 278 redundant transitions.
[2022-05-15 17:23:50] [INFO ] Flatten gal took : 373 ms
[2022-05-15 17:23:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 942 labels/synchronizations in 198 ms.
[2022-05-15 17:23:51] [INFO ] Time to serialize gal into /tmp/LTLCardinality11371366890070625784.gal : 36 ms
[2022-05-15 17:23:51] [INFO ] Time to serialize properties into /tmp/LTLCardinality12821870577594880760.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality11371366890070625784.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12821870577594880760.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...269
Read 1 LTL properties
Checking formula 0 : !((X(G(((G("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u18.p543==0)||(i1.u29.p2158==1))"))||("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u15.p217==1...206
Formula 0 simplified : !XG("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u15.p217==1)" | G"((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u18.p543==0)||(i1.u29.p2158==1))" | G...192
Detected timeout of ITS tools.
[2022-05-15 17:45:06] [INFO ] Flatten gal took : 139 ms
[2022-05-15 17:45:07] [INFO ] Input system was already deterministic with 1043 transitions.
[2022-05-15 17:45:07] [INFO ] Transformed 784 places.
[2022-05-15 17:45:07] [INFO ] Transformed 1043 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-15 17:45:07] [INFO ] Time to serialize gal into /tmp/LTLCardinality8680325797171976336.gal : 22 ms
[2022-05-15 17:45:07] [INFO ] Time to serialize properties into /tmp/LTLCardinality4022606691645998415.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality8680325797171976336.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4022606691645998415.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...333
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(G(((G("((p543==0)||(p2158==1))"))||("(p217==1)"))||(G("(p961==0)"))))))
Formula 0 simplified : !XG("(p217==1)" | G"((p543==0)||(p2158==1))" | G"(p961==0)")
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.154: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.154: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.155: LTL layer: formula: X([](([]((LTLAPp0==true))||(LTLAPp1==true)||[]((LTLAPp2==true)))))
pins2lts-mc-linux64( 4/ 8), 0.159: "X([](([]((LTLAPp0==true))||(LTLAPp1==true)||[]((LTLAPp2==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.168: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.168: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.168: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.169: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.170: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.184: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.189: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.214: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.379: DFS-FIFO for weak LTL, using special progress label 1047
pins2lts-mc-linux64( 0/ 8), 0.379: There are 1048 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.379: State length is 785, there are 1058 groups
pins2lts-mc-linux64( 0/ 8), 0.379: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.379: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.379: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.379: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.591: ~1 levels ~960 states ~3352 transitions
pins2lts-mc-linux64( 7/ 8), 0.720: ~1 levels ~1920 states ~11168 transitions
pins2lts-mc-linux64( 7/ 8), 0.830: ~1 levels ~3840 states ~15960 transitions
pins2lts-mc-linux64( 7/ 8), 1.100: ~1 levels ~7680 states ~26352 transitions
pins2lts-mc-linux64( 7/ 8), 2.036: ~1 levels ~15360 states ~90816 transitions
pins2lts-mc-linux64( 3/ 8), 3.249: ~1 levels ~30720 states ~153624 transitions
pins2lts-mc-linux64( 3/ 8), 5.916: ~1 levels ~61440 states ~328088 transitions
pins2lts-mc-linux64( 3/ 8), 11.166: ~1 levels ~122880 states ~805120 transitions
pins2lts-mc-linux64( 3/ 8), 23.116: ~1 levels ~245760 states ~1718608 transitions
pins2lts-mc-linux64( 1/ 8), 44.901: ~1 levels ~491520 states ~4078200 transitions
pins2lts-mc-linux64( 1/ 8), 78.213: ~1 levels ~983040 states ~8159112 transitions
pins2lts-mc-linux64( 0/ 8), 146.991: ~1 levels ~1966080 states ~14991776 transitions
pins2lts-mc-linux64( 0/ 8), 282.492: ~1 levels ~3932160 states ~31076328 transitions
pins2lts-mc-linux64( 0/ 8), 565.595: ~1 levels ~7864320 states ~66673136 transitions
pins2lts-mc-linux64( 0/ 8), 1129.486: ~1 levels ~15728640 states ~137734176 transitions
pins2lts-mc-linux64( 0/ 8), 2293.921: ~1 levels ~31457280 states ~291083896 transitions
pins2lts-mc-linux64( 6/ 8), 3346.633: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 3346.737:
pins2lts-mc-linux64( 0/ 8), 3346.737: mean standard work distribution: 3.5% (states) 5.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 3346.737:
pins2lts-mc-linux64( 0/ 8), 3346.737: Explored 43415946 states 483651011 transitions, fanout: 11.140
pins2lts-mc-linux64( 0/ 8), 3346.737: Total exploration time 3346.330 sec (3346.240 sec minimum, 3346.282 sec on average)
pins2lts-mc-linux64( 0/ 8), 3346.737: States per second: 12974, Transitions per second: 144532
pins2lts-mc-linux64( 0/ 8), 3346.737:
pins2lts-mc-linux64( 0/ 8), 3346.737: Progress states detected: 98433047
pins2lts-mc-linux64( 0/ 8), 3346.737: Redundant explorations: -55.8930
pins2lts-mc-linux64( 0/ 8), 3346.737:
pins2lts-mc-linux64( 0/ 8), 3346.737: Queue width: 8B, total height: 92487876, memory: 705.63MB
pins2lts-mc-linux64( 0/ 8), 3346.737: Tree memory: 1007.0MB, 10.7 B/state, compr.: 0.3%
pins2lts-mc-linux64( 0/ 8), 3346.737: Tree fill ratio (roots/leafs): 73.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 3346.737: Stored 1205 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 3346.737: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 3346.737: Est. total memory use: 1712.6MB (~1729.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17192681032213647618;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](([]((LTLAPp0==true))||(LTLAPp1==true)||[]((LTLAPp2==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17192681032213647618;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](([]((LTLAPp0==true))||(LTLAPp1==true)||[]((LTLAPp2==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FlexibleBarrier-PT-14b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is FlexibleBarrier-PT-14b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r096-smll-165260575700091"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-14b.tgz
mv FlexibleBarrier-PT-14b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;