About the Execution of ITS-Tools for ShieldIIPs-PT-040B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16221.243 | 3600000.00 | 12138226.00 | 38751.80 | ?FFF?FFF?F?FTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r222-tall-165286024800140.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldIIPs-PT-040B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286024800140
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 928K
-rw-r--r-- 1 mcc users 8.3K Apr 29 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Apr 29 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 29 15:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 29 15:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 675K May 10 09:34 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPs-PT-040B-LTLFireability-00
FORMULA_NAME ShieldIIPs-PT-040B-LTLFireability-01
FORMULA_NAME ShieldIIPs-PT-040B-LTLFireability-02
FORMULA_NAME ShieldIIPs-PT-040B-LTLFireability-03
FORMULA_NAME ShieldIIPs-PT-040B-LTLFireability-04
FORMULA_NAME ShieldIIPs-PT-040B-LTLFireability-05
FORMULA_NAME ShieldIIPs-PT-040B-LTLFireability-06
FORMULA_NAME ShieldIIPs-PT-040B-LTLFireability-07
FORMULA_NAME ShieldIIPs-PT-040B-LTLFireability-08
FORMULA_NAME ShieldIIPs-PT-040B-LTLFireability-09
FORMULA_NAME ShieldIIPs-PT-040B-LTLFireability-10
FORMULA_NAME ShieldIIPs-PT-040B-LTLFireability-11
FORMULA_NAME ShieldIIPs-PT-040B-LTLFireability-12
FORMULA_NAME ShieldIIPs-PT-040B-LTLFireability-13
FORMULA_NAME ShieldIIPs-PT-040B-LTLFireability-14
FORMULA_NAME ShieldIIPs-PT-040B-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652939466654
Running Version 202205111006
[2022-05-19 05:51:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 05:51:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 05:51:08] [INFO ] Load time of PNML (sax parser for PT used): 190 ms
[2022-05-19 05:51:08] [INFO ] Transformed 2403 places.
[2022-05-19 05:51:08] [INFO ] Transformed 2363 transitions.
[2022-05-19 05:51:08] [INFO ] Found NUPN structural information;
[2022-05-19 05:51:08] [INFO ] Parsed PT model containing 2403 places and 2363 transitions in 370 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Support contains 60 out of 2403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2403/2403 places, 2363/2363 transitions.
Discarding 268 places :
Symmetric choice reduction at 0 with 268 rule applications. Total rules 268 place count 2135 transition count 2095
Iterating global reduction 0 with 268 rules applied. Total rules applied 536 place count 2135 transition count 2095
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 537 place count 2134 transition count 2094
Iterating global reduction 0 with 1 rules applied. Total rules applied 538 place count 2134 transition count 2094
Applied a total of 538 rules in 663 ms. Remains 2134 /2403 variables (removed 269) and now considering 2094/2363 (removed 269) transitions.
// Phase 1: matrix 2094 rows 2134 cols
[2022-05-19 05:51:09] [INFO ] Computed 361 place invariants in 37 ms
[2022-05-19 05:51:09] [INFO ] Implicit Places using invariants in 861 ms returned []
// Phase 1: matrix 2094 rows 2134 cols
[2022-05-19 05:51:09] [INFO ] Computed 361 place invariants in 16 ms
[2022-05-19 05:51:12] [INFO ] Implicit Places using invariants and state equation in 2235 ms returned []
Implicit Place search using SMT with State Equation took 3122 ms to find 0 implicit places.
// Phase 1: matrix 2094 rows 2134 cols
[2022-05-19 05:51:12] [INFO ] Computed 361 place invariants in 21 ms
[2022-05-19 05:51:13] [INFO ] Dead Transitions using invariants and state equation in 1255 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2134/2403 places, 2094/2363 transitions.
Finished structural reductions, in 1 iterations. Remains : 2134/2403 places, 2094/2363 transitions.
Support contains 60 out of 2134 places after structural reductions.
[2022-05-19 05:51:13] [INFO ] Flatten gal took : 194 ms
[2022-05-19 05:51:13] [INFO ] Flatten gal took : 118 ms
[2022-05-19 05:51:14] [INFO ] Input system was already deterministic with 2094 transitions.
Support contains 58 out of 2134 places (down from 60) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 608 ms. (steps per millisecond=16 ) properties (out of 38) seen :28
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 2094 rows 2134 cols
[2022-05-19 05:51:15] [INFO ] Computed 361 place invariants in 14 ms
[2022-05-19 05:51:15] [INFO ] [Real]Absence check using 361 positive place invariants in 126 ms returned sat
[2022-05-19 05:51:16] [INFO ] After 972ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-05-19 05:51:16] [INFO ] [Nat]Absence check using 361 positive place invariants in 125 ms returned sat
[2022-05-19 05:51:18] [INFO ] After 1646ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2022-05-19 05:51:19] [INFO ] Deduced a trap composed of 27 places in 440 ms of which 7 ms to minimize.
[2022-05-19 05:51:19] [INFO ] Deduced a trap composed of 27 places in 475 ms of which 3 ms to minimize.
[2022-05-19 05:51:20] [INFO ] Deduced a trap composed of 24 places in 391 ms of which 2 ms to minimize.
[2022-05-19 05:51:20] [INFO ] Deduced a trap composed of 39 places in 369 ms of which 2 ms to minimize.
[2022-05-19 05:51:21] [INFO ] Deduced a trap composed of 45 places in 369 ms of which 2 ms to minimize.
[2022-05-19 05:51:21] [INFO ] Deduced a trap composed of 30 places in 354 ms of which 1 ms to minimize.
[2022-05-19 05:51:22] [INFO ] Deduced a trap composed of 23 places in 358 ms of which 1 ms to minimize.
[2022-05-19 05:51:22] [INFO ] Deduced a trap composed of 26 places in 324 ms of which 1 ms to minimize.
[2022-05-19 05:51:22] [INFO ] Deduced a trap composed of 23 places in 340 ms of which 0 ms to minimize.
[2022-05-19 05:51:23] [INFO ] Deduced a trap composed of 27 places in 332 ms of which 1 ms to minimize.
[2022-05-19 05:51:23] [INFO ] Deduced a trap composed of 27 places in 334 ms of which 1 ms to minimize.
[2022-05-19 05:51:24] [INFO ] Deduced a trap composed of 34 places in 320 ms of which 1 ms to minimize.
[2022-05-19 05:51:24] [INFO ] Deduced a trap composed of 20 places in 336 ms of which 1 ms to minimize.
[2022-05-19 05:51:24] [INFO ] Deduced a trap composed of 20 places in 338 ms of which 1 ms to minimize.
[2022-05-19 05:51:25] [INFO ] Deduced a trap composed of 32 places in 337 ms of which 1 ms to minimize.
[2022-05-19 05:51:25] [INFO ] Deduced a trap composed of 38 places in 325 ms of which 0 ms to minimize.
[2022-05-19 05:51:26] [INFO ] Deduced a trap composed of 34 places in 317 ms of which 1 ms to minimize.
[2022-05-19 05:51:26] [INFO ] Deduced a trap composed of 36 places in 312 ms of which 1 ms to minimize.
[2022-05-19 05:51:26] [INFO ] Deduced a trap composed of 26 places in 311 ms of which 1 ms to minimize.
[2022-05-19 05:51:27] [INFO ] Deduced a trap composed of 34 places in 338 ms of which 0 ms to minimize.
[2022-05-19 05:51:27] [INFO ] Deduced a trap composed of 35 places in 313 ms of which 1 ms to minimize.
[2022-05-19 05:51:28] [INFO ] Deduced a trap composed of 25 places in 327 ms of which 1 ms to minimize.
[2022-05-19 05:51:28] [INFO ] Deduced a trap composed of 37 places in 329 ms of which 1 ms to minimize.
[2022-05-19 05:51:28] [INFO ] Deduced a trap composed of 30 places in 328 ms of which 1 ms to minimize.
[2022-05-19 05:51:29] [INFO ] Deduced a trap composed of 36 places in 290 ms of which 0 ms to minimize.
[2022-05-19 05:51:29] [INFO ] Deduced a trap composed of 47 places in 271 ms of which 1 ms to minimize.
[2022-05-19 05:51:29] [INFO ] Deduced a trap composed of 35 places in 280 ms of which 1 ms to minimize.
[2022-05-19 05:51:30] [INFO ] Deduced a trap composed of 40 places in 273 ms of which 2 ms to minimize.
[2022-05-19 05:51:30] [INFO ] Deduced a trap composed of 37 places in 264 ms of which 1 ms to minimize.
[2022-05-19 05:51:30] [INFO ] Deduced a trap composed of 49 places in 252 ms of which 1 ms to minimize.
[2022-05-19 05:51:31] [INFO ] Deduced a trap composed of 48 places in 251 ms of which 1 ms to minimize.
[2022-05-19 05:51:31] [INFO ] Deduced a trap composed of 35 places in 257 ms of which 1 ms to minimize.
[2022-05-19 05:51:31] [INFO ] Deduced a trap composed of 45 places in 253 ms of which 0 ms to minimize.
[2022-05-19 05:51:32] [INFO ] Deduced a trap composed of 44 places in 241 ms of which 5 ms to minimize.
[2022-05-19 05:51:32] [INFO ] Deduced a trap composed of 44 places in 229 ms of which 1 ms to minimize.
[2022-05-19 05:51:32] [INFO ] Deduced a trap composed of 48 places in 210 ms of which 0 ms to minimize.
[2022-05-19 05:51:33] [INFO ] Deduced a trap composed of 41 places in 237 ms of which 1 ms to minimize.
[2022-05-19 05:51:33] [INFO ] Deduced a trap composed of 56 places in 231 ms of which 0 ms to minimize.
[2022-05-19 05:51:33] [INFO ] Deduced a trap composed of 46 places in 225 ms of which 1 ms to minimize.
[2022-05-19 05:51:34] [INFO ] Deduced a trap composed of 38 places in 226 ms of which 1 ms to minimize.
[2022-05-19 05:51:34] [INFO ] Deduced a trap composed of 49 places in 220 ms of which 0 ms to minimize.
[2022-05-19 05:51:34] [INFO ] Deduced a trap composed of 43 places in 212 ms of which 1 ms to minimize.
[2022-05-19 05:51:34] [INFO ] Deduced a trap composed of 49 places in 202 ms of which 0 ms to minimize.
[2022-05-19 05:51:35] [INFO ] Deduced a trap composed of 65 places in 206 ms of which 1 ms to minimize.
[2022-05-19 05:51:35] [INFO ] Deduced a trap composed of 54 places in 187 ms of which 0 ms to minimize.
[2022-05-19 05:51:35] [INFO ] Deduced a trap composed of 64 places in 209 ms of which 0 ms to minimize.
[2022-05-19 05:51:35] [INFO ] Deduced a trap composed of 61 places in 173 ms of which 1 ms to minimize.
[2022-05-19 05:51:36] [INFO ] Trap strengthening (SAT) tested/added 48/47 trap constraints in 17278 ms
[2022-05-19 05:51:36] [INFO ] Deduced a trap composed of 46 places in 181 ms of which 0 ms to minimize.
[2022-05-19 05:51:36] [INFO ] Deduced a trap composed of 46 places in 188 ms of which 0 ms to minimize.
[2022-05-19 05:51:36] [INFO ] Deduced a trap composed of 48 places in 174 ms of which 0 ms to minimize.
[2022-05-19 05:51:37] [INFO ] Deduced a trap composed of 60 places in 176 ms of which 0 ms to minimize.
[2022-05-19 05:51:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1099 ms
[2022-05-19 05:51:37] [INFO ] Deduced a trap composed of 35 places in 290 ms of which 0 ms to minimize.
[2022-05-19 05:51:37] [INFO ] Deduced a trap composed of 28 places in 276 ms of which 1 ms to minimize.
[2022-05-19 05:51:38] [INFO ] Deduced a trap composed of 33 places in 273 ms of which 1 ms to minimize.
[2022-05-19 05:51:38] [INFO ] Deduced a trap composed of 39 places in 285 ms of which 1 ms to minimize.
[2022-05-19 05:51:39] [INFO ] Deduced a trap composed of 32 places in 257 ms of which 6 ms to minimize.
[2022-05-19 05:51:39] [INFO ] Deduced a trap composed of 47 places in 272 ms of which 1 ms to minimize.
[2022-05-19 05:51:39] [INFO ] Deduced a trap composed of 45 places in 255 ms of which 1 ms to minimize.
[2022-05-19 05:51:39] [INFO ] Deduced a trap composed of 39 places in 234 ms of which 1 ms to minimize.
[2022-05-19 05:51:40] [INFO ] Deduced a trap composed of 53 places in 213 ms of which 1 ms to minimize.
[2022-05-19 05:51:40] [INFO ] Deduced a trap composed of 54 places in 216 ms of which 1 ms to minimize.
[2022-05-19 05:51:40] [INFO ] Deduced a trap composed of 62 places in 213 ms of which 1 ms to minimize.
[2022-05-19 05:51:41] [INFO ] Deduced a trap composed of 58 places in 211 ms of which 0 ms to minimize.
[2022-05-19 05:51:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 05:51:41] [INFO ] After 25092ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 850 ms.
Support contains 17 out of 2134 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2134/2134 places, 2094/2094 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 2134 transition count 1893
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1933 transition count 1893
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 402 place count 1933 transition count 1694
Deduced a syphon composed of 199 places in 3 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 800 place count 1734 transition count 1694
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 809 place count 1725 transition count 1685
Iterating global reduction 2 with 9 rules applied. Total rules applied 818 place count 1725 transition count 1685
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 818 place count 1725 transition count 1680
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 828 place count 1720 transition count 1680
Performed 705 Post agglomeration using F-continuation condition.Transition count delta: 705
Deduced a syphon composed of 705 places in 7 ms
Reduce places removed 705 places and 0 transitions.
Iterating global reduction 2 with 1410 rules applied. Total rules applied 2238 place count 1015 transition count 975
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 270 times.
Drop transitions removed 270 transitions
Iterating global reduction 2 with 270 rules applied. Total rules applied 2508 place count 1015 transition count 975
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2509 place count 1014 transition count 974
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2510 place count 1013 transition count 974
Applied a total of 2510 rules in 594 ms. Remains 1013 /2134 variables (removed 1121) and now considering 974/2094 (removed 1120) transitions.
Finished structural reductions, in 1 iterations. Remains : 1013/2134 places, 974/2094 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 10) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 974 rows 1013 cols
[2022-05-19 05:51:43] [INFO ] Computed 360 place invariants in 39 ms
[2022-05-19 05:51:43] [INFO ] [Real]Absence check using 353 positive place invariants in 68 ms returned sat
[2022-05-19 05:51:43] [INFO ] [Real]Absence check using 353 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 05:51:43] [INFO ] After 698ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 05:51:43] [INFO ] [Nat]Absence check using 353 positive place invariants in 52 ms returned sat
[2022-05-19 05:51:43] [INFO ] [Nat]Absence check using 353 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 05:51:44] [INFO ] After 437ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 05:51:44] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2022-05-19 05:51:44] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2022-05-19 05:51:44] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 0 ms to minimize.
[2022-05-19 05:51:44] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2022-05-19 05:51:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 400 ms
[2022-05-19 05:51:44] [INFO ] After 938ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 76 ms.
[2022-05-19 05:51:44] [INFO ] After 1233ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 22 ms.
Support contains 5 out of 1013 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1013/1013 places, 974/974 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1013 transition count 973
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1012 transition count 973
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 22 place count 1002 transition count 963
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 29 place count 1002 transition count 963
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 31 place count 1000 transition count 961
Applied a total of 31 rules in 197 ms. Remains 1000 /1013 variables (removed 13) and now considering 961/974 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 1000/1013 places, 961/974 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 961 rows 1000 cols
[2022-05-19 05:51:45] [INFO ] Computed 360 place invariants in 38 ms
[2022-05-19 05:51:45] [INFO ] [Real]Absence check using 357 positive place invariants in 55 ms returned sat
[2022-05-19 05:51:45] [INFO ] [Real]Absence check using 357 positive and 3 generalized place invariants in 0 ms returned sat
[2022-05-19 05:51:45] [INFO ] After 598ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 05:51:46] [INFO ] [Nat]Absence check using 357 positive place invariants in 57 ms returned sat
[2022-05-19 05:51:46] [INFO ] [Nat]Absence check using 357 positive and 3 generalized place invariants in 2 ms returned sat
[2022-05-19 05:51:46] [INFO ] After 388ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 05:51:46] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2022-05-19 05:51:46] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 0 ms to minimize.
[2022-05-19 05:51:46] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
[2022-05-19 05:51:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 293 ms
[2022-05-19 05:51:46] [INFO ] After 714ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2022-05-19 05:51:46] [INFO ] After 961ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1000/1000 places, 961/961 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1000 transition count 961
Applied a total of 2 rules in 44 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1000/1000 places, 961/961 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Finished probabilistic random walk after 194460 steps, run visited all 1 properties in 2473 ms. (steps per millisecond=78 )
Probabilistic random walk after 194460 steps, saw 185141 distinct states, run finished after 2476 ms. (steps per millisecond=78 ) properties seen :1
Computed a total of 486 stabilizing places and 486 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(X(X(p0)))||G(p1)))))'
Support contains 3 out of 2134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2134/2134 places, 2094/2094 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 2133 transition count 1892
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1932 transition count 1892
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 402 place count 1932 transition count 1691
Deduced a syphon composed of 201 places in 4 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 804 place count 1731 transition count 1691
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 814 place count 1721 transition count 1681
Iterating global reduction 2 with 10 rules applied. Total rules applied 824 place count 1721 transition count 1681
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 824 place count 1721 transition count 1676
Deduced a syphon composed of 5 places in 5 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 834 place count 1716 transition count 1676
Performed 710 Post agglomeration using F-continuation condition.Transition count delta: 710
Deduced a syphon composed of 710 places in 3 ms
Reduce places removed 710 places and 0 transitions.
Iterating global reduction 2 with 1420 rules applied. Total rules applied 2254 place count 1006 transition count 966
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2256 place count 1004 transition count 964
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2257 place count 1003 transition count 964
Applied a total of 2257 rules in 408 ms. Remains 1003 /2134 variables (removed 1131) and now considering 964/2094 (removed 1130) transitions.
// Phase 1: matrix 964 rows 1003 cols
[2022-05-19 05:51:50] [INFO ] Computed 360 place invariants in 4 ms
[2022-05-19 05:51:50] [INFO ] Implicit Places using invariants in 439 ms returned []
// Phase 1: matrix 964 rows 1003 cols
[2022-05-19 05:51:50] [INFO ] Computed 360 place invariants in 2 ms
[2022-05-19 05:51:51] [INFO ] Implicit Places using invariants and state equation in 990 ms returned []
Implicit Place search using SMT with State Equation took 1438 ms to find 0 implicit places.
[2022-05-19 05:51:52] [INFO ] Redundant transitions in 151 ms returned [963]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 963 rows 1003 cols
[2022-05-19 05:51:52] [INFO ] Computed 360 place invariants in 2 ms
[2022-05-19 05:51:52] [INFO ] Dead Transitions using invariants and state equation in 491 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1003/2134 places, 963/2094 transitions.
Applied a total of 0 rules in 37 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1003/2134 places, 963/2094 transitions.
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), 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 (EQ s28 0) (EQ s394 0)), p0:(AND (EQ s394 1) (EQ s249 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 51 reset in 1034 ms.
Product exploration explored 100000 steps with 53 reset in 928 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 1 factoid took 217 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 2 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 1 factoid took 259 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 26 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
// Phase 1: matrix 963 rows 1003 cols
[2022-05-19 05:51:55] [INFO ] Computed 360 place invariants in 5 ms
[2022-05-19 05:51:55] [INFO ] Implicit Places using invariants in 436 ms returned []
// Phase 1: matrix 963 rows 1003 cols
[2022-05-19 05:51:55] [INFO ] Computed 360 place invariants in 2 ms
[2022-05-19 05:51:56] [INFO ] Implicit Places using invariants and state equation in 1003 ms returned []
Implicit Place search using SMT with State Equation took 1445 ms to find 0 implicit places.
[2022-05-19 05:51:57] [INFO ] Redundant transitions in 101 ms returned []
// Phase 1: matrix 963 rows 1003 cols
[2022-05-19 05:51:57] [INFO ] Computed 360 place invariants in 3 ms
[2022-05-19 05:51:57] [INFO ] Dead Transitions using invariants and state equation in 511 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1003/1003 places, 963/963 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 1 factoid took 265 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 3 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 1 factoid took 297 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 55 reset in 790 ms.
Product exploration explored 100000 steps with 52 reset in 924 ms.
Built C files in :
/tmp/ltsmin13393615157247416244
[2022-05-19 05:52:00] [INFO ] Computing symmetric may disable matrix : 963 transitions.
[2022-05-19 05:52:00] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 05:52:00] [INFO ] Computing symmetric may enable matrix : 963 transitions.
[2022-05-19 05:52:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 05:52:00] [INFO ] Computing Do-Not-Accords matrix : 963 transitions.
[2022-05-19 05:52:00] [INFO ] Computation of Completed DNA matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 05:52:00] [INFO ] Built C files in 245ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13393615157247416244
Running compilation step : cd /tmp/ltsmin13393615157247416244;'/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 2785 ms.
Running link step : cd /tmp/ltsmin13393615157247416244;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin13393615157247416244;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1703971331012018324.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 30 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
// Phase 1: matrix 963 rows 1003 cols
[2022-05-19 05:52:15] [INFO ] Computed 360 place invariants in 4 ms
[2022-05-19 05:52:15] [INFO ] Implicit Places using invariants in 447 ms returned []
// Phase 1: matrix 963 rows 1003 cols
[2022-05-19 05:52:15] [INFO ] Computed 360 place invariants in 2 ms
[2022-05-19 05:52:16] [INFO ] Implicit Places using invariants and state equation in 1049 ms returned []
Implicit Place search using SMT with State Equation took 1496 ms to find 0 implicit places.
[2022-05-19 05:52:16] [INFO ] Redundant transitions in 94 ms returned []
// Phase 1: matrix 963 rows 1003 cols
[2022-05-19 05:52:16] [INFO ] Computed 360 place invariants in 2 ms
[2022-05-19 05:52:17] [INFO ] Dead Transitions using invariants and state equation in 474 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1003/1003 places, 963/963 transitions.
Built C files in :
/tmp/ltsmin12093606713373352335
[2022-05-19 05:52:17] [INFO ] Computing symmetric may disable matrix : 963 transitions.
[2022-05-19 05:52:17] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 05:52:17] [INFO ] Computing symmetric may enable matrix : 963 transitions.
[2022-05-19 05:52:17] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 05:52:17] [INFO ] Computing Do-Not-Accords matrix : 963 transitions.
[2022-05-19 05:52:17] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 05:52:17] [INFO ] Built C files in 100ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12093606713373352335
Running compilation step : cd /tmp/ltsmin12093606713373352335;'/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 2675 ms.
Running link step : cd /tmp/ltsmin12093606713373352335;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin12093606713373352335;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14063486137014685662.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 05:52:32] [INFO ] Flatten gal took : 51 ms
[2022-05-19 05:52:32] [INFO ] Flatten gal took : 46 ms
[2022-05-19 05:52:32] [INFO ] Time to serialize gal into /tmp/LTL11934849262346093119.gal : 12 ms
[2022-05-19 05:52:32] [INFO ] Time to serialize properties into /tmp/LTL10396711168322469479.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/LTL11934849262346093119.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10396711168322469479.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/LTL1193484...268
Read 1 LTL properties
Checking formula 0 : !((G(F((X(X(X("((p957==1)&&(p617==0))"))))||(G("((p109==0)&&(p957==0))"))))))
Formula 0 simplified : !GF(XXX"((p957==1)&&(p617==0))" | G"((p109==0)&&(p957==0))")
Detected timeout of ITS tools.
[2022-05-19 05:52:47] [INFO ] Flatten gal took : 41 ms
[2022-05-19 05:52:47] [INFO ] Applying decomposition
[2022-05-19 05:52:47] [INFO ] Flatten gal took : 40 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/graph1922848273902580762.txt' '-o' '/tmp/graph1922848273902580762.bin' '-w' '/tmp/graph1922848273902580762.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1922848273902580762.bin' '-l' '-1' '-v' '-w' '/tmp/graph1922848273902580762.weights' '-q' '0' '-e' '0.001'
[2022-05-19 05:52:48] [INFO ] Decomposing Gal with order
[2022-05-19 05:52:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 05:52:48] [INFO ] Removed a total of 635 redundant transitions.
[2022-05-19 05:52:48] [INFO ] Flatten gal took : 116 ms
[2022-05-19 05:52:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 604 labels/synchronizations in 21 ms.
[2022-05-19 05:52:48] [INFO ] Time to serialize gal into /tmp/LTL4262570677732540903.gal : 12 ms
[2022-05-19 05:52:48] [INFO ] Time to serialize properties into /tmp/LTL8694800634229871945.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/LTL4262570677732540903.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8694800634229871945.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/LTL4262570...245
Read 1 LTL properties
Checking formula 0 : !((G(F((X(X(X("((i15.i2.u142.p957==1)&&(i9.i1.u90.p617==0))"))))||(G("((i1.i1.u10.p109==0)&&(i15.i2.u142.p957==0))"))))))
Formula 0 simplified : !GF(XXX"((i15.i2.u142.p957==1)&&(i9.i1.u90.p617==0))" | G"((i1.i1.u10.p109==0)&&(i15.i2.u142.p957==0))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11130842506476983065
[2022-05-19 05:53:03] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11130842506476983065
Running compilation step : cd /tmp/ltsmin11130842506476983065;'/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 1691 ms.
Running link step : cd /tmp/ltsmin11130842506476983065;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin11130842506476983065;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((X(X(X((LTLAPp0==true))))||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-040B-LTLFireability-00 finished in 88491 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(X(p0)))))'
Support contains 3 out of 2134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2134/2134 places, 2094/2094 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 2122 transition count 2082
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 2122 transition count 2082
Applied a total of 24 rules in 206 ms. Remains 2122 /2134 variables (removed 12) and now considering 2082/2094 (removed 12) transitions.
// Phase 1: matrix 2082 rows 2122 cols
[2022-05-19 05:53:18] [INFO ] Computed 361 place invariants in 13 ms
[2022-05-19 05:53:19] [INFO ] Implicit Places using invariants in 701 ms returned []
// Phase 1: matrix 2082 rows 2122 cols
[2022-05-19 05:53:19] [INFO ] Computed 361 place invariants in 13 ms
[2022-05-19 05:53:21] [INFO ] Implicit Places using invariants and state equation in 2109 ms returned []
Implicit Place search using SMT with State Equation took 2813 ms to find 0 implicit places.
// Phase 1: matrix 2082 rows 2122 cols
[2022-05-19 05:53:21] [INFO ] Computed 361 place invariants in 6 ms
[2022-05-19 05:53:22] [INFO ] Dead Transitions using invariants and state equation in 1133 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2122/2134 places, 2082/2094 transitions.
Finished structural reductions, in 1 iterations. Remains : 2122/2134 places, 2082/2094 transitions.
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (EQ s739 1) (EQ s747 1) (EQ s768 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-040B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040B-LTLFireability-01 finished in 4339 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 3 out of 2134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2134/2134 places, 2094/2094 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 2122 transition count 2082
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 2122 transition count 2082
Applied a total of 24 rules in 204 ms. Remains 2122 /2134 variables (removed 12) and now considering 2082/2094 (removed 12) transitions.
// Phase 1: matrix 2082 rows 2122 cols
[2022-05-19 05:53:23] [INFO ] Computed 361 place invariants in 14 ms
[2022-05-19 05:53:23] [INFO ] Implicit Places using invariants in 609 ms returned []
// Phase 1: matrix 2082 rows 2122 cols
[2022-05-19 05:53:23] [INFO ] Computed 361 place invariants in 11 ms
[2022-05-19 05:53:25] [INFO ] Implicit Places using invariants and state equation in 2166 ms returned []
Implicit Place search using SMT with State Equation took 2776 ms to find 0 implicit places.
// Phase 1: matrix 2082 rows 2122 cols
[2022-05-19 05:53:25] [INFO ] Computed 361 place invariants in 7 ms
[2022-05-19 05:53:27] [INFO ] Dead Transitions using invariants and state equation in 1282 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2122/2134 places, 2082/2094 transitions.
Finished structural reductions, in 1 iterations. Remains : 2122/2134 places, 2082/2094 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (EQ s687 1) (EQ s695 1) (EQ s717 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 5020 steps with 0 reset in 47 ms.
FORMULA ShieldIIPs-PT-040B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040B-LTLFireability-02 finished in 4487 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(X(p0)))&&X(G(p1))))'
Support contains 3 out of 2134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2134/2134 places, 2094/2094 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 2123 transition count 2083
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 2123 transition count 2083
Applied a total of 22 rules in 221 ms. Remains 2123 /2134 variables (removed 11) and now considering 2083/2094 (removed 11) transitions.
// Phase 1: matrix 2083 rows 2123 cols
[2022-05-19 05:53:27] [INFO ] Computed 361 place invariants in 13 ms
[2022-05-19 05:53:28] [INFO ] Implicit Places using invariants in 676 ms returned []
// Phase 1: matrix 2083 rows 2123 cols
[2022-05-19 05:53:28] [INFO ] Computed 361 place invariants in 6 ms
[2022-05-19 05:53:30] [INFO ] Implicit Places using invariants and state equation in 2302 ms returned []
Implicit Place search using SMT with State Equation took 2981 ms to find 0 implicit places.
// Phase 1: matrix 2083 rows 2123 cols
[2022-05-19 05:53:30] [INFO ] Computed 361 place invariants in 10 ms
[2022-05-19 05:53:31] [INFO ] Dead Transitions using invariants and state equation in 1165 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2123/2134 places, 2083/2094 transitions.
Finished structural reductions, in 1 iterations. Remains : 2123/2134 places, 2083/2094 transitions.
Stuttering acceptance computed with spot in 145 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (EQ s1773 1) (EQ s1789 1)), p0:(EQ s1964 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-040B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040B-LTLFireability-03 finished in 4547 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(F(G((F(p1)||p1)))&&p2))))'
Support contains 3 out of 2134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2134/2134 places, 2094/2094 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 2133 transition count 1893
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 1933 transition count 1893
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 400 place count 1933 transition count 1693
Deduced a syphon composed of 200 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 800 place count 1733 transition count 1693
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 811 place count 1722 transition count 1682
Iterating global reduction 2 with 11 rules applied. Total rules applied 822 place count 1722 transition count 1682
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 822 place count 1722 transition count 1678
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 830 place count 1718 transition count 1678
Performed 711 Post agglomeration using F-continuation condition.Transition count delta: 711
Deduced a syphon composed of 711 places in 2 ms
Reduce places removed 711 places and 0 transitions.
Iterating global reduction 2 with 1422 rules applied. Total rules applied 2252 place count 1007 transition count 967
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2254 place count 1005 transition count 965
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2255 place count 1004 transition count 965
Applied a total of 2255 rules in 421 ms. Remains 1004 /2134 variables (removed 1130) and now considering 965/2094 (removed 1129) transitions.
// Phase 1: matrix 965 rows 1004 cols
[2022-05-19 05:53:32] [INFO ] Computed 360 place invariants in 3 ms
[2022-05-19 05:53:32] [INFO ] Implicit Places using invariants in 454 ms returned []
// Phase 1: matrix 965 rows 1004 cols
[2022-05-19 05:53:32] [INFO ] Computed 360 place invariants in 2 ms
[2022-05-19 05:53:33] [INFO ] Implicit Places using invariants and state equation in 1049 ms returned []
Implicit Place search using SMT with State Equation took 1505 ms to find 0 implicit places.
[2022-05-19 05:53:33] [INFO ] Redundant transitions in 133 ms returned [964]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 964 rows 1004 cols
[2022-05-19 05:53:33] [INFO ] Computed 360 place invariants in 2 ms
[2022-05-19 05:53:34] [INFO ] Dead Transitions using invariants and state equation in 485 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1004/2134 places, 964/2094 transitions.
Applied a total of 0 rules in 26 ms. Remains 1004 /1004 variables (removed 0) and now considering 964/964 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1004/2134 places, 964/2094 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s742 1), p2:(EQ s24 0), p1:(EQ s205 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 768 reset in 728 ms.
Product exploration explored 100000 steps with 915 reset in 867 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/1004 stabilizing places and 2/964 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 4 factoid took 457 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 485 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=80 )
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 4 factoid took 1491 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 964 rows 1004 cols
[2022-05-19 05:53:38] [INFO ] Computed 360 place invariants in 2 ms
[2022-05-19 05:53:39] [INFO ] [Real]Absence check using 360 positive place invariants in 237 ms returned sat
[2022-05-19 05:53:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 05:53:41] [INFO ] [Real]Absence check using state equation in 2047 ms returned sat
[2022-05-19 05:53:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 05:53:42] [INFO ] [Nat]Absence check using 360 positive place invariants in 187 ms returned sat
[2022-05-19 05:53:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 05:53:44] [INFO ] [Nat]Absence check using state equation in 1892 ms returned sat
[2022-05-19 05:53:44] [INFO ] Computed and/alt/rep : 959/2393/959 causal constraints (skipped 2 transitions) in 55 ms.
[2022-05-19 05:53:56] [INFO ] Added : 585 causal constraints over 117 iterations in 12305 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 1004 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1004/1004 places, 964/964 transitions.
Applied a total of 0 rules in 20 ms. Remains 1004 /1004 variables (removed 0) and now considering 964/964 (removed 0) transitions.
// Phase 1: matrix 964 rows 1004 cols
[2022-05-19 05:53:56] [INFO ] Computed 360 place invariants in 2 ms
[2022-05-19 05:53:57] [INFO ] Implicit Places using invariants in 422 ms returned []
// Phase 1: matrix 964 rows 1004 cols
[2022-05-19 05:53:57] [INFO ] Computed 360 place invariants in 2 ms
[2022-05-19 05:53:58] [INFO ] Implicit Places using invariants and state equation in 919 ms returned []
Implicit Place search using SMT with State Equation took 1350 ms to find 0 implicit places.
// Phase 1: matrix 964 rows 1004 cols
[2022-05-19 05:53:58] [INFO ] Computed 360 place invariants in 1 ms
[2022-05-19 05:53:58] [INFO ] Dead Transitions using invariants and state equation in 452 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1004/1004 places, 964/964 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/1004 stabilizing places and 2/964 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 4 factoid took 1311 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 540 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=90 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 4 factoid took 293 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 964 rows 1004 cols
[2022-05-19 05:54:00] [INFO ] Computed 360 place invariants in 4 ms
[2022-05-19 05:54:01] [INFO ] [Real]Absence check using 360 positive place invariants in 185 ms returned sat
[2022-05-19 05:54:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 05:54:03] [INFO ] [Real]Absence check using state equation in 2290 ms returned sat
[2022-05-19 05:54:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 05:54:04] [INFO ] [Nat]Absence check using 360 positive place invariants in 197 ms returned sat
[2022-05-19 05:54:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 05:54:06] [INFO ] [Nat]Absence check using state equation in 1971 ms returned sat
[2022-05-19 05:54:06] [INFO ] Computed and/alt/rep : 959/2393/959 causal constraints (skipped 2 transitions) in 58 ms.
[2022-05-19 05:54:18] [INFO ] Added : 590 causal constraints over 118 iterations in 12219 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 915 reset in 705 ms.
Product exploration explored 100000 steps with 787 reset in 900 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 295 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 1004 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1004/1004 places, 964/964 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1004 transition count 964
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 2 places in 2 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 1004 transition count 968
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 1003 transition count 965
Deduced a syphon composed of 1 places in 2 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 1003 transition count 965
Deduced a syphon composed of 1 places in 2 ms
Applied a total of 4 rules in 143 ms. Remains 1003 /1004 variables (removed 1) and now considering 965/964 (removed -1) transitions.
[2022-05-19 05:54:21] [INFO ] Redundant transitions in 87 ms returned []
// Phase 1: matrix 965 rows 1003 cols
[2022-05-19 05:54:21] [INFO ] Computed 360 place invariants in 1 ms
[2022-05-19 05:54:21] [INFO ] Dead Transitions using invariants and state equation in 467 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1003/1004 places, 965/964 transitions.
Finished structural reductions, in 1 iterations. Remains : 1003/1004 places, 965/964 transitions.
Product exploration explored 100000 steps with 784 reset in 870 ms.
Product exploration explored 100000 steps with 696 reset in 961 ms.
Built C files in :
/tmp/ltsmin8199541173311016827
[2022-05-19 05:54:23] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8199541173311016827
Running compilation step : cd /tmp/ltsmin8199541173311016827;'/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 1690 ms.
Running link step : cd /tmp/ltsmin8199541173311016827;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin8199541173311016827;'/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/stateBased9522920213349163161.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 1004 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1004/1004 places, 964/964 transitions.
Applied a total of 0 rules in 20 ms. Remains 1004 /1004 variables (removed 0) and now considering 964/964 (removed 0) transitions.
// Phase 1: matrix 964 rows 1004 cols
[2022-05-19 05:54:38] [INFO ] Computed 360 place invariants in 3 ms
[2022-05-19 05:54:39] [INFO ] Implicit Places using invariants in 447 ms returned []
// Phase 1: matrix 964 rows 1004 cols
[2022-05-19 05:54:39] [INFO ] Computed 360 place invariants in 2 ms
[2022-05-19 05:54:40] [INFO ] Implicit Places using invariants and state equation in 919 ms returned []
Implicit Place search using SMT with State Equation took 1368 ms to find 0 implicit places.
// Phase 1: matrix 964 rows 1004 cols
[2022-05-19 05:54:40] [INFO ] Computed 360 place invariants in 2 ms
[2022-05-19 05:54:40] [INFO ] Dead Transitions using invariants and state equation in 431 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1004/1004 places, 964/964 transitions.
Built C files in :
/tmp/ltsmin4193854847966492893
[2022-05-19 05:54:40] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4193854847966492893
Running compilation step : cd /tmp/ltsmin4193854847966492893;'/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 1646 ms.
Running link step : cd /tmp/ltsmin4193854847966492893;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin4193854847966492893;'/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/stateBased18142769334530163772.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 05:54:55] [INFO ] Flatten gal took : 41 ms
[2022-05-19 05:54:55] [INFO ] Flatten gal took : 40 ms
[2022-05-19 05:54:55] [INFO ] Time to serialize gal into /tmp/LTL16373611142484079939.gal : 6 ms
[2022-05-19 05:54:55] [INFO ] Time to serialize properties into /tmp/LTL4034920799805582812.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/LTL16373611142484079939.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4034920799805582812.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/LTL1637361...267
Read 1 LTL properties
Checking formula 0 : !((F(("(p1779==1)")||((F(G((F("(p520==1)"))||("(p520==1)"))))&&("(p89==0)")))))
Formula 0 simplified : !F("(p1779==1)" | ("(p89==0)" & FG("(p520==1)" | F"(p520==1)")))
Detected timeout of ITS tools.
[2022-05-19 05:55:10] [INFO ] Flatten gal took : 40 ms
[2022-05-19 05:55:10] [INFO ] Applying decomposition
[2022-05-19 05:55:10] [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/graph15072969903543726154.txt' '-o' '/tmp/graph15072969903543726154.bin' '-w' '/tmp/graph15072969903543726154.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15072969903543726154.bin' '-l' '-1' '-v' '-w' '/tmp/graph15072969903543726154.weights' '-q' '0' '-e' '0.001'
[2022-05-19 05:55:10] [INFO ] Decomposing Gal with order
[2022-05-19 05:55:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 05:55:11] [INFO ] Removed a total of 639 redundant transitions.
[2022-05-19 05:55:11] [INFO ] Flatten gal took : 68 ms
[2022-05-19 05:55:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 602 labels/synchronizations in 13 ms.
[2022-05-19 05:55:11] [INFO ] Time to serialize gal into /tmp/LTL18060638033599064905.gal : 7 ms
[2022-05-19 05:55:11] [INFO ] Time to serialize properties into /tmp/LTL4325894946616272814.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/LTL18060638033599064905.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4325894946616272814.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/LTL1806063...246
Read 1 LTL properties
Checking formula 0 : !((F(("(i28.i1.u270.p1779==1)")||((F(G((F("(i8.i0.u74.p520==1)"))||("(i8.i0.u74.p520==1)"))))&&("(i0.i0.u8.p89==0)")))))
Formula 0 simplified : !F("(i28.i1.u270.p1779==1)" | ("(i0.i0.u8.p89==0)" & FG("(i8.i0.u74.p520==1)" | F"(i8.i0.u74.p520==1)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1897857005423026830
[2022-05-19 05:55:26] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1897857005423026830
Running compilation step : cd /tmp/ltsmin1897857005423026830;'/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 1987 ms.
Running link step : cd /tmp/ltsmin1897857005423026830;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin1897857005423026830;'/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' '<>(((LTLAPp0==true)||(<>([]((<>((LTLAPp1==true))||(LTLAPp1==true))))&&(LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-040B-LTLFireability-04 finished in 129386 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&F(X(p1))&&p2)))'
Support contains 4 out of 2134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2134/2134 places, 2094/2094 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 2124 transition count 2084
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 2124 transition count 2084
Applied a total of 20 rules in 171 ms. Remains 2124 /2134 variables (removed 10) and now considering 2084/2094 (removed 10) transitions.
// Phase 1: matrix 2084 rows 2124 cols
[2022-05-19 05:55:41] [INFO ] Computed 361 place invariants in 11 ms
[2022-05-19 05:55:42] [INFO ] Implicit Places using invariants in 606 ms returned []
// Phase 1: matrix 2084 rows 2124 cols
[2022-05-19 05:55:42] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 05:55:44] [INFO ] Implicit Places using invariants and state equation in 1962 ms returned []
Implicit Place search using SMT with State Equation took 2571 ms to find 0 implicit places.
// Phase 1: matrix 2084 rows 2124 cols
[2022-05-19 05:55:44] [INFO ] Computed 361 place invariants in 6 ms
[2022-05-19 05:55:45] [INFO ] Dead Transitions using invariants and state equation in 1120 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2124/2134 places, 2084/2094 transitions.
Finished structural reductions, in 1 iterations. Remains : 2124/2134 places, 2084/2094 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p1) (NOT p2)), true]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 4}], [{ cond=(AND p2 p0), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(AND (EQ s1625 1) (EQ s1693 1)), p1:(EQ s2001 1), p2:(OR (EQ s2001 1) (EQ s651 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-040B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040B-LTLFireability-05 finished in 4042 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(!(p1 U p2)||X(X(p3)))))'
Support contains 5 out of 2134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2134/2134 places, 2094/2094 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 2123 transition count 2083
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 2123 transition count 2083
Applied a total of 22 rules in 132 ms. Remains 2123 /2134 variables (removed 11) and now considering 2083/2094 (removed 11) transitions.
// Phase 1: matrix 2083 rows 2123 cols
[2022-05-19 05:55:45] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 05:55:46] [INFO ] Implicit Places using invariants in 622 ms returned []
// Phase 1: matrix 2083 rows 2123 cols
[2022-05-19 05:55:46] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 05:55:48] [INFO ] Implicit Places using invariants and state equation in 1922 ms returned []
Implicit Place search using SMT with State Equation took 2549 ms to find 0 implicit places.
// Phase 1: matrix 2083 rows 2123 cols
[2022-05-19 05:55:48] [INFO ] Computed 361 place invariants in 7 ms
[2022-05-19 05:55:49] [INFO ] Dead Transitions using invariants and state equation in 1123 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2123/2134 places, 2083/2094 transitions.
Finished structural reductions, in 1 iterations. Remains : 2123/2134 places, 2083/2094 transitions.
Stuttering acceptance computed with spot in 887 ms :[(NOT p0), (NOT p3), (OR (NOT p0) (AND p2 (NOT p3))), (OR (NOT p0) (AND p2 (NOT p3))), (AND p2 (NOT p3)), p2, true, (OR (NOT p0) (NOT p3))]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 6}], [{ cond=(NOT p3), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=p2, acceptance={} source=2 dest: 7}], [{ cond=(AND p2 p0), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=4 dest: 5}, { cond=(AND p2 (NOT p3)), acceptance={} source=4 dest: 6}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=p2, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=p0, acceptance={} source=7 dest: 1}, { cond=(NOT p0), acceptance={} source=7 dest: 6}]], initial=2, aps=[p0:(EQ s461 1), p3:(AND (EQ s103 1) (EQ s140 1)), p1:(OR (AND (EQ s103 1) (EQ s140 1)) (EQ s1275 1)), p2:(OR (AND (EQ s103 1) (EQ s140 1)) (EQ s359 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-040B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040B-LTLFireability-06 finished in 4719 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X((p0 U (G(p1) U p0))))&&F((X(p3)||p2))))'
Support contains 7 out of 2134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2134/2134 places, 2094/2094 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 2123 transition count 2083
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 2123 transition count 2083
Applied a total of 22 rules in 131 ms. Remains 2123 /2134 variables (removed 11) and now considering 2083/2094 (removed 11) transitions.
// Phase 1: matrix 2083 rows 2123 cols
[2022-05-19 05:55:50] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 05:55:50] [INFO ] Implicit Places using invariants in 647 ms returned []
// Phase 1: matrix 2083 rows 2123 cols
[2022-05-19 05:55:50] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 05:55:52] [INFO ] Implicit Places using invariants and state equation in 2161 ms returned []
Implicit Place search using SMT with State Equation took 2812 ms to find 0 implicit places.
// Phase 1: matrix 2083 rows 2123 cols
[2022-05-19 05:55:53] [INFO ] Computed 361 place invariants in 6 ms
[2022-05-19 05:55:54] [INFO ] Dead Transitions using invariants and state equation in 1093 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2123/2134 places, 2083/2094 transitions.
Finished structural reductions, in 1 iterations. Remains : 2123/2134 places, 2083/2094 transitions.
Stuttering acceptance computed with spot in 713 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p0), (AND (NOT p2) (NOT p3)), true, (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(OR p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(OR (EQ s2043 0) (EQ s2061 0) (EQ s2068 0)), p0:(AND (EQ s690 1) (EQ s708 1) (EQ s717 1)), p1:(AND (EQ s2043 1) (EQ s2061 1) (EQ s2068 1)), p3:(EQ s174...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-040B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040B-LTLFireability-07 finished in 4778 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((X(F(p0))||F(G(p1))))))'
Support contains 4 out of 2134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2134/2134 places, 2094/2094 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 2122 transition count 2082
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 2122 transition count 2082
Applied a total of 24 rules in 162 ms. Remains 2122 /2134 variables (removed 12) and now considering 2082/2094 (removed 12) transitions.
// Phase 1: matrix 2082 rows 2122 cols
[2022-05-19 05:55:55] [INFO ] Computed 361 place invariants in 8 ms
[2022-05-19 05:55:55] [INFO ] Implicit Places using invariants in 636 ms returned []
// Phase 1: matrix 2082 rows 2122 cols
[2022-05-19 05:55:55] [INFO ] Computed 361 place invariants in 7 ms
[2022-05-19 05:55:57] [INFO ] Implicit Places using invariants and state equation in 2043 ms returned []
Implicit Place search using SMT with State Equation took 2685 ms to find 0 implicit places.
// Phase 1: matrix 2082 rows 2122 cols
[2022-05-19 05:55:57] [INFO ] Computed 361 place invariants in 6 ms
[2022-05-19 05:55:58] [INFO ] Dead Transitions using invariants and state equation in 1091 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2122/2134 places, 2082/2094 transitions.
Finished structural reductions, in 1 iterations. Remains : 2122/2134 places, 2082/2094 transitions.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(EQ s310 0), p0:(OR (EQ s1961 1) (AND (EQ s1047 1) (EQ s1071 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 257 reset in 403 ms.
Product exploration explored 100000 steps with 258 reset in 457 ms.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Detected a total of 479/2122 stabilizing places and 479/2082 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 1491 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 983 steps, including 0 resets, run visited all 2 properties in 16 ms. (steps per millisecond=61 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 141 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 2122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2122/2122 places, 2082/2082 transitions.
Applied a total of 0 rules in 63 ms. Remains 2122 /2122 variables (removed 0) and now considering 2082/2082 (removed 0) transitions.
// Phase 1: matrix 2082 rows 2122 cols
[2022-05-19 05:56:01] [INFO ] Computed 361 place invariants in 11 ms
[2022-05-19 05:56:02] [INFO ] Implicit Places using invariants in 636 ms returned []
// Phase 1: matrix 2082 rows 2122 cols
[2022-05-19 05:56:02] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 05:56:04] [INFO ] Implicit Places using invariants and state equation in 2107 ms returned []
Implicit Place search using SMT with State Equation took 2745 ms to find 0 implicit places.
// Phase 1: matrix 2082 rows 2122 cols
[2022-05-19 05:56:04] [INFO ] Computed 361 place invariants in 12 ms
[2022-05-19 05:56:05] [INFO ] Dead Transitions using invariants and state equation in 1113 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2122/2122 places, 2082/2082 transitions.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Detected a total of 479/2122 stabilizing places and 479/2082 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 137 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1341 steps, including 0 resets, run visited all 2 properties in 12 ms. (steps per millisecond=111 )
Knowledge obtained : [(AND (NOT p0) p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 201 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 257 reset in 424 ms.
Product exploration explored 100000 steps with 268 reset in 432 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 2122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2122/2122 places, 2082/2082 transitions.
Performed 200 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 2122 transition count 2082
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 80 Pre rules applied. Total rules applied 200 place count 2122 transition count 2084
Deduced a syphon composed of 280 places in 4 ms
Iterating global reduction 1 with 80 rules applied. Total rules applied 280 place count 2122 transition count 2084
Performed 836 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1116 places in 2 ms
Iterating global reduction 1 with 836 rules applied. Total rules applied 1116 place count 2122 transition count 2084
Renaming transitions due to excessive name length > 1024 char.
Discarding 281 places :
Symmetric choice reduction at 1 with 281 rule applications. Total rules 1397 place count 1841 transition count 1803
Deduced a syphon composed of 835 places in 2 ms
Iterating global reduction 1 with 281 rules applied. Total rules applied 1678 place count 1841 transition count 1803
Deduced a syphon composed of 835 places in 2 ms
Applied a total of 1678 rules in 683 ms. Remains 1841 /2122 variables (removed 281) and now considering 1803/2082 (removed 279) transitions.
[2022-05-19 05:56:08] [INFO ] Redundant transitions in 121 ms returned [1802]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1802 rows 1841 cols
[2022-05-19 05:56:08] [INFO ] Computed 361 place invariants in 14 ms
[2022-05-19 05:56:09] [INFO ] Dead Transitions using invariants and state equation in 980 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1841/2122 places, 1802/2082 transitions.
Deduced a syphon composed of 835 places in 2 ms
Applied a total of 0 rules in 55 ms. Remains 1841 /1841 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1841/2122 places, 1802/2082 transitions.
Product exploration explored 100000 steps with 1776 reset in 1062 ms.
Product exploration explored 100000 steps with 1760 reset in 1095 ms.
Built C files in :
/tmp/ltsmin8889850961517208407
[2022-05-19 05:56:11] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8889850961517208407
Running compilation step : cd /tmp/ltsmin8889850961517208407;'/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/ltsmin8889850961517208407;'/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/ltsmin8889850961517208407;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4 out of 2122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2122/2122 places, 2082/2082 transitions.
Applied a total of 0 rules in 68 ms. Remains 2122 /2122 variables (removed 0) and now considering 2082/2082 (removed 0) transitions.
// Phase 1: matrix 2082 rows 2122 cols
[2022-05-19 05:56:15] [INFO ] Computed 361 place invariants in 6 ms
[2022-05-19 05:56:16] [INFO ] Implicit Places using invariants in 615 ms returned []
// Phase 1: matrix 2082 rows 2122 cols
[2022-05-19 05:56:16] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 05:56:18] [INFO ] Implicit Places using invariants and state equation in 2064 ms returned []
Implicit Place search using SMT with State Equation took 2680 ms to find 0 implicit places.
// Phase 1: matrix 2082 rows 2122 cols
[2022-05-19 05:56:18] [INFO ] Computed 361 place invariants in 6 ms
[2022-05-19 05:56:19] [INFO ] Dead Transitions using invariants and state equation in 1181 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2122/2122 places, 2082/2082 transitions.
Built C files in :
/tmp/ltsmin14783765784362868909
[2022-05-19 05:56:20] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14783765784362868909
Running compilation step : cd /tmp/ltsmin14783765784362868909;'/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/ltsmin14783765784362868909;'/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/ltsmin14783765784362868909;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-19 05:56:23] [INFO ] Flatten gal took : 56 ms
[2022-05-19 05:56:24] [INFO ] Flatten gal took : 56 ms
[2022-05-19 05:56:24] [INFO ] Time to serialize gal into /tmp/LTL12259866943817117474.gal : 15 ms
[2022-05-19 05:56:24] [INFO ] Time to serialize properties into /tmp/LTL13056551921969770682.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/LTL12259866943817117474.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13056551921969770682.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/LTL1225986...268
Read 1 LTL properties
Checking formula 0 : !((F(X((X(F("((p2218==1)||((p1180==1)&&(p1208==1)))")))||(F(G("(p345==0)")))))))
Formula 0 simplified : !FX(XF"((p2218==1)||((p1180==1)&&(p1208==1)))" | FG"(p345==0)")
Detected timeout of ITS tools.
[2022-05-19 05:56:39] [INFO ] Flatten gal took : 53 ms
[2022-05-19 05:56:39] [INFO ] Applying decomposition
[2022-05-19 05:56:39] [INFO ] Flatten gal took : 53 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/graph2352266581835070100.txt' '-o' '/tmp/graph2352266581835070100.bin' '-w' '/tmp/graph2352266581835070100.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2352266581835070100.bin' '-l' '-1' '-v' '-w' '/tmp/graph2352266581835070100.weights' '-q' '0' '-e' '0.001'
[2022-05-19 05:56:39] [INFO ] Decomposing Gal with order
[2022-05-19 05:56:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 05:56:39] [INFO ] Removed a total of 920 redundant transitions.
[2022-05-19 05:56:39] [INFO ] Flatten gal took : 106 ms
[2022-05-19 05:56:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2022-05-19 05:56:39] [INFO ] Time to serialize gal into /tmp/LTL8455296961522755822.gal : 18 ms
[2022-05-19 05:56:39] [INFO ] Time to serialize properties into /tmp/LTL15592210737367727473.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/LTL8455296961522755822.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15592210737367727473.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/LTL8455296...246
Read 1 LTL properties
Checking formula 0 : !((F(X((X(F("((i36.i1.u741.p2218==1)||((i19.i2.u396.p1180==1)&&(i19.i5.u405.p1208==1)))")))||(F(G("(i5.i2.u120.p345==0)")))))))
Formula 0 simplified : !FX(XF"((i36.i1.u741.p2218==1)||((i19.i2.u396.p1180==1)&&(i19.i5.u405.p1208==1)))" | FG"(i5.i2.u120.p345==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13401173632309930331
[2022-05-19 05:56:54] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13401173632309930331
Running compilation step : cd /tmp/ltsmin13401173632309930331;'/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/ltsmin13401173632309930331;'/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/ltsmin13401173632309930331;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldIIPs-PT-040B-LTLFireability-08 finished in 62971 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&(G(p1)||p2))))'
Support contains 5 out of 2134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2134/2134 places, 2094/2094 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 2122 transition count 2082
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 2122 transition count 2082
Applied a total of 24 rules in 137 ms. Remains 2122 /2134 variables (removed 12) and now considering 2082/2094 (removed 12) transitions.
// Phase 1: matrix 2082 rows 2122 cols
[2022-05-19 05:56:57] [INFO ] Computed 361 place invariants in 7 ms
[2022-05-19 05:56:58] [INFO ] Implicit Places using invariants in 699 ms returned []
// Phase 1: matrix 2082 rows 2122 cols
[2022-05-19 05:56:58] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 05:57:00] [INFO ] Implicit Places using invariants and state equation in 2103 ms returned []
Implicit Place search using SMT with State Equation took 2805 ms to find 0 implicit places.
// Phase 1: matrix 2082 rows 2122 cols
[2022-05-19 05:57:00] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 05:57:01] [INFO ] Dead Transitions using invariants and state equation in 1103 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2122/2134 places, 2082/2094 transitions.
Finished structural reductions, in 1 iterations. Remains : 2122/2134 places, 2082/2094 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s44 1), p1:(OR (EQ s371 0) (EQ s395 0)), p0:(AND (EQ s53 1) (EQ s77 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7871 steps with 1 reset in 63 ms.
FORMULA ShieldIIPs-PT-040B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040B-LTLFireability-09 finished in 4288 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(!(p0 U !p1))&&X(p2))))'
Support contains 6 out of 2134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2134/2134 places, 2094/2094 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 2122 transition count 2082
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 2122 transition count 2082
Applied a total of 24 rules in 129 ms. Remains 2122 /2134 variables (removed 12) and now considering 2082/2094 (removed 12) transitions.
// Phase 1: matrix 2082 rows 2122 cols
[2022-05-19 05:57:02] [INFO ] Computed 361 place invariants in 24 ms
[2022-05-19 05:57:03] [INFO ] Implicit Places using invariants in 619 ms returned []
// Phase 1: matrix 2082 rows 2122 cols
[2022-05-19 05:57:03] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 05:57:05] [INFO ] Implicit Places using invariants and state equation in 2025 ms returned []
Implicit Place search using SMT with State Equation took 2650 ms to find 0 implicit places.
// Phase 1: matrix 2082 rows 2122 cols
[2022-05-19 05:57:05] [INFO ] Computed 361 place invariants in 9 ms
[2022-05-19 05:57:06] [INFO ] Dead Transitions using invariants and state equation in 1065 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2122/2134 places, 2082/2094 transitions.
Finished structural reductions, in 1 iterations. Remains : 2122/2134 places, 2082/2094 transitions.
Stuttering acceptance computed with spot in 951 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s272 1) (EQ s340 1)), p1:(OR (NOT (AND (EQ s834 1) (EQ s856 1))) (AND (EQ s1161 1) (EQ s1205 1))), p0:(AND (EQ s834 1) (EQ s856 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 26 reset in 731 ms.
Product exploration explored 100000 steps with 26 reset in 902 ms.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (OR (NOT p2) (NOT p1))), (X (NOT (AND p2 p0 p1))), (X (X p1)), (X (X (OR (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 277 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2082 rows 2122 cols
[2022-05-19 05:57:09] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 05:57:09] [INFO ] [Real]Absence check using 361 positive place invariants in 116 ms returned sat
[2022-05-19 05:57:10] [INFO ] After 1392ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 05:57:11] [INFO ] [Nat]Absence check using 361 positive place invariants in 120 ms returned sat
[2022-05-19 05:57:12] [INFO ] After 1050ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 05:57:12] [INFO ] Deduced a trap composed of 17 places in 496 ms of which 2 ms to minimize.
[2022-05-19 05:57:13] [INFO ] Deduced a trap composed of 17 places in 495 ms of which 1 ms to minimize.
[2022-05-19 05:57:14] [INFO ] Deduced a trap composed of 24 places in 491 ms of which 1 ms to minimize.
[2022-05-19 05:57:14] [INFO ] Deduced a trap composed of 10 places in 489 ms of which 1 ms to minimize.
[2022-05-19 05:57:15] [INFO ] Deduced a trap composed of 13 places in 489 ms of which 2 ms to minimize.
[2022-05-19 05:57:15] [INFO ] Deduced a trap composed of 17 places in 500 ms of which 1 ms to minimize.
[2022-05-19 05:57:16] [INFO ] Deduced a trap composed of 17 places in 491 ms of which 4 ms to minimize.
[2022-05-19 05:57:16] [INFO ] Deduced a trap composed of 29 places in 487 ms of which 1 ms to minimize.
[2022-05-19 05:57:17] [INFO ] Deduced a trap composed of 27 places in 484 ms of which 1 ms to minimize.
[2022-05-19 05:57:18] [INFO ] Deduced a trap composed of 28 places in 479 ms of which 1 ms to minimize.
[2022-05-19 05:57:18] [INFO ] Deduced a trap composed of 21 places in 481 ms of which 2 ms to minimize.
[2022-05-19 05:57:19] [INFO ] Deduced a trap composed of 13 places in 426 ms of which 1 ms to minimize.
[2022-05-19 05:57:19] [INFO ] Deduced a trap composed of 46 places in 413 ms of which 1 ms to minimize.
[2022-05-19 05:57:20] [INFO ] Deduced a trap composed of 27 places in 431 ms of which 2 ms to minimize.
[2022-05-19 05:57:20] [INFO ] Deduced a trap composed of 18 places in 476 ms of which 2 ms to minimize.
[2022-05-19 05:57:21] [INFO ] Deduced a trap composed of 23 places in 425 ms of which 1 ms to minimize.
[2022-05-19 05:57:21] [INFO ] Deduced a trap composed of 24 places in 414 ms of which 1 ms to minimize.
[2022-05-19 05:57:22] [INFO ] Deduced a trap composed of 17 places in 401 ms of which 1 ms to minimize.
[2022-05-19 05:57:22] [INFO ] Deduced a trap composed of 20 places in 398 ms of which 1 ms to minimize.
[2022-05-19 05:57:23] [INFO ] Deduced a trap composed of 22 places in 410 ms of which 1 ms to minimize.
[2022-05-19 05:57:23] [INFO ] Deduced a trap composed of 21 places in 380 ms of which 1 ms to minimize.
[2022-05-19 05:57:24] [INFO ] Deduced a trap composed of 25 places in 391 ms of which 1 ms to minimize.
[2022-05-19 05:57:24] [INFO ] Deduced a trap composed of 30 places in 400 ms of which 1 ms to minimize.
[2022-05-19 05:57:24] [INFO ] Deduced a trap composed of 21 places in 425 ms of which 1 ms to minimize.
[2022-05-19 05:57:25] [INFO ] Deduced a trap composed of 18 places in 415 ms of which 1 ms to minimize.
[2022-05-19 05:57:25] [INFO ] Deduced a trap composed of 23 places in 398 ms of which 1 ms to minimize.
[2022-05-19 05:57:26] [INFO ] Deduced a trap composed of 27 places in 409 ms of which 1 ms to minimize.
[2022-05-19 05:57:26] [INFO ] Deduced a trap composed of 17 places in 416 ms of which 1 ms to minimize.
[2022-05-19 05:57:27] [INFO ] Deduced a trap composed of 23 places in 393 ms of which 1 ms to minimize.
[2022-05-19 05:57:27] [INFO ] Deduced a trap composed of 21 places in 395 ms of which 1 ms to minimize.
[2022-05-19 05:57:28] [INFO ] Deduced a trap composed of 21 places in 394 ms of which 1 ms to minimize.
[2022-05-19 05:57:28] [INFO ] Deduced a trap composed of 23 places in 383 ms of which 1 ms to minimize.
[2022-05-19 05:57:29] [INFO ] Deduced a trap composed of 27 places in 376 ms of which 2 ms to minimize.
[2022-05-19 05:57:29] [INFO ] Deduced a trap composed of 29 places in 364 ms of which 1 ms to minimize.
[2022-05-19 05:57:30] [INFO ] Deduced a trap composed of 25 places in 372 ms of which 1 ms to minimize.
[2022-05-19 05:57:30] [INFO ] Deduced a trap composed of 24 places in 364 ms of which 1 ms to minimize.
[2022-05-19 05:57:30] [INFO ] Deduced a trap composed of 36 places in 360 ms of which 1 ms to minimize.
[2022-05-19 05:57:31] [INFO ] Deduced a trap composed of 21 places in 360 ms of which 1 ms to minimize.
[2022-05-19 05:57:31] [INFO ] Deduced a trap composed of 20 places in 355 ms of which 1 ms to minimize.
[2022-05-19 05:57:32] [INFO ] Deduced a trap composed of 20 places in 372 ms of which 0 ms to minimize.
[2022-05-19 05:57:32] [INFO ] Deduced a trap composed of 21 places in 373 ms of which 1 ms to minimize.
[2022-05-19 05:57:33] [INFO ] Deduced a trap composed of 33 places in 391 ms of which 1 ms to minimize.
[2022-05-19 05:57:33] [INFO ] Deduced a trap composed of 42 places in 384 ms of which 1 ms to minimize.
[2022-05-19 05:57:34] [INFO ] Deduced a trap composed of 35 places in 392 ms of which 1 ms to minimize.
[2022-05-19 05:57:34] [INFO ] Deduced a trap composed of 31 places in 365 ms of which 1 ms to minimize.
[2022-05-19 05:57:34] [INFO ] Deduced a trap composed of 27 places in 357 ms of which 1 ms to minimize.
[2022-05-19 05:57:35] [INFO ] Deduced a trap composed of 19 places in 380 ms of which 1 ms to minimize.
[2022-05-19 05:57:35] [INFO ] Deduced a trap composed of 33 places in 356 ms of which 1 ms to minimize.
[2022-05-19 05:57:36] [INFO ] Deduced a trap composed of 21 places in 1075 ms of which 3 ms to minimize.
[2022-05-19 05:57:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 05:57:36] [INFO ] After 26100ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 99 ms.
Support contains 6 out of 2122 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2122/2122 places, 2082/2082 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 2122 transition count 1882
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 1922 transition count 1882
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 202 Pre rules applied. Total rules applied 400 place count 1922 transition count 1680
Deduced a syphon composed of 202 places in 3 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 2 with 404 rules applied. Total rules applied 804 place count 1720 transition count 1680
Performed 712 Post agglomeration using F-continuation condition.Transition count delta: 712
Deduced a syphon composed of 712 places in 2 ms
Reduce places removed 712 places and 0 transitions.
Iterating global reduction 2 with 1424 rules applied. Total rules applied 2228 place count 1008 transition count 968
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 273 times.
Drop transitions removed 273 transitions
Iterating global reduction 2 with 273 rules applied. Total rules applied 2501 place count 1008 transition count 968
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2502 place count 1007 transition count 967
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2503 place count 1006 transition count 967
Applied a total of 2503 rules in 277 ms. Remains 1006 /2122 variables (removed 1116) and now considering 967/2082 (removed 1115) transitions.
Finished structural reductions, in 1 iterations. Remains : 1006/2122 places, 967/2082 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 967 rows 1006 cols
[2022-05-19 05:57:37] [INFO ] Computed 360 place invariants in 9 ms
[2022-05-19 05:57:37] [INFO ] [Real]Absence check using 357 positive place invariants in 52 ms returned sat
[2022-05-19 05:57:37] [INFO ] [Real]Absence check using 357 positive and 3 generalized place invariants in 2 ms returned sat
[2022-05-19 05:57:38] [INFO ] After 698ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 05:57:38] [INFO ] [Nat]Absence check using 357 positive place invariants in 51 ms returned sat
[2022-05-19 05:57:38] [INFO ] [Nat]Absence check using 357 positive and 3 generalized place invariants in 0 ms returned sat
[2022-05-19 05:57:38] [INFO ] After 367ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 05:57:38] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 0 ms to minimize.
[2022-05-19 05:57:38] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2022-05-19 05:57:39] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2022-05-19 05:57:39] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2022-05-19 05:57:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 339 ms
[2022-05-19 05:57:39] [INFO ] After 742ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2022-05-19 05:57:39] [INFO ] After 966ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 6 out of 1006 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1006/1006 places, 967/967 transitions.
Applied a total of 0 rules in 18 ms. Remains 1006 /1006 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1006/1006 places, 967/967 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 203316 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :{}
Probabilistic random walk after 203316 steps, saw 172491 distinct states, run finished after 3003 ms. (steps per millisecond=67 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 967 rows 1006 cols
[2022-05-19 05:57:42] [INFO ] Computed 360 place invariants in 14 ms
[2022-05-19 05:57:42] [INFO ] [Real]Absence check using 357 positive place invariants in 51 ms returned sat
[2022-05-19 05:57:42] [INFO ] [Real]Absence check using 357 positive and 3 generalized place invariants in 0 ms returned sat
[2022-05-19 05:57:42] [INFO ] After 552ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 05:57:43] [INFO ] [Nat]Absence check using 357 positive place invariants in 52 ms returned sat
[2022-05-19 05:57:43] [INFO ] [Nat]Absence check using 357 positive and 3 generalized place invariants in 2 ms returned sat
[2022-05-19 05:57:43] [INFO ] After 349ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 05:57:43] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 0 ms to minimize.
[2022-05-19 05:57:43] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2022-05-19 05:57:43] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2022-05-19 05:57:43] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2022-05-19 05:57:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 327 ms
[2022-05-19 05:57:43] [INFO ] After 709ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2022-05-19 05:57:43] [INFO ] After 925ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 6 out of 1006 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1006/1006 places, 967/967 transitions.
Applied a total of 0 rules in 18 ms. Remains 1006 /1006 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1006/1006 places, 967/967 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1006/1006 places, 967/967 transitions.
Applied a total of 0 rules in 18 ms. Remains 1006 /1006 variables (removed 0) and now considering 967/967 (removed 0) transitions.
// Phase 1: matrix 967 rows 1006 cols
[2022-05-19 05:57:43] [INFO ] Computed 360 place invariants in 5 ms
[2022-05-19 05:57:44] [INFO ] Implicit Places using invariants in 489 ms returned []
// Phase 1: matrix 967 rows 1006 cols
[2022-05-19 05:57:44] [INFO ] Computed 360 place invariants in 4 ms
[2022-05-19 05:57:45] [INFO ] Implicit Places using invariants and state equation in 1053 ms returned []
Implicit Place search using SMT with State Equation took 1543 ms to find 0 implicit places.
[2022-05-19 05:57:45] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 967 rows 1006 cols
[2022-05-19 05:57:45] [INFO ] Computed 360 place invariants in 12 ms
[2022-05-19 05:57:45] [INFO ] Dead Transitions using invariants and state equation in 424 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1006/1006 places, 967/967 transitions.
Applied a total of 0 rules in 18 ms. Remains 1006 /1006 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 967 rows 1006 cols
[2022-05-19 05:57:45] [INFO ] Computed 360 place invariants in 6 ms
[2022-05-19 05:57:46] [INFO ] [Real]Absence check using 357 positive place invariants in 48 ms returned sat
[2022-05-19 05:57:46] [INFO ] [Real]Absence check using 357 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 05:57:46] [INFO ] After 566ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 05:57:46] [INFO ] [Nat]Absence check using 357 positive place invariants in 56 ms returned sat
[2022-05-19 05:57:46] [INFO ] [Nat]Absence check using 357 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 05:57:47] [INFO ] After 372ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 05:57:47] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
[2022-05-19 05:57:47] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 0 ms to minimize.
[2022-05-19 05:57:47] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2022-05-19 05:57:47] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2022-05-19 05:57:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 328 ms
[2022-05-19 05:57:47] [INFO ] After 736ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2022-05-19 05:57:47] [INFO ] After 957ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-19 05:57:47] [INFO ] Flatten gal took : 36 ms
[2022-05-19 05:57:47] [INFO ] Flatten gal took : 36 ms
[2022-05-19 05:57:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16868812859041579905.gal : 4 ms
[2022-05-19 05:57:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17228017162840007406.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms9545912793941278467;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16868812859041579905.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17228017162840007406.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality17228017162840007406.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 8
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :8 after 144
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :144 after 352
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :352 after 436
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :436 after 693
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :693 after 2897
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2897 after 13329
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :13329 after 215655
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :215655 after 5.38295e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :5.38295e+06 after 1.28717e+08
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.28717e+08 after 1.25331e+10
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.25331e+10 after 2.68126e+10
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :2.68126e+10 after 5.73911e+11
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :5.73911e+11 after 6.88547e+13
Detected timeout of ITS tools.
[2022-05-19 05:58:02] [INFO ] Flatten gal took : 36 ms
[2022-05-19 05:58:02] [INFO ] Applying decomposition
[2022-05-19 05:58:02] [INFO ] Flatten gal took : 34 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/graph13496516060725543086.txt' '-o' '/tmp/graph13496516060725543086.bin' '-w' '/tmp/graph13496516060725543086.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13496516060725543086.bin' '-l' '-1' '-v' '-w' '/tmp/graph13496516060725543086.weights' '-q' '0' '-e' '0.001'
[2022-05-19 05:58:02] [INFO ] Decomposing Gal with order
[2022-05-19 05:58:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 05:58:02] [INFO ] Removed a total of 759 redundant transitions.
[2022-05-19 05:58:02] [INFO ] Flatten gal took : 59 ms
[2022-05-19 05:58:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 1053 labels/synchronizations in 19 ms.
[2022-05-19 05:58:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12666044763192673477.gal : 6 ms
[2022-05-19 05:58:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality992329662691755634.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms9545912793941278467;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12666044763192673477.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality992329662691755634.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
Loading property file /tmp/ReachabilityCardinality992329662691755634.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2 after 4
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13352713506433537592
[2022-05-19 05:58:17] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13352713506433537592
Running compilation step : cd /tmp/ltsmin13352713506433537592;'/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 1880 ms.
Running link step : cd /tmp/ltsmin13352713506433537592;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin13352713506433537592;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf1==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (OR (NOT p2) (NOT p1))), (X (NOT (AND p2 p0 p1))), (X (X p1)), (X (X (OR (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 626 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 538 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1)]
// Phase 1: matrix 2082 rows 2122 cols
[2022-05-19 05:58:34] [INFO ] Computed 361 place invariants in 8 ms
[2022-05-19 05:58:35] [INFO ] [Real]Absence check using 361 positive place invariants in 472 ms returned sat
[2022-05-19 05:58:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 05:58:49] [INFO ] [Real]Absence check using state equation in 13508 ms returned unknown
Could not prove EG (NOT p2)
Support contains 6 out of 2122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2122/2122 places, 2082/2082 transitions.
Applied a total of 0 rules in 62 ms. Remains 2122 /2122 variables (removed 0) and now considering 2082/2082 (removed 0) transitions.
// Phase 1: matrix 2082 rows 2122 cols
[2022-05-19 05:58:49] [INFO ] Computed 361 place invariants in 13 ms
[2022-05-19 05:58:50] [INFO ] Implicit Places using invariants in 643 ms returned []
// Phase 1: matrix 2082 rows 2122 cols
[2022-05-19 05:58:50] [INFO ] Computed 361 place invariants in 10 ms
[2022-05-19 05:58:52] [INFO ] Implicit Places using invariants and state equation in 2116 ms returned []
Implicit Place search using SMT with State Equation took 2767 ms to find 0 implicit places.
// Phase 1: matrix 2082 rows 2122 cols
[2022-05-19 05:58:52] [INFO ] Computed 361 place invariants in 8 ms
[2022-05-19 05:58:53] [INFO ] Dead Transitions using invariants and state equation in 1181 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2122/2122 places, 2082/2082 transitions.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (OR (NOT p2) (NOT p1))), (X (NOT (AND p2 p0 p1))), (X (X p1)), (X (X (OR (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 946 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2082 rows 2122 cols
[2022-05-19 05:58:54] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 05:58:55] [INFO ] [Real]Absence check using 361 positive place invariants in 113 ms returned sat
[2022-05-19 05:58:56] [INFO ] After 1523ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-19 05:58:56] [INFO ] [Nat]Absence check using 361 positive place invariants in 119 ms returned sat
[2022-05-19 05:58:57] [INFO ] After 1087ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-19 05:58:58] [INFO ] Deduced a trap composed of 17 places in 482 ms of which 1 ms to minimize.
[2022-05-19 05:58:58] [INFO ] Deduced a trap composed of 26 places in 458 ms of which 1 ms to minimize.
[2022-05-19 05:58:59] [INFO ] Deduced a trap composed of 17 places in 465 ms of which 2 ms to minimize.
[2022-05-19 05:59:00] [INFO ] Deduced a trap composed of 20 places in 444 ms of which 1 ms to minimize.
[2022-05-19 05:59:00] [INFO ] Deduced a trap composed of 16 places in 452 ms of which 1 ms to minimize.
[2022-05-19 05:59:01] [INFO ] Deduced a trap composed of 13 places in 419 ms of which 1 ms to minimize.
[2022-05-19 05:59:01] [INFO ] Deduced a trap composed of 21 places in 399 ms of which 1 ms to minimize.
[2022-05-19 05:59:02] [INFO ] Deduced a trap composed of 27 places in 412 ms of which 1 ms to minimize.
[2022-05-19 05:59:02] [INFO ] Deduced a trap composed of 21 places in 395 ms of which 1 ms to minimize.
[2022-05-19 05:59:02] [INFO ] Deduced a trap composed of 20 places in 401 ms of which 1 ms to minimize.
[2022-05-19 05:59:03] [INFO ] Deduced a trap composed of 21 places in 416 ms of which 1 ms to minimize.
[2022-05-19 05:59:03] [INFO ] Deduced a trap composed of 19 places in 386 ms of which 1 ms to minimize.
[2022-05-19 05:59:04] [INFO ] Deduced a trap composed of 18 places in 389 ms of which 1 ms to minimize.
[2022-05-19 05:59:04] [INFO ] Deduced a trap composed of 28 places in 388 ms of which 1 ms to minimize.
[2022-05-19 05:59:05] [INFO ] Deduced a trap composed of 23 places in 378 ms of which 1 ms to minimize.
[2022-05-19 05:59:05] [INFO ] Deduced a trap composed of 37 places in 406 ms of which 1 ms to minimize.
[2022-05-19 05:59:06] [INFO ] Deduced a trap composed of 27 places in 390 ms of which 1 ms to minimize.
[2022-05-19 05:59:06] [INFO ] Deduced a trap composed of 21 places in 400 ms of which 1 ms to minimize.
[2022-05-19 05:59:07] [INFO ] Deduced a trap composed of 21 places in 394 ms of which 1 ms to minimize.
[2022-05-19 05:59:07] [INFO ] Deduced a trap composed of 34 places in 395 ms of which 1 ms to minimize.
[2022-05-19 05:59:08] [INFO ] Deduced a trap composed of 37 places in 383 ms of which 1 ms to minimize.
[2022-05-19 05:59:08] [INFO ] Deduced a trap composed of 23 places in 363 ms of which 1 ms to minimize.
[2022-05-19 05:59:08] [INFO ] Deduced a trap composed of 29 places in 388 ms of which 1 ms to minimize.
[2022-05-19 05:59:09] [INFO ] Deduced a trap composed of 23 places in 382 ms of which 1 ms to minimize.
[2022-05-19 05:59:09] [INFO ] Deduced a trap composed of 36 places in 380 ms of which 2 ms to minimize.
[2022-05-19 05:59:10] [INFO ] Deduced a trap composed of 27 places in 378 ms of which 1 ms to minimize.
[2022-05-19 05:59:10] [INFO ] Deduced a trap composed of 25 places in 371 ms of which 1 ms to minimize.
[2022-05-19 05:59:11] [INFO ] Deduced a trap composed of 17 places in 401 ms of which 1 ms to minimize.
[2022-05-19 05:59:11] [INFO ] Deduced a trap composed of 34 places in 350 ms of which 1 ms to minimize.
[2022-05-19 05:59:12] [INFO ] Deduced a trap composed of 30 places in 347 ms of which 1 ms to minimize.
[2022-05-19 05:59:12] [INFO ] Deduced a trap composed of 27 places in 338 ms of which 1 ms to minimize.
[2022-05-19 05:59:12] [INFO ] Deduced a trap composed of 45 places in 374 ms of which 1 ms to minimize.
[2022-05-19 05:59:13] [INFO ] Deduced a trap composed of 27 places in 364 ms of which 1 ms to minimize.
[2022-05-19 05:59:13] [INFO ] Deduced a trap composed of 19 places in 372 ms of which 1 ms to minimize.
[2022-05-19 05:59:14] [INFO ] Deduced a trap composed of 29 places in 358 ms of which 1 ms to minimize.
[2022-05-19 05:59:14] [INFO ] Deduced a trap composed of 35 places in 335 ms of which 1 ms to minimize.
[2022-05-19 05:59:15] [INFO ] Deduced a trap composed of 38 places in 328 ms of which 0 ms to minimize.
[2022-05-19 05:59:15] [INFO ] Deduced a trap composed of 34 places in 327 ms of which 1 ms to minimize.
[2022-05-19 05:59:15] [INFO ] Deduced a trap composed of 45 places in 328 ms of which 1 ms to minimize.
[2022-05-19 05:59:16] [INFO ] Deduced a trap composed of 36 places in 313 ms of which 1 ms to minimize.
[2022-05-19 05:59:16] [INFO ] Deduced a trap composed of 27 places in 306 ms of which 1 ms to minimize.
[2022-05-19 05:59:17] [INFO ] Deduced a trap composed of 55 places in 306 ms of which 1 ms to minimize.
[2022-05-19 05:59:17] [INFO ] Deduced a trap composed of 46 places in 298 ms of which 1 ms to minimize.
[2022-05-19 05:59:17] [INFO ] Deduced a trap composed of 33 places in 308 ms of which 1 ms to minimize.
[2022-05-19 05:59:18] [INFO ] Deduced a trap composed of 31 places in 287 ms of which 1 ms to minimize.
[2022-05-19 05:59:18] [INFO ] Deduced a trap composed of 47 places in 286 ms of which 0 ms to minimize.
[2022-05-19 05:59:18] [INFO ] Deduced a trap composed of 35 places in 302 ms of which 1 ms to minimize.
[2022-05-19 05:59:19] [INFO ] Deduced a trap composed of 44 places in 293 ms of which 1 ms to minimize.
[2022-05-19 05:59:19] [INFO ] Deduced a trap composed of 40 places in 290 ms of which 1 ms to minimize.
[2022-05-19 05:59:19] [INFO ] Deduced a trap composed of 36 places in 270 ms of which 1 ms to minimize.
[2022-05-19 05:59:20] [INFO ] Deduced a trap composed of 34 places in 275 ms of which 1 ms to minimize.
[2022-05-19 05:59:20] [INFO ] Deduced a trap composed of 46 places in 279 ms of which 1 ms to minimize.
[2022-05-19 05:59:20] [INFO ] Deduced a trap composed of 45 places in 285 ms of which 1 ms to minimize.
[2022-05-19 05:59:21] [INFO ] Deduced a trap composed of 33 places in 292 ms of which 1 ms to minimize.
[2022-05-19 05:59:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 05:59:21] [INFO ] After 25153ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 203 ms.
Support contains 6 out of 2122 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2122/2122 places, 2082/2082 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 2122 transition count 1882
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 1922 transition count 1882
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 202 Pre rules applied. Total rules applied 400 place count 1922 transition count 1680
Deduced a syphon composed of 202 places in 3 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 2 with 404 rules applied. Total rules applied 804 place count 1720 transition count 1680
Performed 712 Post agglomeration using F-continuation condition.Transition count delta: 712
Deduced a syphon composed of 712 places in 2 ms
Reduce places removed 712 places and 0 transitions.
Iterating global reduction 2 with 1424 rules applied. Total rules applied 2228 place count 1008 transition count 968
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 273 times.
Drop transitions removed 273 transitions
Iterating global reduction 2 with 273 rules applied. Total rules applied 2501 place count 1008 transition count 968
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2502 place count 1007 transition count 967
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2503 place count 1006 transition count 967
Applied a total of 2503 rules in 215 ms. Remains 1006 /2122 variables (removed 1116) and now considering 967/2082 (removed 1115) transitions.
Finished structural reductions, in 1 iterations. Remains : 1006/2122 places, 967/2082 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 967 rows 1006 cols
[2022-05-19 05:59:21] [INFO ] Computed 360 place invariants in 12 ms
[2022-05-19 05:59:22] [INFO ] [Real]Absence check using 357 positive place invariants in 49 ms returned sat
[2022-05-19 05:59:22] [INFO ] [Real]Absence check using 357 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 05:59:22] [INFO ] After 541ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 05:59:22] [INFO ] [Nat]Absence check using 357 positive place invariants in 55 ms returned sat
[2022-05-19 05:59:22] [INFO ] [Nat]Absence check using 357 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 05:59:23] [INFO ] After 394ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 05:59:23] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 0 ms to minimize.
[2022-05-19 05:59:23] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 0 ms to minimize.
[2022-05-19 05:59:23] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2022-05-19 05:59:23] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2022-05-19 05:59:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 334 ms
[2022-05-19 05:59:23] [INFO ] After 762ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2022-05-19 05:59:23] [INFO ] After 1005ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 6 out of 1006 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1006/1006 places, 967/967 transitions.
Applied a total of 0 rules in 17 ms. Remains 1006 /1006 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1006/1006 places, 967/967 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 200941 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 200941 steps, saw 170676 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 967 rows 1006 cols
[2022-05-19 05:59:26] [INFO ] Computed 360 place invariants in 6 ms
[2022-05-19 05:59:26] [INFO ] [Real]Absence check using 357 positive place invariants in 48 ms returned sat
[2022-05-19 05:59:26] [INFO ] [Real]Absence check using 357 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 05:59:27] [INFO ] After 525ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 05:59:27] [INFO ] [Nat]Absence check using 357 positive place invariants in 48 ms returned sat
[2022-05-19 05:59:27] [INFO ] [Nat]Absence check using 357 positive and 3 generalized place invariants in 0 ms returned sat
[2022-05-19 05:59:27] [INFO ] After 347ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 05:59:27] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2022-05-19 05:59:27] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 0 ms to minimize.
[2022-05-19 05:59:27] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2022-05-19 05:59:28] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2022-05-19 05:59:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 339 ms
[2022-05-19 05:59:28] [INFO ] After 714ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2022-05-19 05:59:28] [INFO ] After 914ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 6 out of 1006 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1006/1006 places, 967/967 transitions.
Applied a total of 0 rules in 21 ms. Remains 1006 /1006 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1006/1006 places, 967/967 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1006/1006 places, 967/967 transitions.
Applied a total of 0 rules in 21 ms. Remains 1006 /1006 variables (removed 0) and now considering 967/967 (removed 0) transitions.
// Phase 1: matrix 967 rows 1006 cols
[2022-05-19 05:59:28] [INFO ] Computed 360 place invariants in 12 ms
[2022-05-19 05:59:28] [INFO ] Implicit Places using invariants in 530 ms returned []
// Phase 1: matrix 967 rows 1006 cols
[2022-05-19 05:59:28] [INFO ] Computed 360 place invariants in 4 ms
[2022-05-19 05:59:29] [INFO ] Implicit Places using invariants and state equation in 1153 ms returned []
Implicit Place search using SMT with State Equation took 1685 ms to find 0 implicit places.
[2022-05-19 05:59:29] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 967 rows 1006 cols
[2022-05-19 05:59:29] [INFO ] Computed 360 place invariants in 9 ms
[2022-05-19 05:59:30] [INFO ] Dead Transitions using invariants and state equation in 455 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1006/1006 places, 967/967 transitions.
Applied a total of 0 rules in 17 ms. Remains 1006 /1006 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 967 rows 1006 cols
[2022-05-19 05:59:30] [INFO ] Computed 360 place invariants in 7 ms
[2022-05-19 05:59:30] [INFO ] [Real]Absence check using 357 positive place invariants in 51 ms returned sat
[2022-05-19 05:59:30] [INFO ] [Real]Absence check using 357 positive and 3 generalized place invariants in 0 ms returned sat
[2022-05-19 05:59:30] [INFO ] After 550ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 05:59:31] [INFO ] [Nat]Absence check using 357 positive place invariants in 54 ms returned sat
[2022-05-19 05:59:31] [INFO ] [Nat]Absence check using 357 positive and 3 generalized place invariants in 0 ms returned sat
[2022-05-19 05:59:31] [INFO ] After 383ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 05:59:31] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 0 ms to minimize.
[2022-05-19 05:59:31] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 0 ms to minimize.
[2022-05-19 05:59:31] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2022-05-19 05:59:31] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2022-05-19 05:59:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 342 ms
[2022-05-19 05:59:31] [INFO ] After 754ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2022-05-19 05:59:31] [INFO ] After 990ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-19 05:59:31] [INFO ] Flatten gal took : 34 ms
[2022-05-19 05:59:31] [INFO ] Flatten gal took : 34 ms
[2022-05-19 05:59:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11541234538852028010.gal : 6 ms
[2022-05-19 05:59:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1297598001400547283.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms4498451483039176133;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11541234538852028010.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1297598001400547283.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality1297598001400547283.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 8
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :8 after 144
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :144 after 352
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :352 after 436
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :436 after 693
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :693 after 2897
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2897 after 13329
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :13329 after 215655
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :215655 after 5.38295e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :5.38295e+06 after 1.28717e+08
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.28717e+08 after 1.25331e+10
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.25331e+10 after 2.68126e+10
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :2.68126e+10 after 5.73911e+11
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :5.73911e+11 after 6.88547e+13
Detected timeout of ITS tools.
[2022-05-19 05:59:47] [INFO ] Flatten gal took : 34 ms
[2022-05-19 05:59:47] [INFO ] Applying decomposition
[2022-05-19 05:59:47] [INFO ] Flatten gal took : 34 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/graph9265216897236574024.txt' '-o' '/tmp/graph9265216897236574024.bin' '-w' '/tmp/graph9265216897236574024.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9265216897236574024.bin' '-l' '-1' '-v' '-w' '/tmp/graph9265216897236574024.weights' '-q' '0' '-e' '0.001'
[2022-05-19 05:59:47] [INFO ] Decomposing Gal with order
[2022-05-19 05:59:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 05:59:47] [INFO ] Removed a total of 767 redundant transitions.
[2022-05-19 05:59:47] [INFO ] Flatten gal took : 58 ms
[2022-05-19 05:59:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 995 labels/synchronizations in 14 ms.
[2022-05-19 05:59:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality485537772064836630.gal : 6 ms
[2022-05-19 05:59:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16986112414141867566.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms4498451483039176133;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality485537772064836630.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16986112414141867566.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
Loading property file /tmp/ReachabilityCardinality16986112414141867566.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2 after 8
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14332924718203124403
[2022-05-19 06:00:02] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14332924718203124403
Running compilation step : cd /tmp/ltsmin14332924718203124403;'/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 1723 ms.
Running link step : cd /tmp/ltsmin14332924718203124403;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin14332924718203124403;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf1==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (OR (NOT p2) (NOT p1))), (X (NOT (AND p2 p0 p1))), (X (X p1)), (X (X (OR (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 317 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1)]
// Phase 1: matrix 2082 rows 2122 cols
[2022-05-19 06:00:18] [INFO ] Computed 361 place invariants in 10 ms
[2022-05-19 06:00:19] [INFO ] [Real]Absence check using 361 positive place invariants in 473 ms returned sat
[2022-05-19 06:00:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 06:00:32] [INFO ] [Real]Absence check using state equation in 13313 ms returned sat
[2022-05-19 06:00:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 06:00:34] [INFO ] [Nat]Absence check using 361 positive place invariants in 527 ms returned sat
[2022-05-19 06:00:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 06:00:47] [INFO ] [Nat]Absence check using state equation in 13458 ms returned unknown
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1)]
Product exploration explored 100000 steps with 26 reset in 814 ms.
Product exploration explored 100000 steps with 27 reset in 906 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 1678 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1)]
Support contains 6 out of 2122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2122/2122 places, 2082/2082 transitions.
Performed 199 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 2122 transition count 2082
Performed 82 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 82 Pre rules applied. Total rules applied 199 place count 2122 transition count 2084
Deduced a syphon composed of 281 places in 4 ms
Iterating global reduction 1 with 82 rules applied. Total rules applied 281 place count 2122 transition count 2084
Performed 833 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1114 places in 2 ms
Iterating global reduction 1 with 833 rules applied. Total rules applied 1114 place count 2122 transition count 2084
Renaming transitions due to excessive name length > 1024 char.
Discarding 281 places :
Symmetric choice reduction at 1 with 281 rule applications. Total rules 1395 place count 1841 transition count 1803
Deduced a syphon composed of 833 places in 1 ms
Iterating global reduction 1 with 281 rules applied. Total rules applied 1676 place count 1841 transition count 1803
Deduced a syphon composed of 833 places in 1 ms
Applied a total of 1676 rules in 431 ms. Remains 1841 /2122 variables (removed 281) and now considering 1803/2082 (removed 279) transitions.
[2022-05-19 06:00:52] [INFO ] Redundant transitions in 119 ms returned [1802]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1802 rows 1841 cols
[2022-05-19 06:00:52] [INFO ] Computed 361 place invariants in 15 ms
[2022-05-19 06:00:53] [INFO ] Dead Transitions using invariants and state equation in 971 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1841/2122 places, 1802/2082 transitions.
Deduced a syphon composed of 833 places in 1 ms
Applied a total of 0 rules in 49 ms. Remains 1841 /1841 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1841/2122 places, 1802/2082 transitions.
Product exploration explored 100000 steps with 62 reset in 765 ms.
Product exploration explored 100000 steps with 63 reset in 911 ms.
Built C files in :
/tmp/ltsmin2713828983370846302
[2022-05-19 06:00:54] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2713828983370846302
Running compilation step : cd /tmp/ltsmin2713828983370846302;'/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/ltsmin2713828983370846302;'/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/ltsmin2713828983370846302;'/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 6 out of 2122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2122/2122 places, 2082/2082 transitions.
Applied a total of 0 rules in 62 ms. Remains 2122 /2122 variables (removed 0) and now considering 2082/2082 (removed 0) transitions.
// Phase 1: matrix 2082 rows 2122 cols
[2022-05-19 06:00:57] [INFO ] Computed 361 place invariants in 15 ms
[2022-05-19 06:00:58] [INFO ] Implicit Places using invariants in 598 ms returned []
// Phase 1: matrix 2082 rows 2122 cols
[2022-05-19 06:00:58] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 06:01:00] [INFO ] Implicit Places using invariants and state equation in 2132 ms returned []
Implicit Place search using SMT with State Equation took 2731 ms to find 0 implicit places.
// Phase 1: matrix 2082 rows 2122 cols
[2022-05-19 06:01:00] [INFO ] Computed 361 place invariants in 13 ms
[2022-05-19 06:01:01] [INFO ] Dead Transitions using invariants and state equation in 1149 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2122/2122 places, 2082/2082 transitions.
Built C files in :
/tmp/ltsmin7602191293850937169
[2022-05-19 06:01:01] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7602191293850937169
Running compilation step : cd /tmp/ltsmin7602191293850937169;'/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/ltsmin7602191293850937169;'/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/ltsmin7602191293850937169;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-19 06:01:04] [INFO ] Flatten gal took : 58 ms
[2022-05-19 06:01:04] [INFO ] Flatten gal took : 54 ms
[2022-05-19 06:01:04] [INFO ] Time to serialize gal into /tmp/LTL5983544235074468886.gal : 6 ms
[2022-05-19 06:01:04] [INFO ] Time to serialize properties into /tmp/LTL15593212905386237650.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/LTL5983544235074468886.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15593212905386237650.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/LTL5983544...267
Read 1 LTL properties
Checking formula 0 : !((F((X(!(("((p939==1)&&(p964==1))")U(!("((!((p939==1)&&(p964==1)))||((p1308==1)&&(p1359==1)))")))))&&(X("((p300==1)&&(p378==1))")))))
Formula 0 simplified : !F(X!("((p939==1)&&(p964==1))" U !"((!((p939==1)&&(p964==1)))||((p1308==1)&&(p1359==1)))") & X"((p300==1)&&(p378==1))")
Detected timeout of ITS tools.
[2022-05-19 06:01:20] [INFO ] Flatten gal took : 53 ms
[2022-05-19 06:01:20] [INFO ] Applying decomposition
[2022-05-19 06:01:20] [INFO ] Flatten gal took : 53 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/graph8183684745683707160.txt' '-o' '/tmp/graph8183684745683707160.bin' '-w' '/tmp/graph8183684745683707160.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8183684745683707160.bin' '-l' '-1' '-v' '-w' '/tmp/graph8183684745683707160.weights' '-q' '0' '-e' '0.001'
[2022-05-19 06:01:20] [INFO ] Decomposing Gal with order
[2022-05-19 06:01:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 06:01:20] [INFO ] Removed a total of 920 redundant transitions.
[2022-05-19 06:01:20] [INFO ] Flatten gal took : 94 ms
[2022-05-19 06:01:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2022-05-19 06:01:20] [INFO ] Time to serialize gal into /tmp/LTL10997553740989039259.gal : 16 ms
[2022-05-19 06:01:20] [INFO ] Time to serialize properties into /tmp/LTL14739321412939667503.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/LTL10997553740989039259.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14739321412939667503.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/LTL1099755...247
Read 1 LTL properties
Checking formula 0 : !((F((X(!(("((i15.i3.u316.p939==1)&&(i15.i1.u324.p964==1))")U(!("((!((i15.i3.u316.p939==1)&&(i15.i1.u324.p964==1)))||((i21.i6.u442.p13...249
Formula 0 simplified : !F(X!("((i15.i3.u316.p939==1)&&(i15.i1.u324.p964==1))" U !"((!((i15.i3.u316.p939==1)&&(i15.i1.u324.p964==1)))||((i21.i6.u442.p1308==...236
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8890041211315454638
[2022-05-19 06:01:35] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8890041211315454638
Running compilation step : cd /tmp/ltsmin8890041211315454638;'/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/ltsmin8890041211315454638;'/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/ltsmin8890041211315454638;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldIIPs-PT-040B-LTLFireability-10 finished in 276516 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 2 out of 2134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2134/2134 places, 2094/2094 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 2123 transition count 2083
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 2123 transition count 2083
Applied a total of 22 rules in 141 ms. Remains 2123 /2134 variables (removed 11) and now considering 2083/2094 (removed 11) transitions.
// Phase 1: matrix 2083 rows 2123 cols
[2022-05-19 06:01:38] [INFO ] Computed 361 place invariants in 11 ms
[2022-05-19 06:01:39] [INFO ] Implicit Places using invariants in 642 ms returned []
// Phase 1: matrix 2083 rows 2123 cols
[2022-05-19 06:01:39] [INFO ] Computed 361 place invariants in 6 ms
[2022-05-19 06:01:41] [INFO ] Implicit Places using invariants and state equation in 2101 ms returned []
Implicit Place search using SMT with State Equation took 2748 ms to find 0 implicit places.
// Phase 1: matrix 2083 rows 2123 cols
[2022-05-19 06:01:41] [INFO ] Computed 361 place invariants in 13 ms
[2022-05-19 06:01:42] [INFO ] Dead Transitions using invariants and state equation in 1154 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2123/2134 places, 2083/2094 transitions.
Finished structural reductions, in 1 iterations. Remains : 2123/2134 places, 2083/2094 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s2110 1), p0:(EQ s1690 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 5532 steps with 3 reset in 40 ms.
FORMULA ShieldIIPs-PT-040B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040B-LTLFireability-11 finished in 4231 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F(p1))&&p0)))'
Support contains 3 out of 2134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2134/2134 places, 2094/2094 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 2123 transition count 2083
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 2123 transition count 2083
Applied a total of 22 rules in 131 ms. Remains 2123 /2134 variables (removed 11) and now considering 2083/2094 (removed 11) transitions.
// Phase 1: matrix 2083 rows 2123 cols
[2022-05-19 06:01:42] [INFO ] Computed 361 place invariants in 11 ms
[2022-05-19 06:01:43] [INFO ] Implicit Places using invariants in 647 ms returned []
// Phase 1: matrix 2083 rows 2123 cols
[2022-05-19 06:01:43] [INFO ] Computed 361 place invariants in 12 ms
[2022-05-19 06:01:45] [INFO ] Implicit Places using invariants and state equation in 2235 ms returned []
Implicit Place search using SMT with State Equation took 2885 ms to find 0 implicit places.
// Phase 1: matrix 2083 rows 2123 cols
[2022-05-19 06:01:45] [INFO ] Computed 361 place invariants in 11 ms
[2022-05-19 06:01:47] [INFO ] Dead Transitions using invariants and state equation in 1166 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2123/2134 places, 2083/2094 transitions.
Finished structural reductions, in 1 iterations. Remains : 2123/2134 places, 2083/2094 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s1947 1) (OR (NEQ s116 1) (NEQ s184 1))), p1:(OR (NEQ s116 1) (NEQ s184 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, 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 1370 ms.
Product exploration explored 100000 steps with 50000 reset in 1351 ms.
Computed a total of 480 stabilizing places and 480 stable transitions
Computed a total of 480 stabilizing places and 480 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 5 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldIIPs-PT-040B-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-040B-LTLFireability-12 finished in 7190 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(F(p0))||F(p1))) U G(p2)))'
Support contains 3 out of 2134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2134/2134 places, 2094/2094 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 2123 transition count 2083
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 2123 transition count 2083
Applied a total of 22 rules in 135 ms. Remains 2123 /2134 variables (removed 11) and now considering 2083/2094 (removed 11) transitions.
// Phase 1: matrix 2083 rows 2123 cols
[2022-05-19 06:01:50] [INFO ] Computed 361 place invariants in 12 ms
[2022-05-19 06:01:50] [INFO ] Implicit Places using invariants in 666 ms returned []
// Phase 1: matrix 2083 rows 2123 cols
[2022-05-19 06:01:50] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 06:01:53] [INFO ] Implicit Places using invariants and state equation in 2179 ms returned []
Implicit Place search using SMT with State Equation took 2847 ms to find 0 implicit places.
// Phase 1: matrix 2083 rows 2123 cols
[2022-05-19 06:01:53] [INFO ] Computed 361 place invariants in 6 ms
[2022-05-19 06:01:54] [INFO ] Dead Transitions using invariants and state equation in 1066 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2123/2134 places, 2083/2094 transitions.
Finished structural reductions, in 1 iterations. Remains : 2123/2134 places, 2083/2094 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s351 1) (EQ s2068 1)), p1:(EQ s351 1), p0:(EQ s1493 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 70 reset in 649 ms.
Product exploration explored 100000 steps with 73 reset in 704 ms.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 271 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 144 ms :[(NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2083 rows 2123 cols
[2022-05-19 06:01:56] [INFO ] Computed 361 place invariants in 8 ms
[2022-05-19 06:01:56] [INFO ] [Real]Absence check using 361 positive place invariants in 123 ms returned sat
[2022-05-19 06:01:57] [INFO ] After 1672ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-19 06:01:58] [INFO ] [Nat]Absence check using 361 positive place invariants in 116 ms returned sat
[2022-05-19 06:01:59] [INFO ] After 1090ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-19 06:02:00] [INFO ] Deduced a trap composed of 16 places in 532 ms of which 1 ms to minimize.
[2022-05-19 06:02:00] [INFO ] Deduced a trap composed of 19 places in 535 ms of which 2 ms to minimize.
[2022-05-19 06:02:01] [INFO ] Deduced a trap composed of 21 places in 519 ms of which 1 ms to minimize.
[2022-05-19 06:02:02] [INFO ] Deduced a trap composed of 18 places in 527 ms of which 1 ms to minimize.
[2022-05-19 06:02:02] [INFO ] Deduced a trap composed of 19 places in 547 ms of which 1 ms to minimize.
[2022-05-19 06:02:03] [INFO ] Deduced a trap composed of 31 places in 565 ms of which 1 ms to minimize.
[2022-05-19 06:02:03] [INFO ] Deduced a trap composed of 42 places in 560 ms of which 2 ms to minimize.
[2022-05-19 06:02:04] [INFO ] Deduced a trap composed of 32 places in 529 ms of which 2 ms to minimize.
[2022-05-19 06:02:05] [INFO ] Deduced a trap composed of 23 places in 528 ms of which 1 ms to minimize.
[2022-05-19 06:02:05] [INFO ] Deduced a trap composed of 34 places in 483 ms of which 1 ms to minimize.
[2022-05-19 06:02:06] [INFO ] Deduced a trap composed of 26 places in 510 ms of which 2 ms to minimize.
[2022-05-19 06:02:06] [INFO ] Deduced a trap composed of 24 places in 509 ms of which 1 ms to minimize.
[2022-05-19 06:02:07] [INFO ] Deduced a trap composed of 37 places in 532 ms of which 1 ms to minimize.
[2022-05-19 06:02:07] [INFO ] Deduced a trap composed of 32 places in 498 ms of which 2 ms to minimize.
[2022-05-19 06:02:08] [INFO ] Deduced a trap composed of 33 places in 499 ms of which 1 ms to minimize.
[2022-05-19 06:02:09] [INFO ] Deduced a trap composed of 26 places in 473 ms of which 1 ms to minimize.
[2022-05-19 06:02:09] [INFO ] Deduced a trap composed of 32 places in 511 ms of which 2 ms to minimize.
[2022-05-19 06:02:10] [INFO ] Deduced a trap composed of 20 places in 506 ms of which 2 ms to minimize.
[2022-05-19 06:02:10] [INFO ] Deduced a trap composed of 23 places in 486 ms of which 1 ms to minimize.
[2022-05-19 06:02:11] [INFO ] Deduced a trap composed of 25 places in 478 ms of which 2 ms to minimize.
[2022-05-19 06:02:11] [INFO ] Deduced a trap composed of 27 places in 471 ms of which 1 ms to minimize.
[2022-05-19 06:02:12] [INFO ] Deduced a trap composed of 21 places in 436 ms of which 2 ms to minimize.
[2022-05-19 06:02:12] [INFO ] Deduced a trap composed of 24 places in 434 ms of which 1 ms to minimize.
[2022-05-19 06:02:13] [INFO ] Deduced a trap composed of 34 places in 437 ms of which 2 ms to minimize.
[2022-05-19 06:02:13] [INFO ] Deduced a trap composed of 37 places in 427 ms of which 1 ms to minimize.
[2022-05-19 06:02:14] [INFO ] Deduced a trap composed of 21 places in 429 ms of which 1 ms to minimize.
[2022-05-19 06:02:14] [INFO ] Deduced a trap composed of 34 places in 419 ms of which 1 ms to minimize.
[2022-05-19 06:02:15] [INFO ] Deduced a trap composed of 30 places in 419 ms of which 1 ms to minimize.
[2022-05-19 06:02:15] [INFO ] Deduced a trap composed of 38 places in 386 ms of which 1 ms to minimize.
[2022-05-19 06:02:16] [INFO ] Deduced a trap composed of 36 places in 379 ms of which 2 ms to minimize.
[2022-05-19 06:02:16] [INFO ] Deduced a trap composed of 24 places in 372 ms of which 1 ms to minimize.
[2022-05-19 06:02:17] [INFO ] Deduced a trap composed of 46 places in 404 ms of which 1 ms to minimize.
[2022-05-19 06:02:17] [INFO ] Deduced a trap composed of 40 places in 406 ms of which 1 ms to minimize.
[2022-05-19 06:02:18] [INFO ] Deduced a trap composed of 48 places in 391 ms of which 1 ms to minimize.
[2022-05-19 06:02:18] [INFO ] Deduced a trap composed of 49 places in 392 ms of which 1 ms to minimize.
[2022-05-19 06:02:19] [INFO ] Deduced a trap composed of 50 places in 393 ms of which 1 ms to minimize.
[2022-05-19 06:02:19] [INFO ] Deduced a trap composed of 53 places in 369 ms of which 1 ms to minimize.
[2022-05-19 06:02:20] [INFO ] Deduced a trap composed of 23 places in 400 ms of which 1 ms to minimize.
[2022-05-19 06:02:20] [INFO ] Deduced a trap composed of 23 places in 355 ms of which 1 ms to minimize.
[2022-05-19 06:02:20] [INFO ] Deduced a trap composed of 26 places in 367 ms of which 1 ms to minimize.
[2022-05-19 06:02:21] [INFO ] Deduced a trap composed of 34 places in 362 ms of which 2 ms to minimize.
[2022-05-19 06:02:21] [INFO ] Deduced a trap composed of 29 places in 378 ms of which 1 ms to minimize.
[2022-05-19 06:02:22] [INFO ] Deduced a trap composed of 34 places in 354 ms of which 2 ms to minimize.
[2022-05-19 06:02:22] [INFO ] Deduced a trap composed of 45 places in 329 ms of which 1 ms to minimize.
[2022-05-19 06:02:23] [INFO ] Deduced a trap composed of 41 places in 347 ms of which 1 ms to minimize.
[2022-05-19 06:02:23] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 06:02:23] [INFO ] After 25106ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 125 ms.
Support contains 2 out of 2123 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2123/2123 places, 2083/2083 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 2123 transition count 1882
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1922 transition count 1882
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 402 place count 1922 transition count 1681
Deduced a syphon composed of 201 places in 4 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 804 place count 1721 transition count 1681
Performed 719 Post agglomeration using F-continuation condition.Transition count delta: 719
Deduced a syphon composed of 719 places in 2 ms
Reduce places removed 719 places and 0 transitions.
Iterating global reduction 2 with 1438 rules applied. Total rules applied 2242 place count 1002 transition count 962
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 277 times.
Drop transitions removed 277 transitions
Iterating global reduction 2 with 277 rules applied. Total rules applied 2519 place count 1002 transition count 962
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2520 place count 1001 transition count 961
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2521 place count 1000 transition count 961
Applied a total of 2521 rules in 238 ms. Remains 1000 /2123 variables (removed 1123) and now considering 961/2083 (removed 1122) transitions.
Finished structural reductions, in 1 iterations. Remains : 1000/2123 places, 961/2083 transitions.
Finished random walk after 2602 steps, including 0 resets, run visited all 3 properties in 54 ms. (steps per millisecond=48 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p2), (F (NOT (AND (NOT p2) (NOT p1)))), (F p1)]
Knowledge based reduction with 8 factoid took 315 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 138 ms :[(NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 137 ms :[(NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 2083 rows 2123 cols
[2022-05-19 06:02:24] [INFO ] Computed 361 place invariants in 12 ms
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p2), (F (NOT (AND (NOT p2) (NOT p1)))), (F p1), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 8 factoid took 725 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 1 states, 1 edges and 0 AP.
FORMULA ShieldIIPs-PT-040B-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-040B-LTLFireability-13 finished in 35822 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 2134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2134/2134 places, 2094/2094 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 2123 transition count 2083
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 2123 transition count 2083
Applied a total of 22 rules in 140 ms. Remains 2123 /2134 variables (removed 11) and now considering 2083/2094 (removed 11) transitions.
// Phase 1: matrix 2083 rows 2123 cols
[2022-05-19 06:02:25] [INFO ] Computed 361 place invariants in 12 ms
[2022-05-19 06:02:26] [INFO ] Implicit Places using invariants in 625 ms returned []
// Phase 1: matrix 2083 rows 2123 cols
[2022-05-19 06:02:26] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 06:02:28] [INFO ] Implicit Places using invariants and state equation in 2140 ms returned []
Implicit Place search using SMT with State Equation took 2766 ms to find 0 implicit places.
// Phase 1: matrix 2083 rows 2123 cols
[2022-05-19 06:02:28] [INFO ] Computed 361 place invariants in 4 ms
[2022-05-19 06:02:29] [INFO ] Dead Transitions using invariants and state equation in 1119 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2123/2134 places, 2083/2094 transitions.
Finished structural reductions, in 1 iterations. Remains : 2123/2134 places, 2083/2094 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s852 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 5136 steps with 0 reset in 48 ms.
FORMULA ShieldIIPs-PT-040B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040B-LTLFireability-14 finished in 4164 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(X(G(p0)))&&p1))))'
Support contains 5 out of 2134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2134/2134 places, 2094/2094 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 2133 transition count 1894
Reduce places removed 199 places and 0 transitions.
Iterating post reduction 1 with 199 rules applied. Total rules applied 398 place count 1934 transition count 1894
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 398 place count 1934 transition count 1694
Deduced a syphon composed of 200 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 798 place count 1734 transition count 1694
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 809 place count 1723 transition count 1683
Iterating global reduction 2 with 11 rules applied. Total rules applied 820 place count 1723 transition count 1683
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 820 place count 1723 transition count 1678
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 830 place count 1718 transition count 1678
Performed 712 Post agglomeration using F-continuation condition.Transition count delta: 712
Deduced a syphon composed of 712 places in 2 ms
Reduce places removed 712 places and 0 transitions.
Iterating global reduction 2 with 1424 rules applied. Total rules applied 2254 place count 1006 transition count 966
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2256 place count 1004 transition count 964
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2257 place count 1003 transition count 964
Applied a total of 2257 rules in 296 ms. Remains 1003 /2134 variables (removed 1131) and now considering 964/2094 (removed 1130) transitions.
// Phase 1: matrix 964 rows 1003 cols
[2022-05-19 06:02:30] [INFO ] Computed 360 place invariants in 4 ms
[2022-05-19 06:02:30] [INFO ] Implicit Places using invariants in 432 ms returned []
// Phase 1: matrix 964 rows 1003 cols
[2022-05-19 06:02:30] [INFO ] Computed 360 place invariants in 3 ms
[2022-05-19 06:02:31] [INFO ] Implicit Places using invariants and state equation in 964 ms returned []
Implicit Place search using SMT with State Equation took 1396 ms to find 0 implicit places.
[2022-05-19 06:02:31] [INFO ] Redundant transitions in 90 ms returned [963]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 963 rows 1003 cols
[2022-05-19 06:02:31] [INFO ] Computed 360 place invariants in 5 ms
[2022-05-19 06:02:32] [INFO ] Dead Transitions using invariants and state equation in 464 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1003/2134 places, 963/2094 transitions.
Applied a total of 0 rules in 17 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1003/2134 places, 963/2094 transitions.
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s795 1) (AND (EQ s610 1) (EQ s617 1) (EQ s628 1))), p0:(EQ s777 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2058 steps with 0 reset in 20 ms.
FORMULA ShieldIIPs-PT-040B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040B-LTLFireability-15 finished in 2428 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(X(X(p0)))||G(p1)))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(F(G((F(p1)||p1)))&&p2))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((X(F(p0))||F(G(p1))))))'
Found a CL insensitive property : ShieldIIPs-PT-040B-LTLFireability-08
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 2134 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 2134/2134 places, 2094/2094 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 2133 transition count 1892
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1932 transition count 1892
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 402 place count 1932 transition count 1692
Deduced a syphon composed of 200 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 802 place count 1732 transition count 1692
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 814 place count 1720 transition count 1680
Iterating global reduction 2 with 12 rules applied. Total rules applied 826 place count 1720 transition count 1680
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 826 place count 1720 transition count 1675
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 836 place count 1715 transition count 1675
Performed 708 Post agglomeration using F-continuation condition.Transition count delta: 708
Deduced a syphon composed of 708 places in 2 ms
Reduce places removed 708 places and 0 transitions.
Iterating global reduction 2 with 1416 rules applied. Total rules applied 2252 place count 1007 transition count 967
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2254 place count 1005 transition count 965
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2255 place count 1004 transition count 965
Applied a total of 2255 rules in 316 ms. Remains 1004 /2134 variables (removed 1130) and now considering 965/2094 (removed 1129) transitions.
// Phase 1: matrix 965 rows 1004 cols
[2022-05-19 06:02:33] [INFO ] Computed 360 place invariants in 3 ms
[2022-05-19 06:02:33] [INFO ] Implicit Places using invariants in 420 ms returned []
// Phase 1: matrix 965 rows 1004 cols
[2022-05-19 06:02:33] [INFO ] Computed 360 place invariants in 2 ms
[2022-05-19 06:02:34] [INFO ] Implicit Places using invariants and state equation in 970 ms returned []
Implicit Place search using SMT with State Equation took 1394 ms to find 0 implicit places.
// Phase 1: matrix 965 rows 1004 cols
[2022-05-19 06:02:34] [INFO ] Computed 360 place invariants in 1 ms
[2022-05-19 06:02:34] [INFO ] Dead Transitions using invariants and state equation in 451 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 1004/2134 places, 965/2094 transitions.
Finished structural reductions, in 1 iterations. Remains : 1004/2134 places, 965/2094 transitions.
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(EQ s128 0), p0:(OR (EQ s928 1) (AND (EQ s485 1) (EQ s500 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1909 reset in 631 ms.
Product exploration explored 100000 steps with 1918 reset in 787 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/1004 stabilizing places and 2/965 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 2 factoid took 159 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 2 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p1 (NOT p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 145 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 1004 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1004/1004 places, 965/965 transitions.
Applied a total of 0 rules in 11 ms. Remains 1004 /1004 variables (removed 0) and now considering 965/965 (removed 0) transitions.
// Phase 1: matrix 965 rows 1004 cols
[2022-05-19 06:02:37] [INFO ] Computed 360 place invariants in 3 ms
[2022-05-19 06:02:37] [INFO ] Implicit Places using invariants in 412 ms returned []
// Phase 1: matrix 965 rows 1004 cols
[2022-05-19 06:02:37] [INFO ] Computed 360 place invariants in 2 ms
[2022-05-19 06:02:38] [INFO ] Implicit Places using invariants and state equation in 949 ms returned []
Implicit Place search using SMT with State Equation took 1363 ms to find 0 implicit places.
// Phase 1: matrix 965 rows 1004 cols
[2022-05-19 06:02:38] [INFO ] Computed 360 place invariants in 2 ms
[2022-05-19 06:02:38] [INFO ] Dead Transitions using invariants and state equation in 436 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1004/1004 places, 965/965 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/1004 stabilizing places and 2/965 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 151 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 2 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 195 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1917 reset in 665 ms.
Product exploration explored 100000 steps with 1914 reset in 785 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 1004 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1004/1004 places, 965/965 transitions.
Applied a total of 0 rules in 18 ms. Remains 1004 /1004 variables (removed 0) and now considering 965/965 (removed 0) transitions.
[2022-05-19 06:02:41] [INFO ] Redundant transitions in 96 ms returned [964]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 964 rows 1004 cols
[2022-05-19 06:02:41] [INFO ] Computed 360 place invariants in 2 ms
[2022-05-19 06:02:41] [INFO ] Dead Transitions using invariants and state equation in 443 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1004/1004 places, 964/965 transitions.
Applied a total of 0 rules in 20 ms. Remains 1004 /1004 variables (removed 0) and now considering 964/964 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1004/1004 places, 964/965 transitions.
Product exploration explored 100000 steps with 1918 reset in 919 ms.
Product exploration explored 100000 steps with 1917 reset in 1073 ms.
Built C files in :
/tmp/ltsmin1436669187289419502
[2022-05-19 06:02:43] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1436669187289419502
Running compilation step : cd /tmp/ltsmin1436669187289419502;'/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 1665 ms.
Running link step : cd /tmp/ltsmin1436669187289419502;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin1436669187289419502;'/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/stateBased4701521377371826173.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 1004 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1004/1004 places, 965/965 transitions.
Applied a total of 0 rules in 21 ms. Remains 1004 /1004 variables (removed 0) and now considering 965/965 (removed 0) transitions.
// Phase 1: matrix 965 rows 1004 cols
[2022-05-19 06:02:58] [INFO ] Computed 360 place invariants in 5 ms
[2022-05-19 06:02:59] [INFO ] Implicit Places using invariants in 441 ms returned []
// Phase 1: matrix 965 rows 1004 cols
[2022-05-19 06:02:59] [INFO ] Computed 360 place invariants in 1 ms
[2022-05-19 06:03:00] [INFO ] Implicit Places using invariants and state equation in 969 ms returned []
Implicit Place search using SMT with State Equation took 1410 ms to find 0 implicit places.
// Phase 1: matrix 965 rows 1004 cols
[2022-05-19 06:03:00] [INFO ] Computed 360 place invariants in 3 ms
[2022-05-19 06:03:00] [INFO ] Dead Transitions using invariants and state equation in 453 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1004/1004 places, 965/965 transitions.
Built C files in :
/tmp/ltsmin2758212792262326269
[2022-05-19 06:03:00] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2758212792262326269
Running compilation step : cd /tmp/ltsmin2758212792262326269;'/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 1702 ms.
Running link step : cd /tmp/ltsmin2758212792262326269;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin2758212792262326269;'/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/stateBased14017108965024282607.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 06:03:15] [INFO ] Flatten gal took : 32 ms
[2022-05-19 06:03:15] [INFO ] Flatten gal took : 32 ms
[2022-05-19 06:03:15] [INFO ] Time to serialize gal into /tmp/LTL317417656456143455.gal : 3 ms
[2022-05-19 06:03:15] [INFO ] Time to serialize properties into /tmp/LTL5447641758237351016.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/LTL317417656456143455.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5447641758237351016.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/LTL3174176...265
Read 1 LTL properties
Checking formula 0 : !((F(X((X(F("((p2218==1)||((p1180==1)&&(p1208==1)))")))||(F(G("(p345==0)")))))))
Formula 0 simplified : !FX(XF"((p2218==1)||((p1180==1)&&(p1208==1)))" | FG"(p345==0)")
Detected timeout of ITS tools.
[2022-05-19 06:03:31] [INFO ] Flatten gal took : 31 ms
[2022-05-19 06:03:31] [INFO ] Applying decomposition
[2022-05-19 06:03:31] [INFO ] Flatten gal took : 32 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/graph17473130160921393501.txt' '-o' '/tmp/graph17473130160921393501.bin' '-w' '/tmp/graph17473130160921393501.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17473130160921393501.bin' '-l' '-1' '-v' '-w' '/tmp/graph17473130160921393501.weights' '-q' '0' '-e' '0.001'
[2022-05-19 06:03:31] [INFO ] Decomposing Gal with order
[2022-05-19 06:03:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 06:03:31] [INFO ] Removed a total of 638 redundant transitions.
[2022-05-19 06:03:31] [INFO ] Flatten gal took : 48 ms
[2022-05-19 06:03:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 634 labels/synchronizations in 9 ms.
[2022-05-19 06:03:31] [INFO ] Time to serialize gal into /tmp/LTL5628672390785745090.gal : 6 ms
[2022-05-19 06:03:31] [INFO ] Time to serialize properties into /tmp/LTL6689516005973128344.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/LTL5628672390785745090.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6689516005973128344.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/LTL5628672...245
Read 1 LTL properties
Checking formula 0 : !((F(X((X(F("((i36.i1.u335.p2218==1)||((i19.i0.u175.p1180==1)&&(i19.i1.u181.p1208==1)))")))||(F(G("(i5.i0.u46.p345==0)")))))))
Formula 0 simplified : !FX(XF"((i36.i1.u335.p2218==1)||((i19.i0.u175.p1180==1)&&(i19.i1.u181.p1208==1)))" | FG"(i5.i0.u46.p345==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16989218156039426984
[2022-05-19 06:03:46] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16989218156039426984
Running compilation step : cd /tmp/ltsmin16989218156039426984;'/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 1683 ms.
Running link step : cd /tmp/ltsmin16989218156039426984;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin16989218156039426984;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X((X(<>((LTLAPp0==true)))||<>([]((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-040B-LTLFireability-08 finished in 88803 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(!(p0 U !p1))&&X(p2))))'
Found a CL insensitive property : ShieldIIPs-PT-040B-LTLFireability-10
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1)]
Support contains 6 out of 2134 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 2134/2134 places, 2094/2094 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 2133 transition count 1893
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 1933 transition count 1893
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 202 Pre rules applied. Total rules applied 400 place count 1933 transition count 1691
Deduced a syphon composed of 202 places in 3 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 2 with 404 rules applied. Total rules applied 804 place count 1731 transition count 1691
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 816 place count 1719 transition count 1679
Iterating global reduction 2 with 12 rules applied. Total rules applied 828 place count 1719 transition count 1679
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 828 place count 1719 transition count 1674
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 838 place count 1714 transition count 1674
Performed 705 Post agglomeration using F-continuation condition.Transition count delta: 705
Deduced a syphon composed of 705 places in 2 ms
Reduce places removed 705 places and 0 transitions.
Iterating global reduction 2 with 1410 rules applied. Total rules applied 2248 place count 1009 transition count 969
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2250 place count 1007 transition count 967
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2251 place count 1006 transition count 967
Applied a total of 2251 rules in 274 ms. Remains 1006 /2134 variables (removed 1128) and now considering 967/2094 (removed 1127) transitions.
// Phase 1: matrix 967 rows 1006 cols
[2022-05-19 06:04:01] [INFO ] Computed 360 place invariants in 2 ms
[2022-05-19 06:04:02] [INFO ] Implicit Places using invariants in 429 ms returned []
// Phase 1: matrix 967 rows 1006 cols
[2022-05-19 06:04:02] [INFO ] Computed 360 place invariants in 2 ms
[2022-05-19 06:04:03] [INFO ] Implicit Places using invariants and state equation in 1044 ms returned []
Implicit Place search using SMT with State Equation took 1474 ms to find 0 implicit places.
// Phase 1: matrix 967 rows 1006 cols
[2022-05-19 06:04:03] [INFO ] Computed 360 place invariants in 4 ms
[2022-05-19 06:04:03] [INFO ] Dead Transitions using invariants and state equation in 484 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 1006/2134 places, 967/2094 transitions.
Finished structural reductions, in 1 iterations. Remains : 1006/2134 places, 967/2094 transitions.
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s112 1) (EQ s147 1)), p1:(OR (NOT (AND (EQ s383 1) (EQ s397 1))) (AND (EQ s543 1) (EQ s565 1))), p0:(AND (EQ s383 1) (EQ s397 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 62 reset in 737 ms.
Product exploration explored 100000 steps with 63 reset in 895 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (OR (NOT p2) (NOT p1))), (X (NOT (AND p2 p0 p1))), (X (X p1)), (X (X (OR (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 254 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 967 rows 1006 cols
[2022-05-19 06:04:06] [INFO ] Computed 360 place invariants in 4 ms
[2022-05-19 06:04:06] [INFO ] [Real]Absence check using 360 positive place invariants in 55 ms returned sat
[2022-05-19 06:04:06] [INFO ] After 580ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 06:04:06] [INFO ] [Nat]Absence check using 360 positive place invariants in 52 ms returned sat
[2022-05-19 06:04:07] [INFO ] After 396ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 06:04:07] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2022-05-19 06:04:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2022-05-19 06:04:07] [INFO ] After 549ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2022-05-19 06:04:07] [INFO ] After 781ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 6 out of 1006 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1006/1006 places, 967/967 transitions.
Partial Free-agglomeration rule applied 236 times.
Drop transitions removed 236 transitions
Iterating global reduction 0 with 236 rules applied. Total rules applied 236 place count 1006 transition count 967
Applied a total of 236 rules in 34 ms. Remains 1006 /1006 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1006/1006 places, 967/967 transitions.
Finished random walk after 5825 steps, including 1 resets, run visited all 1 properties in 56 ms. (steps per millisecond=104 )
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (OR (NOT p2) (NOT p1))), (X (NOT (AND p2 p0 p1))), (X (X p1)), (X (X (OR (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT p1)), (F (AND p2 p0 p1))]
Knowledge based reduction with 7 factoid took 321 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1)]
// Phase 1: matrix 967 rows 1006 cols
[2022-05-19 06:04:08] [INFO ] Computed 360 place invariants in 4 ms
[2022-05-19 06:04:09] [INFO ] [Real]Absence check using 360 positive place invariants in 184 ms returned sat
[2022-05-19 06:04:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 06:04:10] [INFO ] [Real]Absence check using state equation in 1708 ms returned sat
[2022-05-19 06:04:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 06:04:11] [INFO ] [Nat]Absence check using 360 positive place invariants in 192 ms returned sat
[2022-05-19 06:04:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 06:04:13] [INFO ] [Nat]Absence check using state equation in 1956 ms returned sat
[2022-05-19 06:04:13] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2022-05-19 06:04:13] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 0 ms to minimize.
[2022-05-19 06:04:13] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2022-05-19 06:04:13] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2022-05-19 06:04:13] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
[2022-05-19 06:04:14] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2022-05-19 06:04:14] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 612 ms
[2022-05-19 06:04:14] [INFO ] Computed and/alt/rep : 962/2413/962 causal constraints (skipped 1 transitions) in 49 ms.
[2022-05-19 06:04:25] [INFO ] Added : 625 causal constraints over 125 iterations in 11649 ms. Result :unknown
Could not prove EG (NOT p2)
Support contains 6 out of 1006 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1006/1006 places, 967/967 transitions.
Applied a total of 0 rules in 12 ms. Remains 1006 /1006 variables (removed 0) and now considering 967/967 (removed 0) transitions.
// Phase 1: matrix 967 rows 1006 cols
[2022-05-19 06:04:25] [INFO ] Computed 360 place invariants in 4 ms
[2022-05-19 06:04:26] [INFO ] Implicit Places using invariants in 415 ms returned []
// Phase 1: matrix 967 rows 1006 cols
[2022-05-19 06:04:26] [INFO ] Computed 360 place invariants in 1 ms
[2022-05-19 06:04:27] [INFO ] Implicit Places using invariants and state equation in 956 ms returned []
Implicit Place search using SMT with State Equation took 1373 ms to find 0 implicit places.
// Phase 1: matrix 967 rows 1006 cols
[2022-05-19 06:04:27] [INFO ] Computed 360 place invariants in 3 ms
[2022-05-19 06:04:27] [INFO ] Dead Transitions using invariants and state equation in 430 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1006/1006 places, 967/967 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (OR (NOT p2) (NOT p1))), (X (NOT (AND p2 p0 p1))), (X (X p1)), (X (X (OR (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 214 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 967 rows 1006 cols
[2022-05-19 06:04:28] [INFO ] Computed 360 place invariants in 4 ms
[2022-05-19 06:04:28] [INFO ] [Real]Absence check using 360 positive place invariants in 51 ms returned sat
[2022-05-19 06:04:28] [INFO ] After 628ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 06:04:29] [INFO ] [Nat]Absence check using 360 positive place invariants in 49 ms returned sat
[2022-05-19 06:04:29] [INFO ] After 413ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 06:04:29] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2022-05-19 06:04:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2022-05-19 06:04:29] [INFO ] After 610ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 74 ms.
[2022-05-19 06:04:29] [INFO ] After 885ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 57 ms.
Support contains 6 out of 1006 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1006/1006 places, 967/967 transitions.
Partial Free-agglomeration rule applied 236 times.
Drop transitions removed 236 transitions
Iterating global reduction 0 with 236 rules applied. Total rules applied 236 place count 1006 transition count 967
Applied a total of 236 rules in 32 ms. Remains 1006 /1006 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1006/1006 places, 967/967 transitions.
Finished random walk after 1877 steps, including 0 resets, run visited all 2 properties in 30 ms. (steps per millisecond=62 )
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (OR (NOT p2) (NOT p1))), (X (NOT (AND p2 p0 p1))), (X (X p1)), (X (X (OR (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT p1)), (F (AND p2 p0 p1))]
Knowledge based reduction with 7 factoid took 503 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1)]
// Phase 1: matrix 967 rows 1006 cols
[2022-05-19 06:04:30] [INFO ] Computed 360 place invariants in 2 ms
[2022-05-19 06:04:31] [INFO ] [Real]Absence check using 360 positive place invariants in 175 ms returned sat
[2022-05-19 06:04:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 06:04:33] [INFO ] [Real]Absence check using state equation in 1649 ms returned sat
[2022-05-19 06:04:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 06:04:33] [INFO ] [Nat]Absence check using 360 positive place invariants in 197 ms returned sat
[2022-05-19 06:04:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 06:04:35] [INFO ] [Nat]Absence check using state equation in 1909 ms returned sat
[2022-05-19 06:04:35] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2022-05-19 06:04:35] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2022-05-19 06:04:36] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2022-05-19 06:04:36] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2022-05-19 06:04:36] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2022-05-19 06:04:36] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2022-05-19 06:04:36] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 529 ms
[2022-05-19 06:04:36] [INFO ] Computed and/alt/rep : 962/2413/962 causal constraints (skipped 1 transitions) in 48 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:677)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:356)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runSLCLLTLTest(LTLPropertySolver.java:277)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:687)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-19 06:04:48] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p2)
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1)]
Product exploration explored 100000 steps with 62 reset in 742 ms.
Product exploration explored 100000 steps with 62 reset in 899 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1)]
Support contains 6 out of 1006 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1006/1006 places, 967/967 transitions.
Applied a total of 0 rules in 22 ms. Remains 1006 /1006 variables (removed 0) and now considering 967/967 (removed 0) transitions.
[2022-05-19 06:04:50] [INFO ] Redundant transitions in 99 ms returned [966]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 966 rows 1006 cols
[2022-05-19 06:04:50] [INFO ] Computed 360 place invariants in 1 ms
[2022-05-19 06:04:50] [INFO ] Dead Transitions using invariants and state equation in 437 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1006/1006 places, 966/967 transitions.
Applied a total of 0 rules in 16 ms. Remains 1006 /1006 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1006/1006 places, 966/967 transitions.
Product exploration explored 100000 steps with 63 reset in 730 ms.
Product exploration explored 100000 steps with 63 reset in 911 ms.
Built C files in :
/tmp/ltsmin14910443666599188700
[2022-05-19 06:04:52] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14910443666599188700
Running compilation step : cd /tmp/ltsmin14910443666599188700;'/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 1724 ms.
Running link step : cd /tmp/ltsmin14910443666599188700;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin14910443666599188700;'/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/stateBased8220131586458822634.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 1006 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1006/1006 places, 967/967 transitions.
Applied a total of 0 rules in 14 ms. Remains 1006 /1006 variables (removed 0) and now considering 967/967 (removed 0) transitions.
// Phase 1: matrix 967 rows 1006 cols
[2022-05-19 06:05:07] [INFO ] Computed 360 place invariants in 3 ms
[2022-05-19 06:05:08] [INFO ] Implicit Places using invariants in 415 ms returned []
// Phase 1: matrix 967 rows 1006 cols
[2022-05-19 06:05:08] [INFO ] Computed 360 place invariants in 2 ms
[2022-05-19 06:05:08] [INFO ] Implicit Places using invariants and state equation in 941 ms returned []
Implicit Place search using SMT with State Equation took 1356 ms to find 0 implicit places.
// Phase 1: matrix 967 rows 1006 cols
[2022-05-19 06:05:08] [INFO ] Computed 360 place invariants in 3 ms
[2022-05-19 06:05:09] [INFO ] Dead Transitions using invariants and state equation in 415 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1006/1006 places, 967/967 transitions.
Built C files in :
/tmp/ltsmin11833447388290279646
[2022-05-19 06:05:09] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11833447388290279646
Running compilation step : cd /tmp/ltsmin11833447388290279646;'/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 1651 ms.
Running link step : cd /tmp/ltsmin11833447388290279646;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin11833447388290279646;'/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/stateBased8507024075336078570.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 06:05:24] [INFO ] Flatten gal took : 34 ms
[2022-05-19 06:05:24] [INFO ] Flatten gal took : 34 ms
[2022-05-19 06:05:24] [INFO ] Time to serialize gal into /tmp/LTL1564883800645029012.gal : 3 ms
[2022-05-19 06:05:24] [INFO ] Time to serialize properties into /tmp/LTL16088508013652550448.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/LTL1564883800645029012.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16088508013652550448.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/LTL1564883...267
Read 1 LTL properties
Checking formula 0 : !((F((X(!(("((p939==1)&&(p964==1))")U(!("((!((p939==1)&&(p964==1)))||((p1308==1)&&(p1359==1)))")))))&&(X("((p300==1)&&(p378==1))")))))
Formula 0 simplified : !F(X!("((p939==1)&&(p964==1))" U !"((!((p939==1)&&(p964==1)))||((p1308==1)&&(p1359==1)))") & X"((p300==1)&&(p378==1))")
Detected timeout of ITS tools.
[2022-05-19 06:05:39] [INFO ] Flatten gal took : 35 ms
[2022-05-19 06:05:39] [INFO ] Applying decomposition
[2022-05-19 06:05:39] [INFO ] Flatten gal took : 31 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/graph7165673877678884058.txt' '-o' '/tmp/graph7165673877678884058.bin' '-w' '/tmp/graph7165673877678884058.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7165673877678884058.bin' '-l' '-1' '-v' '-w' '/tmp/graph7165673877678884058.weights' '-q' '0' '-e' '0.001'
[2022-05-19 06:05:39] [INFO ] Decomposing Gal with order
[2022-05-19 06:05:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 06:05:39] [INFO ] Removed a total of 637 redundant transitions.
[2022-05-19 06:05:39] [INFO ] Flatten gal took : 48 ms
[2022-05-19 06:05:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 592 labels/synchronizations in 9 ms.
[2022-05-19 06:05:39] [INFO ] Time to serialize gal into /tmp/LTL17011636821591233191.gal : 5 ms
[2022-05-19 06:05:39] [INFO ] Time to serialize properties into /tmp/LTL2147128886497732570.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/LTL17011636821591233191.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2147128886497732570.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/LTL1701163...246
Read 1 LTL properties
Checking formula 0 : !((F((X(!(("((i15.i1.u137.p939==1)&&(i15.i1.u142.p964==1))")U(!("((!((i15.i1.u137.p939==1)&&(i15.i1.u142.p964==1)))||((i21.i2.u195.p13...244
Formula 0 simplified : !F(X!("((i15.i1.u137.p939==1)&&(i15.i1.u142.p964==1))" U !"((!((i15.i1.u137.p939==1)&&(i15.i1.u142.p964==1)))||((i21.i2.u195.p1308==...231
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin547166884775835055
[2022-05-19 06:05:55] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin547166884775835055
Running compilation step : cd /tmp/ltsmin547166884775835055;'/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 1622 ms.
Running link step : cd /tmp/ltsmin547166884775835055;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin547166884775835055;'/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) U !(LTLAPp1==true)))&&X((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-040B-LTLFireability-10 finished in 128668 ms.
[2022-05-19 06:06:10] [INFO ] Flatten gal took : 53 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17261307411089197168
[2022-05-19 06:06:10] [INFO ] Too many transitions (2094) to apply POR reductions. Disabling POR matrices.
[2022-05-19 06:06:10] [INFO ] Applying decomposition
[2022-05-19 06:06:10] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17261307411089197168
Running compilation step : cd /tmp/ltsmin17261307411089197168;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-19 06:06:10] [INFO ] Flatten gal took : 66 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/graph14638517054807713391.txt' '-o' '/tmp/graph14638517054807713391.bin' '-w' '/tmp/graph14638517054807713391.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14638517054807713391.bin' '-l' '-1' '-v' '-w' '/tmp/graph14638517054807713391.weights' '-q' '0' '-e' '0.001'
[2022-05-19 06:06:10] [INFO ] Decomposing Gal with order
[2022-05-19 06:06:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 06:06:10] [INFO ] Removed a total of 920 redundant transitions.
[2022-05-19 06:06:10] [INFO ] Flatten gal took : 94 ms
[2022-05-19 06:06:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2022-05-19 06:06:10] [INFO ] Time to serialize gal into /tmp/LTLFireability15474743060179239858.gal : 11 ms
[2022-05-19 06:06:10] [INFO ] Time to serialize properties into /tmp/LTLFireability4114395110446065961.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/LTLFireability15474743060179239858.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4114395110446065961.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 4 LTL properties
Checking formula 0 : !((G(F((X(X(X("((i15.u322.p957==1)&&(i9.u209.p617==0))"))))||(G("((i1.u42.p109==0)&&(i15.u322.p957==0))"))))))
Formula 0 simplified : !GF(XXX"((i15.u322.p957==1)&&(i9.u209.p617==0))" | G"((i1.u42.p109==0)&&(i15.u322.p957==0))")
Compilation finished in 4117 ms.
Running link step : cd /tmp/ltsmin17261307411089197168;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin17261307411089197168;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((X(X(X((LTLAPp0==true))))||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin17261307411089197168;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((X(X(X((LTLAPp0==true))))||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin17261307411089197168;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(((LTLAPp2==true)||(<>([]((<>((LTLAPp3==true))||(LTLAPp3==true))))&&(LTLAPp4==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-19 06:31:17] [INFO ] Applying decomposition
[2022-05-19 06:31:18] [INFO ] Flatten gal took : 600 ms
[2022-05-19 06:31:18] [INFO ] Decomposing Gal with order
[2022-05-19 06:31:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 06:31:20] [INFO ] Removed a total of 640 redundant transitions.
[2022-05-19 06:31:21] [INFO ] Flatten gal took : 794 ms
[2022-05-19 06:31:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 800 labels/synchronizations in 533 ms.
[2022-05-19 06:31:23] [INFO ] Time to serialize gal into /tmp/LTLFireability15340980089662306573.gal : 190 ms
[2022-05-19 06:31:23] [INFO ] Time to serialize properties into /tmp/LTLFireability10039349352185151658.ltl : 32 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/LTLFireability15340980089662306573.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10039349352185151658.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...269
Read 4 LTL properties
Checking formula 0 : !((G(F((X(X(X("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u309.p957==1)&&(i0.i0.i0.i0.i0.i0...518
Formula 0 simplified : !GF(XXX"((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u309.p957==1)&&(i0.i0.i0.i0.i0.i0.i0.i...503
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin17261307411089197168;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(((LTLAPp2==true)||(<>([]((<>((LTLAPp3==true))||(LTLAPp3==true))))&&(LTLAPp4==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin17261307411089197168;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X((X(<>((LTLAPp5==true)))||<>([]((LTLAPp6==true))))))' '--buchi-type=spotba'
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-040B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldIIPs-PT-040B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r222-tall-165286024800140"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-040B.tgz
mv ShieldIIPs-PT-040B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;