About the Execution of ITS-Tools for JoinFreeModules-PT-0500
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 9876.344 | 3600000.00 | 3937750.00 | 8708.60 | ?F??FTFFFTFFFFF? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r229-tall-167856412900203.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is JoinFreeModules-PT-0500, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r229-tall-167856412900203
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.1K Feb 25 11:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 11:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 11:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 11:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 11:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Feb 25 11:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 11:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 11:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.6M Mar 5 18:22 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 JoinFreeModules-PT-0500-LTLCardinality-00
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-01
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-02
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-03
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-04
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-05
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-06
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-07
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-08
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-09
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-10
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-11
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-12
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-13
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-14
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679448565954
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-0500
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-22 01:29:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-22 01:29:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 01:29:27] [INFO ] Load time of PNML (sax parser for PT used): 179 ms
[2023-03-22 01:29:27] [INFO ] Transformed 2501 places.
[2023-03-22 01:29:27] [INFO ] Transformed 4001 transitions.
[2023-03-22 01:29:27] [INFO ] Parsed PT model containing 2501 places and 4001 transitions and 11502 arcs in 280 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-0500-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0500-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0500-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 273 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2023-03-22 01:29:28] [INFO ] Computed 500 place invariants in 43 ms
[2023-03-22 01:29:30] [INFO ] Dead Transitions using invariants and state equation in 2151 ms found 0 transitions.
[2023-03-22 01:29:30] [INFO ] Invariant cache hit.
[2023-03-22 01:29:30] [INFO ] Implicit Places using invariants in 426 ms returned []
[2023-03-22 01:29:30] [INFO ] Invariant cache hit.
[2023-03-22 01:29:32] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 01:29:32] [INFO ] Implicit Places using invariants and state equation in 1828 ms returned []
Implicit Place search using SMT with State Equation took 2256 ms to find 0 implicit places.
[2023-03-22 01:29:32] [INFO ] Invariant cache hit.
[2023-03-22 01:29:34] [INFO ] Dead Transitions using invariants and state equation in 1869 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6583 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Support contains 39 out of 2500 places after structural reductions.
[2023-03-22 01:29:35] [INFO ] Flatten gal took : 252 ms
[2023-03-22 01:29:35] [INFO ] Flatten gal took : 168 ms
[2023-03-22 01:29:35] [INFO ] Input system was already deterministic with 4001 transitions.
Support contains 38 out of 2500 places (down from 39) after GAL structural reductions.
Incomplete random walk after 10029 steps, including 2 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 22) seen :0
Probabilistic random walk after 44169 steps, saw 44102 distinct states, run finished after 3035 ms. (steps per millisecond=14 ) properties seen :3
Running SMT prover for 19 properties.
[2023-03-22 01:29:39] [INFO ] Invariant cache hit.
[2023-03-22 01:29:40] [INFO ] [Real]Absence check using 500 positive place invariants in 94 ms returned sat
[2023-03-22 01:29:40] [INFO ] After 1379ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-03-22 01:29:42] [INFO ] [Nat]Absence check using 500 positive place invariants in 95 ms returned sat
[2023-03-22 01:30:05] [INFO ] After 23178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-03-22 01:30:06] [INFO ] State equation strengthened by 500 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 01:30:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 01:30:06] [INFO ] After 25043ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:19
Fused 19 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 34 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 165 are kept as prefixes of interest. Removing 2335 places using SCC suffix rule.7 ms
Discarding 2335 places :
Also discarding 3736 output transitions
Drop transitions removed 3736 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 165 transition count 264
Applied a total of 2 rules in 39 ms. Remains 165 /2500 variables (removed 2335) and now considering 264/4001 (removed 3737) transitions.
// Phase 1: matrix 264 rows 165 cols
[2023-03-22 01:30:06] [INFO ] Computed 33 place invariants in 1 ms
[2023-03-22 01:30:06] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 165/2500 places, 264/4001 transitions.
Incomplete random walk after 10491 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=499 ) properties (out of 19) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) 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 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) 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 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) 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 7) seen :2
Running SMT prover for 5 properties.
[2023-03-22 01:30:06] [INFO ] Invariant cache hit.
[2023-03-22 01:30:06] [INFO ] [Real]Absence check using 33 positive place invariants in 12 ms returned sat
[2023-03-22 01:30:06] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 01:30:06] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-22 01:30:07] [INFO ] After 415ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 01:30:07] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-22 01:30:07] [INFO ] After 128ms SMT Verify possible using 33 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-22 01:30:07] [INFO ] After 313ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 221 ms.
[2023-03-22 01:30:07] [INFO ] After 1032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Finished Parikh walk after 8909 steps, including 0 resets, run visited all 1 properties in 39 ms. (steps per millisecond=228 )
Parikh walk visited 5 properties in 604 ms.
FORMULA JoinFreeModules-PT-0500-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (X(p1)&&G(p2))))'
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 205 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2023-03-22 01:30:08] [INFO ] Computed 500 place invariants in 21 ms
[2023-03-22 01:30:10] [INFO ] Dead Transitions using invariants and state equation in 1934 ms found 0 transitions.
[2023-03-22 01:30:10] [INFO ] Invariant cache hit.
[2023-03-22 01:30:11] [INFO ] Implicit Places using invariants in 533 ms returned []
[2023-03-22 01:30:11] [INFO ] Invariant cache hit.
[2023-03-22 01:30:12] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 01:30:13] [INFO ] Implicit Places using invariants and state equation in 1834 ms returned []
Implicit Place search using SMT with State Equation took 2376 ms to find 0 implicit places.
[2023-03-22 01:30:13] [INFO ] Invariant cache hit.
[2023-03-22 01:30:14] [INFO ] Dead Transitions using invariants and state equation in 1769 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6294 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 394 ms :[(OR (NOT p2) (NOT p1)), true, (NOT p0), (AND p2 (NOT p1)), (NOT p2), (NOT p1), (NOT p2)]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 4}, { cond=(AND p2 p0), acceptance={0} source=0 dest: 5}, { cond=(AND p2 p0), acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 1}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND p2 p0 (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=6 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND p2 p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(LEQ 1 s657), p0:(LEQ 2 s894), p1:(LEQ 1 s830)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration timeout after 39630 steps with 4 reset in 10002 ms.
Product exploration timeout after 38240 steps with 1 reset in 10003 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND p2 p0))), (X p2), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p2 (NOT p0))), (X (X (NOT (AND p2 (NOT p1))))), true, (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X p2)), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 21 factoid took 990 ms. Reduced automaton from 7 states, 23 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p2), (NOT p2)]
Incomplete random walk after 10032 steps, including 2 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 1) seen :0
Probabilistic random walk after 78320 steps, saw 78198 distinct states, run finished after 3022 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 01:31:02] [INFO ] Invariant cache hit.
[2023-03-22 01:31:03] [INFO ] [Real]Absence check using 500 positive place invariants in 95 ms returned sat
[2023-03-22 01:31:04] [INFO ] After 1917ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 01:31:05] [INFO ] [Nat]Absence check using 500 positive place invariants in 96 ms returned sat
[2023-03-22 01:31:23] [INFO ] After 18492ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 01:31:23] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 01:31:24] [INFO ] After 1118ms SMT Verify possible using 500 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 01:31:25] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 3 ms to minimize.
[2023-03-22 01:31:25] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-22 01:31:26] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 3 ms to minimize.
[2023-03-22 01:31:26] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2023-03-22 01:31:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1467 ms
[2023-03-22 01:31:26] [INFO ] After 2975ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 347 ms.
[2023-03-22 01:31:26] [INFO ] After 22218ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2002 ms.
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 5 are kept as prefixes of interest. Removing 2495 places using SCC suffix rule.5 ms
Discarding 2495 places :
Also discarding 3992 output transitions
Drop transitions removed 3992 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 5 transition count 8
Applied a total of 2 rules in 14 ms. Remains 5 /2500 variables (removed 2495) and now considering 8/4001 (removed 3993) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-22 01:31:28] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-22 01:31:28] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 5/2500 places, 8/4001 transitions.
Finished random walk after 251 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=251 )
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND p2 p0))), (X p2), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p2 (NOT p0))), (X (X (NOT (AND p2 (NOT p1))))), true, (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X p2)), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (F (NOT p2))]
Knowledge based reduction with 21 factoid took 917 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p2), (NOT p2)]
Support contains 1 out of 2500 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 101 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2023-03-22 01:31:30] [INFO ] Computed 500 place invariants in 23 ms
[2023-03-22 01:31:32] [INFO ] Dead Transitions using invariants and state equation in 1890 ms found 0 transitions.
[2023-03-22 01:31:32] [INFO ] Invariant cache hit.
[2023-03-22 01:31:32] [INFO ] Implicit Places using invariants in 381 ms returned []
[2023-03-22 01:31:32] [INFO ] Invariant cache hit.
[2023-03-22 01:31:33] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 01:31:34] [INFO ] Implicit Places using invariants and state equation in 1672 ms returned []
Implicit Place search using SMT with State Equation took 2062 ms to find 0 implicit places.
[2023-03-22 01:31:34] [INFO ] Invariant cache hit.
[2023-03-22 01:31:35] [INFO ] Dead Transitions using invariants and state equation in 1806 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5867 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p2, (X p2), true, (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 199 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p2), (NOT p2)]
Incomplete random walk after 10281 steps, including 2 resets, run finished after 206 ms. (steps per millisecond=49 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 1) seen :0
Probabilistic random walk after 79324 steps, saw 79201 distinct states, run finished after 3018 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 01:32:02] [INFO ] Invariant cache hit.
[2023-03-22 01:32:02] [INFO ] [Real]Absence check using 500 positive place invariants in 97 ms returned sat
[2023-03-22 01:32:04] [INFO ] After 1943ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 01:32:04] [INFO ] [Nat]Absence check using 500 positive place invariants in 95 ms returned sat
[2023-03-22 01:32:23] [INFO ] After 18699ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 01:32:23] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 01:32:24] [INFO ] After 1025ms SMT Verify possible using 500 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 01:32:25] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 01:32:25] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2023-03-22 01:32:25] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-22 01:32:26] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2023-03-22 01:32:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1434 ms
[2023-03-22 01:32:26] [INFO ] After 2818ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 360 ms.
[2023-03-22 01:32:26] [INFO ] After 22282ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2002 ms.
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 5 are kept as prefixes of interest. Removing 2495 places using SCC suffix rule.1 ms
Discarding 2495 places :
Also discarding 3992 output transitions
Drop transitions removed 3992 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 5 transition count 8
Applied a total of 2 rules in 7 ms. Remains 5 /2500 variables (removed 2495) and now considering 8/4001 (removed 3993) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-22 01:32:28] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-22 01:32:28] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 5/2500 places, 8/4001 transitions.
Finished random walk after 251 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=251 )
Knowledge obtained : [p2, (X p2), true, (X (X p2))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 4 factoid took 166 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p2), (NOT p2)]
Product exploration timeout after 37010 steps with 0 reset in 10002 ms.
Product exploration timeout after 35580 steps with 0 reset in 10003 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p2), (NOT p2)]
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 494 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2023-03-22 01:32:50] [INFO ] Computed 500 place invariants in 19 ms
[2023-03-22 01:32:51] [INFO ] Dead Transitions using invariants and state equation in 1860 ms found 0 transitions.
[2023-03-22 01:32:52] [INFO ] Redundant transitions in 225 ms returned []
[2023-03-22 01:32:52] [INFO ] Invariant cache hit.
[2023-03-22 01:32:53] [INFO ] Dead Transitions using invariants and state equation in 1745 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4332 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Built C files in :
/tmp/ltsmin14123214893349977229
[2023-03-22 01:32:53] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14123214893349977229
Running compilation step : cd /tmp/ltsmin14123214893349977229;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14123214893349977229;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14123214893349977229;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 73 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-22 01:32:57] [INFO ] Invariant cache hit.
[2023-03-22 01:32:58] [INFO ] Dead Transitions using invariants and state equation in 1806 ms found 0 transitions.
[2023-03-22 01:32:58] [INFO ] Invariant cache hit.
[2023-03-22 01:32:59] [INFO ] Implicit Places using invariants in 373 ms returned []
[2023-03-22 01:32:59] [INFO ] Invariant cache hit.
[2023-03-22 01:33:00] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 01:33:00] [INFO ] Implicit Places using invariants and state equation in 839 ms returned []
Implicit Place search using SMT with State Equation took 1214 ms to find 0 implicit places.
[2023-03-22 01:33:00] [INFO ] Invariant cache hit.
[2023-03-22 01:33:01] [INFO ] Dead Transitions using invariants and state equation in 1846 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4947 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Built C files in :
/tmp/ltsmin2424614373213621879
[2023-03-22 01:33:02] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2424614373213621879
Running compilation step : cd /tmp/ltsmin2424614373213621879;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2424614373213621879;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2424614373213621879;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-22 01:33:05] [INFO ] Flatten gal took : 95 ms
[2023-03-22 01:33:05] [INFO ] Flatten gal took : 94 ms
[2023-03-22 01:33:05] [INFO ] Time to serialize gal into /tmp/LTL9185369529387776076.gal : 21 ms
[2023-03-22 01:33:05] [INFO ] Time to serialize properties into /tmp/LTL13336294068776452519.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9185369529387776076.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11861584008383556628.hoa' '-atoms' '/tmp/LTL13336294068776452519.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13336294068776452519.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11861584008383556628.hoa
Detected timeout of ITS tools.
[2023-03-22 01:33:20] [INFO ] Flatten gal took : 83 ms
[2023-03-22 01:33:20] [INFO ] Flatten gal took : 87 ms
[2023-03-22 01:33:20] [INFO ] Time to serialize gal into /tmp/LTL15517027784424709437.gal : 17 ms
[2023-03-22 01:33:20] [INFO ] Time to serialize properties into /tmp/LTL10767595552789410408.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15517027784424709437.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10767595552789410408.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((G("(p895>=2)"))U((X("(p831>=1)"))&&(G("(p658>=1)")))))
Formula 0 simplified : F!"(p895>=2)" R (X!"(p831>=1)" | F!"(p658>=1)")
Detected timeout of ITS tools.
[2023-03-22 01:33:35] [INFO ] Flatten gal took : 75 ms
[2023-03-22 01:33:35] [INFO ] Applying decomposition
[2023-03-22 01:33:35] [INFO ] Flatten gal took : 75 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph11210388305838727719.txt' '-o' '/tmp/graph11210388305838727719.bin' '-w' '/tmp/graph11210388305838727719.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph11210388305838727719.bin' '-l' '-1' '-v' '-w' '/tmp/graph11210388305838727719.weights' '-q' '0' '-e' '0.001'
[2023-03-22 01:33:36] [INFO ] Decomposing Gal with order
[2023-03-22 01:33:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-22 01:33:36] [INFO ] Flatten gal took : 115 ms
[2023-03-22 01:33:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 69 ms.
[2023-03-22 01:33:36] [INFO ] Time to serialize gal into /tmp/LTL7478066629589680344.gal : 25 ms
[2023-03-22 01:33:36] [INFO ] Time to serialize properties into /tmp/LTL6368413567371313639.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7478066629589680344.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6368413567371313639.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((G("(u178.p895>=2)"))U((X("(u166.p831>=1)"))&&(G("(u131.p658>=1)")))))
Formula 0 simplified : F!"(u178.p895>=2)" R (X!"(u166.p831>=1)" | F!"(u131.p658>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin615370563746310640
[2023-03-22 01:33:51] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin615370563746310640
Running compilation step : cd /tmp/ltsmin615370563746310640;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin615370563746310640;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin615370563746310640;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property JoinFreeModules-PT-0500-LTLCardinality-00 finished in 226285 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 180 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-22 01:33:55] [INFO ] Invariant cache hit.
[2023-03-22 01:33:57] [INFO ] Dead Transitions using invariants and state equation in 2040 ms found 0 transitions.
[2023-03-22 01:33:57] [INFO ] Invariant cache hit.
[2023-03-22 01:33:57] [INFO ] Implicit Places using invariants in 419 ms returned []
[2023-03-22 01:33:57] [INFO ] Invariant cache hit.
[2023-03-22 01:33:59] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 01:33:59] [INFO ] Implicit Places using invariants and state equation in 1845 ms returned []
Implicit Place search using SMT with State Equation took 2291 ms to find 0 implicit places.
[2023-03-22 01:33:59] [INFO ] Redundant transitions in 370 ms returned []
[2023-03-22 01:33:59] [INFO ] Invariant cache hit.
[2023-03-22 01:34:01] [INFO ] Dead Transitions using invariants and state equation in 2057 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6977 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (LEQ s20 s1370) (LEQ s2432 s700)), p1:(LEQ 1 s785)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration timeout after 36820 steps with 0 reset in 10002 ms.
Stack based approach found an accepted trace after 27355 steps with 0 reset with depth 27356 and stack size 27354 in 7391 ms.
FORMULA JoinFreeModules-PT-0500-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property JoinFreeModules-PT-0500-LTLCardinality-01 finished in 24482 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(!p0&&F(p0)))))'
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 153 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-22 01:34:19] [INFO ] Invariant cache hit.
[2023-03-22 01:34:21] [INFO ] Dead Transitions using invariants and state equation in 1836 ms found 0 transitions.
[2023-03-22 01:34:21] [INFO ] Invariant cache hit.
[2023-03-22 01:34:21] [INFO ] Implicit Places using invariants in 390 ms returned []
[2023-03-22 01:34:21] [INFO ] Invariant cache hit.
[2023-03-22 01:34:23] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 01:34:23] [INFO ] Implicit Places using invariants and state equation in 1733 ms returned []
Implicit Place search using SMT with State Equation took 2157 ms to find 0 implicit places.
[2023-03-22 01:34:23] [INFO ] Redundant transitions in 132 ms returned []
[2023-03-22 01:34:23] [INFO ] Invariant cache hit.
[2023-03-22 01:34:25] [INFO ] Dead Transitions using invariants and state equation in 1869 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6156 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ s881 s742)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration timeout after 36810 steps with 0 reset in 10002 ms.
Product exploration timeout after 35250 steps with 0 reset in 10002 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10278 steps, including 2 resets, run finished after 232 ms. (steps per millisecond=44 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 1) seen :0
Probabilistic random walk after 78320 steps, saw 78198 distinct states, run finished after 3025 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 01:35:12] [INFO ] Invariant cache hit.
[2023-03-22 01:35:12] [INFO ] After 305ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 01:35:12] [INFO ] [Nat]Absence check using 500 positive place invariants in 90 ms returned sat
[2023-03-22 01:35:30] [INFO ] After 17566ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 01:35:30] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 01:35:31] [INFO ] After 1313ms SMT Verify possible using 500 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 01:35:32] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-22 01:35:32] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:35:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:35:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 909 ms
[2023-03-22 01:35:33] [INFO ] After 2607ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 350 ms.
[2023-03-22 01:35:33] [INFO ] After 20921ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2002 ms.
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 10 are kept as prefixes of interest. Removing 2490 places using SCC suffix rule.1 ms
Discarding 2490 places :
Also discarding 3984 output transitions
Drop transitions removed 3984 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 16
Applied a total of 2 rules in 6 ms. Remains 10 /2500 variables (removed 2490) and now considering 16/4001 (removed 3985) transitions.
// Phase 1: matrix 16 rows 10 cols
[2023-03-22 01:35:35] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-22 01:35:35] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 10/2500 places, 16/4001 transitions.
Finished random walk after 251 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=251 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 169 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2023-03-22 01:35:35] [INFO ] Computed 500 place invariants in 15 ms
[2023-03-22 01:35:37] [INFO ] Dead Transitions using invariants and state equation in 1857 ms found 0 transitions.
[2023-03-22 01:35:37] [INFO ] Invariant cache hit.
[2023-03-22 01:35:38] [INFO ] Implicit Places using invariants in 412 ms returned []
[2023-03-22 01:35:38] [INFO ] Invariant cache hit.
[2023-03-22 01:35:39] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 01:35:39] [INFO ] Implicit Places using invariants and state equation in 1655 ms returned []
Implicit Place search using SMT with State Equation took 2080 ms to find 0 implicit places.
[2023-03-22 01:35:39] [INFO ] Redundant transitions in 123 ms returned []
[2023-03-22 01:35:40] [INFO ] Invariant cache hit.
[2023-03-22 01:35:41] [INFO ] Dead Transitions using invariants and state equation in 1795 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6036 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10028 steps, including 2 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 1) seen :0
Probabilistic random walk after 85349 steps, saw 85213 distinct states, run finished after 3028 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 01:36:08] [INFO ] Invariant cache hit.
[2023-03-22 01:36:09] [INFO ] After 279ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 01:36:09] [INFO ] [Nat]Absence check using 500 positive place invariants in 98 ms returned sat
[2023-03-22 01:36:27] [INFO ] After 17948ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 01:36:27] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 01:36:28] [INFO ] After 1316ms SMT Verify possible using 500 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 01:36:29] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 1 ms to minimize.
[2023-03-22 01:36:29] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2023-03-22 01:36:29] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 01:36:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1082 ms
[2023-03-22 01:36:30] [INFO ] After 2821ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 397 ms.
[2023-03-22 01:36:30] [INFO ] After 21574ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2002 ms.
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 10 are kept as prefixes of interest. Removing 2490 places using SCC suffix rule.0 ms
Discarding 2490 places :
Also discarding 3984 output transitions
Drop transitions removed 3984 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 16
Applied a total of 2 rules in 5 ms. Remains 10 /2500 variables (removed 2490) and now considering 16/4001 (removed 3985) transitions.
// Phase 1: matrix 16 rows 10 cols
[2023-03-22 01:36:32] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-22 01:36:32] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 10/2500 places, 16/4001 transitions.
Finished random walk after 251 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=251 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Product exploration timeout after 37100 steps with 0 reset in 10001 ms.
Product exploration timeout after 34930 steps with 0 reset in 10001 ms.
Built C files in :
/tmp/ltsmin5791028524497249438
[2023-03-22 01:36:53] [INFO ] Too many transitions (4001) to apply POR reductions. Disabling POR matrices.
[2023-03-22 01:36:53] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5791028524497249438
Running compilation step : cd /tmp/ltsmin5791028524497249438;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5791028524497249438;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5791028524497249438;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 161 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2023-03-22 01:36:56] [INFO ] Computed 500 place invariants in 12 ms
[2023-03-22 01:36:58] [INFO ] Dead Transitions using invariants and state equation in 1864 ms found 0 transitions.
[2023-03-22 01:36:58] [INFO ] Invariant cache hit.
[2023-03-22 01:36:58] [INFO ] Implicit Places using invariants in 403 ms returned []
[2023-03-22 01:36:58] [INFO ] Invariant cache hit.
[2023-03-22 01:37:00] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 01:37:00] [INFO ] Implicit Places using invariants and state equation in 1785 ms returned []
Implicit Place search using SMT with State Equation took 2190 ms to find 0 implicit places.
[2023-03-22 01:37:00] [INFO ] Redundant transitions in 126 ms returned []
[2023-03-22 01:37:00] [INFO ] Invariant cache hit.
[2023-03-22 01:37:02] [INFO ] Dead Transitions using invariants and state equation in 1779 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6136 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Built C files in :
/tmp/ltsmin13531428389291532724
[2023-03-22 01:37:02] [INFO ] Too many transitions (4001) to apply POR reductions. Disabling POR matrices.
[2023-03-22 01:37:02] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13531428389291532724
Running compilation step : cd /tmp/ltsmin13531428389291532724;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13531428389291532724;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13531428389291532724;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-22 01:37:05] [INFO ] Flatten gal took : 85 ms
[2023-03-22 01:37:05] [INFO ] Flatten gal took : 86 ms
[2023-03-22 01:37:05] [INFO ] Time to serialize gal into /tmp/LTL13155134846806356825.gal : 17 ms
[2023-03-22 01:37:05] [INFO ] Time to serialize properties into /tmp/LTL18158356760398863206.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13155134846806356825.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4825982682462050017.hoa' '-atoms' '/tmp/LTL18158356760398863206.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL18158356760398863206.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4825982682462050017.hoa
Detected timeout of ITS tools.
[2023-03-22 01:37:20] [INFO ] Flatten gal took : 74 ms
[2023-03-22 01:37:20] [INFO ] Flatten gal took : 81 ms
[2023-03-22 01:37:20] [INFO ] Time to serialize gal into /tmp/LTL10454974988857645138.gal : 14 ms
[2023-03-22 01:37:20] [INFO ] Time to serialize properties into /tmp/LTL3085275385108761272.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10454974988857645138.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3085275385108761272.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(p882<=p743)")))||(("(p882>p743)")&&(F("(p882<=p743)"))))))
Formula 0 simplified : G(FG!"(p882<=p743)" & (!"(p882>p743)" | G!"(p882<=p743)"))
Detected timeout of ITS tools.
[2023-03-22 01:37:36] [INFO ] Flatten gal took : 90 ms
[2023-03-22 01:37:36] [INFO ] Applying decomposition
[2023-03-22 01:37:36] [INFO ] Flatten gal took : 93 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph2529362095457532767.txt' '-o' '/tmp/graph2529362095457532767.bin' '-w' '/tmp/graph2529362095457532767.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2529362095457532767.bin' '-l' '-1' '-v' '-w' '/tmp/graph2529362095457532767.weights' '-q' '0' '-e' '0.001'
[2023-03-22 01:37:36] [INFO ] Decomposing Gal with order
[2023-03-22 01:37:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-22 01:37:36] [INFO ] Removed a total of 1 redundant transitions.
[2023-03-22 01:37:36] [INFO ] Flatten gal took : 124 ms
[2023-03-22 01:37:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 107 ms.
[2023-03-22 01:37:37] [INFO ] Time to serialize gal into /tmp/LTL11228957466500900789.gal : 26 ms
[2023-03-22 01:37:37] [INFO ] Time to serialize properties into /tmp/LTL17415616158568872272.ltl : 45 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11228957466500900789.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17415616158568872272.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(gu148.p882<=gu148.p743)")))||(("(gu148.p882>gu148.p743)")&&(F("(gu148.p882<=gu148.p743)"))))))
Formula 0 simplified : G(FG!"(gu148.p882<=gu148.p743)" & (!"(gu148.p882>gu148.p743)" | G!"(gu148.p882<=gu148.p743)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17049848126365472480
[2023-03-22 01:37:52] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17049848126365472480
Running compilation step : cd /tmp/ltsmin17049848126365472480;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17049848126365472480;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17049848126365472480;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property JoinFreeModules-PT-0500-LTLCardinality-02 finished in 216027 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 149 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-22 01:37:55] [INFO ] Invariant cache hit.
[2023-03-22 01:37:57] [INFO ] Dead Transitions using invariants and state equation in 1896 ms found 0 transitions.
[2023-03-22 01:37:57] [INFO ] Invariant cache hit.
[2023-03-22 01:37:57] [INFO ] Implicit Places using invariants in 413 ms returned []
[2023-03-22 01:37:57] [INFO ] Invariant cache hit.
[2023-03-22 01:37:59] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 01:37:59] [INFO ] Implicit Places using invariants and state equation in 1734 ms returned []
Implicit Place search using SMT with State Equation took 2149 ms to find 0 implicit places.
[2023-03-22 01:37:59] [INFO ] Redundant transitions in 125 ms returned []
[2023-03-22 01:37:59] [INFO ] Invariant cache hit.
[2023-03-22 01:38:01] [INFO ] Dead Transitions using invariants and state equation in 1773 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6101 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s1162 s1976)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration timeout after 36240 steps with 0 reset in 10003 ms.
Product exploration timeout after 34730 steps with 0 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Incomplete random walk after 10346 steps, including 2 resets, run finished after 236 ms. (steps per millisecond=43 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 1) seen :0
Probabilistic random walk after 80327 steps, saw 80201 distinct states, run finished after 3006 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 01:38:48] [INFO ] Invariant cache hit.
[2023-03-22 01:38:48] [INFO ] [Real]Absence check using 500 positive place invariants in 91 ms returned sat
[2023-03-22 01:38:50] [INFO ] After 1946ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 01:38:50] [INFO ] [Nat]Absence check using 500 positive place invariants in 97 ms returned sat
[2023-03-22 01:39:08] [INFO ] After 18284ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 01:39:08] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 01:39:09] [INFO ] After 779ms SMT Verify possible using 500 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 01:39:10] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2023-03-22 01:39:10] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:39:10] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-22 01:39:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 906 ms
[2023-03-22 01:39:11] [INFO ] After 2134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 423 ms.
[2023-03-22 01:39:11] [INFO ] After 21250ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2002 ms.
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 10 are kept as prefixes of interest. Removing 2490 places using SCC suffix rule.1 ms
Discarding 2490 places :
Also discarding 3984 output transitions
Drop transitions removed 3984 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 16
Applied a total of 2 rules in 4 ms. Remains 10 /2500 variables (removed 2490) and now considering 16/4001 (removed 3985) transitions.
// Phase 1: matrix 16 rows 10 cols
[2023-03-22 01:39:13] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-22 01:39:13] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 10/2500 places, 16/4001 transitions.
Finished random walk after 501 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=501 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 170 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2023-03-22 01:39:13] [INFO ] Computed 500 place invariants in 15 ms
[2023-03-22 01:39:15] [INFO ] Dead Transitions using invariants and state equation in 1836 ms found 0 transitions.
[2023-03-22 01:39:15] [INFO ] Invariant cache hit.
[2023-03-22 01:39:16] [INFO ] Implicit Places using invariants in 403 ms returned []
[2023-03-22 01:39:16] [INFO ] Invariant cache hit.
[2023-03-22 01:39:17] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 01:39:17] [INFO ] Implicit Places using invariants and state equation in 1656 ms returned []
Implicit Place search using SMT with State Equation took 2061 ms to find 0 implicit places.
[2023-03-22 01:39:17] [INFO ] Redundant transitions in 122 ms returned []
[2023-03-22 01:39:17] [INFO ] Invariant cache hit.
[2023-03-22 01:39:19] [INFO ] Dead Transitions using invariants and state equation in 1793 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5994 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Incomplete random walk after 10279 steps, including 2 resets, run finished after 227 ms. (steps per millisecond=45 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 268 ms. (steps per millisecond=37 ) properties (out of 1) seen :0
Probabilistic random walk after 83339 steps, saw 83208 distinct states, run finished after 3025 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 01:39:46] [INFO ] Invariant cache hit.
[2023-03-22 01:39:46] [INFO ] [Real]Absence check using 500 positive place invariants in 96 ms returned sat
[2023-03-22 01:39:47] [INFO ] After 1929ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 01:39:48] [INFO ] [Nat]Absence check using 500 positive place invariants in 94 ms returned sat
[2023-03-22 01:40:05] [INFO ] After 16762ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 01:40:05] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 01:40:05] [INFO ] After 708ms SMT Verify possible using 500 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 01:40:06] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:40:06] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 01:40:06] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 01:40:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 805 ms
[2023-03-22 01:40:07] [INFO ] After 1926ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 403 ms.
[2023-03-22 01:40:07] [INFO ] After 19474ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2002 ms.
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 10 are kept as prefixes of interest. Removing 2490 places using SCC suffix rule.1 ms
Discarding 2490 places :
Also discarding 3984 output transitions
Drop transitions removed 3984 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 16
Applied a total of 2 rules in 4 ms. Remains 10 /2500 variables (removed 2490) and now considering 16/4001 (removed 3985) transitions.
// Phase 1: matrix 16 rows 10 cols
[2023-03-22 01:40:09] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-22 01:40:09] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 10/2500 places, 16/4001 transitions.
Finished random walk after 251 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=251 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration timeout after 37380 steps with 0 reset in 10003 ms.
Product exploration timeout after 35570 steps with 0 reset in 10003 ms.
Built C files in :
/tmp/ltsmin10958702615369090411
[2023-03-22 01:40:29] [INFO ] Too many transitions (4001) to apply POR reductions. Disabling POR matrices.
[2023-03-22 01:40:29] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10958702615369090411
Running compilation step : cd /tmp/ltsmin10958702615369090411;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10958702615369090411;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10958702615369090411;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 135 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2023-03-22 01:40:33] [INFO ] Computed 500 place invariants in 13 ms
[2023-03-22 01:40:34] [INFO ] Dead Transitions using invariants and state equation in 1844 ms found 0 transitions.
[2023-03-22 01:40:34] [INFO ] Invariant cache hit.
[2023-03-22 01:40:35] [INFO ] Implicit Places using invariants in 354 ms returned []
[2023-03-22 01:40:35] [INFO ] Invariant cache hit.
[2023-03-22 01:40:36] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 01:40:36] [INFO ] Implicit Places using invariants and state equation in 1638 ms returned []
Implicit Place search using SMT with State Equation took 2007 ms to find 0 implicit places.
[2023-03-22 01:40:37] [INFO ] Redundant transitions in 126 ms returned []
[2023-03-22 01:40:37] [INFO ] Invariant cache hit.
[2023-03-22 01:40:38] [INFO ] Dead Transitions using invariants and state equation in 1777 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5944 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Built C files in :
/tmp/ltsmin16886478476312630181
[2023-03-22 01:40:38] [INFO ] Too many transitions (4001) to apply POR reductions. Disabling POR matrices.
[2023-03-22 01:40:38] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16886478476312630181
Running compilation step : cd /tmp/ltsmin16886478476312630181;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16886478476312630181;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16886478476312630181;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-22 01:40:42] [INFO ] Flatten gal took : 95 ms
[2023-03-22 01:40:42] [INFO ] Flatten gal took : 87 ms
[2023-03-22 01:40:42] [INFO ] Time to serialize gal into /tmp/LTL17490674833722161236.gal : 12 ms
[2023-03-22 01:40:42] [INFO ] Time to serialize properties into /tmp/LTL3328758784542724266.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17490674833722161236.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1592776210144800668.hoa' '-atoms' '/tmp/LTL3328758784542724266.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3328758784542724266.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1592776210144800668.hoa
Detected timeout of ITS tools.
[2023-03-22 01:40:57] [INFO ] Flatten gal took : 83 ms
[2023-03-22 01:40:57] [INFO ] Flatten gal took : 69 ms
[2023-03-22 01:40:57] [INFO ] Time to serialize gal into /tmp/LTL13320170131791067299.gal : 12 ms
[2023-03-22 01:40:57] [INFO ] Time to serialize properties into /tmp/LTL5843647813351170925.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13320170131791067299.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5843647813351170925.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(p1163>p1977)"))))
Formula 0 simplified : GF!"(p1163>p1977)"
Detected timeout of ITS tools.
[2023-03-22 01:41:12] [INFO ] Flatten gal took : 73 ms
[2023-03-22 01:41:12] [INFO ] Applying decomposition
[2023-03-22 01:41:12] [INFO ] Flatten gal took : 75 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph11373966525105817823.txt' '-o' '/tmp/graph11373966525105817823.bin' '-w' '/tmp/graph11373966525105817823.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph11373966525105817823.bin' '-l' '-1' '-v' '-w' '/tmp/graph11373966525105817823.weights' '-q' '0' '-e' '0.001'
[2023-03-22 01:41:13] [INFO ] Decomposing Gal with order
[2023-03-22 01:41:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-22 01:41:13] [INFO ] Removed a total of 1 redundant transitions.
[2023-03-22 01:41:13] [INFO ] Flatten gal took : 119 ms
[2023-03-22 01:41:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 35 ms.
[2023-03-22 01:41:13] [INFO ] Time to serialize gal into /tmp/LTL10616982865014873368.gal : 14 ms
[2023-03-22 01:41:13] [INFO ] Time to serialize properties into /tmp/LTL14592495852056761559.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10616982865014873368.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14592495852056761559.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("(gu396.p1163>gu396.p1977)"))))
Formula 0 simplified : GF!"(gu396.p1163>gu396.p1977)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14342753519779444589
[2023-03-22 01:41:28] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14342753519779444589
Running compilation step : cd /tmp/ltsmin14342753519779444589;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14342753519779444589;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14342753519779444589;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property JoinFreeModules-PT-0500-LTLCardinality-03 finished in 216510 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 54 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-22 01:41:31] [INFO ] Invariant cache hit.
[2023-03-22 01:41:33] [INFO ] Dead Transitions using invariants and state equation in 1848 ms found 0 transitions.
[2023-03-22 01:41:33] [INFO ] Invariant cache hit.
[2023-03-22 01:41:34] [INFO ] Implicit Places using invariants in 364 ms returned []
[2023-03-22 01:41:34] [INFO ] Invariant cache hit.
[2023-03-22 01:41:35] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 01:41:35] [INFO ] Implicit Places using invariants and state equation in 1630 ms returned []
Implicit Place search using SMT with State Equation took 2009 ms to find 0 implicit places.
[2023-03-22 01:41:35] [INFO ] Invariant cache hit.
[2023-03-22 01:41:37] [INFO ] Dead Transitions using invariants and state equation in 1807 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5729 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 s2441)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 751 steps with 0 reset in 91 ms.
FORMULA JoinFreeModules-PT-0500-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0500-LTLCardinality-04 finished in 5910 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 73 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-22 01:41:37] [INFO ] Invariant cache hit.
[2023-03-22 01:41:39] [INFO ] Dead Transitions using invariants and state equation in 1821 ms found 0 transitions.
[2023-03-22 01:41:39] [INFO ] Invariant cache hit.
[2023-03-22 01:41:39] [INFO ] Implicit Places using invariants in 343 ms returned []
[2023-03-22 01:41:39] [INFO ] Invariant cache hit.
[2023-03-22 01:41:41] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 01:41:41] [INFO ] Implicit Places using invariants and state equation in 1626 ms returned []
Implicit Place search using SMT with State Equation took 1973 ms to find 0 implicit places.
[2023-03-22 01:41:41] [INFO ] Invariant cache hit.
[2023-03-22 01:41:43] [INFO ] Dead Transitions using invariants and state equation in 1829 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5706 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 s594)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0500-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0500-LTLCardinality-06 finished in 5846 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 131 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-22 01:41:43] [INFO ] Invariant cache hit.
[2023-03-22 01:41:45] [INFO ] Dead Transitions using invariants and state equation in 1830 ms found 0 transitions.
[2023-03-22 01:41:45] [INFO ] Invariant cache hit.
[2023-03-22 01:41:45] [INFO ] Implicit Places using invariants in 393 ms returned []
[2023-03-22 01:41:45] [INFO ] Invariant cache hit.
[2023-03-22 01:41:47] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 01:41:47] [INFO ] Implicit Places using invariants and state equation in 1744 ms returned []
Implicit Place search using SMT with State Equation took 2139 ms to find 0 implicit places.
[2023-03-22 01:41:47] [INFO ] Redundant transitions in 124 ms returned []
[2023-03-22 01:41:47] [INFO ] Invariant cache hit.
[2023-03-22 01:41:49] [INFO ] Dead Transitions using invariants and state equation in 1822 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6053 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 s488)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0500-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0500-LTLCardinality-08 finished in 6150 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U p1)))'
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 54 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-22 01:41:49] [INFO ] Invariant cache hit.
[2023-03-22 01:41:51] [INFO ] Dead Transitions using invariants and state equation in 1839 ms found 0 transitions.
[2023-03-22 01:41:51] [INFO ] Invariant cache hit.
[2023-03-22 01:41:52] [INFO ] Implicit Places using invariants in 392 ms returned []
[2023-03-22 01:41:52] [INFO ] Invariant cache hit.
[2023-03-22 01:41:53] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 01:41:53] [INFO ] Implicit Places using invariants and state equation in 1785 ms returned []
Implicit Place search using SMT with State Equation took 2183 ms to find 0 implicit places.
[2023-03-22 01:41:53] [INFO ] Invariant cache hit.
[2023-03-22 01:41:55] [INFO ] Dead Transitions using invariants and state equation in 1838 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5917 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ 1 s984), p0:(GT 3 s1593)], 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 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0500-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0500-LTLCardinality-10 finished in 6020 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||X((p0 U X(p1))))))))'
Support contains 6 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 49 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-22 01:41:55] [INFO ] Invariant cache hit.
[2023-03-22 01:41:57] [INFO ] Dead Transitions using invariants and state equation in 1704 ms found 0 transitions.
[2023-03-22 01:41:57] [INFO ] Invariant cache hit.
[2023-03-22 01:41:57] [INFO ] Implicit Places using invariants in 345 ms returned []
[2023-03-22 01:41:57] [INFO ] Invariant cache hit.
[2023-03-22 01:41:59] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 01:41:59] [INFO ] Implicit Places using invariants and state equation in 1598 ms returned []
Implicit Place search using SMT with State Equation took 1946 ms to find 0 implicit places.
[2023-03-22 01:41:59] [INFO ] Invariant cache hit.
[2023-03-22 01:42:01] [INFO ] Dead Transitions using invariants and state equation in 1768 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5468 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}]], initial=1, aps=[p0:(LEQ s2177 s1215), p1:(AND (LEQ s2428 s1902) (LEQ s952 s1758))], 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, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0500-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0500-LTLCardinality-12 finished in 5685 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 130 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-22 01:42:01] [INFO ] Invariant cache hit.
[2023-03-22 01:42:03] [INFO ] Dead Transitions using invariants and state equation in 1876 ms found 0 transitions.
[2023-03-22 01:42:03] [INFO ] Invariant cache hit.
[2023-03-22 01:42:03] [INFO ] Implicit Places using invariants in 367 ms returned []
[2023-03-22 01:42:03] [INFO ] Invariant cache hit.
[2023-03-22 01:42:05] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 01:42:05] [INFO ] Implicit Places using invariants and state equation in 1619 ms returned []
Implicit Place search using SMT with State Equation took 1998 ms to find 0 implicit places.
[2023-03-22 01:42:05] [INFO ] Redundant transitions in 125 ms returned []
[2023-03-22 01:42:05] [INFO ] Invariant cache hit.
[2023-03-22 01:42:07] [INFO ] Dead Transitions using invariants and state equation in 1823 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5963 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 s1804)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0500-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0500-LTLCardinality-13 finished in 6050 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||F(p1)) U G(p2)))'
Support contains 6 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 133 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-22 01:42:07] [INFO ] Invariant cache hit.
[2023-03-22 01:42:09] [INFO ] Dead Transitions using invariants and state equation in 1774 ms found 0 transitions.
[2023-03-22 01:42:09] [INFO ] Invariant cache hit.
[2023-03-22 01:42:09] [INFO ] Implicit Places using invariants in 349 ms returned []
[2023-03-22 01:42:09] [INFO ] Invariant cache hit.
[2023-03-22 01:42:11] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 01:42:11] [INFO ] Implicit Places using invariants and state equation in 1656 ms returned []
Implicit Place search using SMT with State Equation took 2009 ms to find 0 implicit places.
[2023-03-22 01:42:11] [INFO ] Redundant transitions in 123 ms returned []
[2023-03-22 01:42:11] [INFO ] Invariant cache hit.
[2023-03-22 01:42:13] [INFO ] Dead Transitions using invariants and state equation in 1843 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5894 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p2), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(LEQ s1044 s925), p0:(LEQ s1854 s461), p1:(LEQ s2293 s2295)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration timeout after 50140 steps with 7 reset in 10003 ms.
Stack based approach found an accepted trace after 2623 steps with 0 reset with depth 2624 and stack size 2624 in 415 ms.
FORMULA JoinFreeModules-PT-0500-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property JoinFreeModules-PT-0500-LTLCardinality-14 finished in 16451 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(((p1||X(p0)) U p2)))))'
Support contains 6 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 48 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-22 01:42:24] [INFO ] Invariant cache hit.
[2023-03-22 01:42:25] [INFO ] Dead Transitions using invariants and state equation in 1714 ms found 0 transitions.
[2023-03-22 01:42:25] [INFO ] Invariant cache hit.
[2023-03-22 01:42:26] [INFO ] Implicit Places using invariants in 356 ms returned []
[2023-03-22 01:42:26] [INFO ] Invariant cache hit.
[2023-03-22 01:42:27] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 01:42:27] [INFO ] Implicit Places using invariants and state equation in 1638 ms returned []
Implicit Place search using SMT with State Equation took 2006 ms to find 0 implicit places.
[2023-03-22 01:42:27] [INFO ] Invariant cache hit.
[2023-03-22 01:42:29] [INFO ] Dead Transitions using invariants and state equation in 1746 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5522 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(NOT p2), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s1783 s754), p2:(GT s1602 s1853), p1:(GT s1589 s2485)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 37490 steps with 0 reset in 10001 ms.
Product exploration timeout after 35790 steps with 0 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), true, (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 6 factoid took 330 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Incomplete random walk after 10027 steps, including 2 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2023-03-22 01:43:14] [INFO ] Invariant cache hit.
[2023-03-22 01:43:14] [INFO ] [Real]Absence check using 500 positive place invariants in 102 ms returned sat
[2023-03-22 01:43:16] [INFO ] After 2027ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 01:43:16] [INFO ] [Nat]Absence check using 500 positive place invariants in 91 ms returned sat
[2023-03-22 01:43:35] [INFO ] After 18948ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 01:43:35] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 01:43:38] [INFO ] After 2462ms SMT Verify possible using 500 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 01:43:38] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 01:43:38] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:43:38] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-03-22 01:43:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 743 ms
[2023-03-22 01:43:39] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-22 01:43:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 283 ms
[2023-03-22 01:43:39] [INFO ] After 3928ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 712 ms.
[2023-03-22 01:43:40] [INFO ] After 24058ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4002 ms.
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 20 are kept as prefixes of interest. Removing 2480 places using SCC suffix rule.1 ms
Discarding 2480 places :
Also discarding 3968 output transitions
Drop transitions removed 3968 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 20 transition count 32
Applied a total of 2 rules in 4 ms. Remains 20 /2500 variables (removed 2480) and now considering 32/4001 (removed 3969) transitions.
// Phase 1: matrix 32 rows 20 cols
[2023-03-22 01:43:44] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 01:43:44] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 20/2500 places, 32/4001 transitions.
Finished random walk after 2005 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=2005 )
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), true, (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (AND (NOT p1) (NOT p2))), (F (NOT p0)), (F (NOT p2))]
Knowledge based reduction with 6 factoid took 365 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Support contains 6 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 65 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2023-03-22 01:43:45] [INFO ] Computed 500 place invariants in 10 ms
[2023-03-22 01:43:46] [INFO ] Dead Transitions using invariants and state equation in 1825 ms found 0 transitions.
[2023-03-22 01:43:46] [INFO ] Invariant cache hit.
[2023-03-22 01:43:47] [INFO ] Implicit Places using invariants in 455 ms returned []
[2023-03-22 01:43:47] [INFO ] Invariant cache hit.
[2023-03-22 01:43:48] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 01:43:48] [INFO ] Implicit Places using invariants and state equation in 1624 ms returned []
Implicit Place search using SMT with State Equation took 2080 ms to find 0 implicit places.
[2023-03-22 01:43:48] [INFO ] Invariant cache hit.
[2023-03-22 01:43:50] [INFO ] Dead Transitions using invariants and state equation in 1848 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5845 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 6 factoid took 309 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Incomplete random walk after 10279 steps, including 2 resets, run finished after 215 ms. (steps per millisecond=47 ) properties (out of 3) seen :2
Finished Best-First random walk after 1001 steps, including 0 resets, run visited all 1 properties in 24 ms. (steps per millisecond=41 )
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (AND (NOT p1) (NOT p2))), (F (NOT p0)), (F (NOT p2))]
Knowledge based reduction with 6 factoid took 387 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 117 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Product exploration timeout after 37180 steps with 0 reset in 10003 ms.
Product exploration timeout after 35470 steps with 0 reset in 10003 ms.
Built C files in :
/tmp/ltsmin16056322939096968917
[2023-03-22 01:44:37] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16056322939096968917
Running compilation step : cd /tmp/ltsmin16056322939096968917;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16056322939096968917;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16056322939096968917;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 6 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 48 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-22 01:44:40] [INFO ] Invariant cache hit.
[2023-03-22 01:44:41] [INFO ] Dead Transitions using invariants and state equation in 1820 ms found 0 transitions.
[2023-03-22 01:44:41] [INFO ] Invariant cache hit.
[2023-03-22 01:44:42] [INFO ] Implicit Places using invariants in 412 ms returned []
[2023-03-22 01:44:42] [INFO ] Invariant cache hit.
[2023-03-22 01:44:43] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 01:44:44] [INFO ] Implicit Places using invariants and state equation in 1714 ms returned []
Implicit Place search using SMT with State Equation took 2128 ms to find 0 implicit places.
[2023-03-22 01:44:44] [INFO ] Invariant cache hit.
[2023-03-22 01:44:45] [INFO ] Dead Transitions using invariants and state equation in 1732 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5732 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Built C files in :
/tmp/ltsmin611476641291651111
[2023-03-22 01:44:45] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin611476641291651111
Running compilation step : cd /tmp/ltsmin611476641291651111;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin611476641291651111;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin611476641291651111;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-22 01:44:48] [INFO ] Flatten gal took : 67 ms
[2023-03-22 01:44:49] [INFO ] Flatten gal took : 66 ms
[2023-03-22 01:44:49] [INFO ] Time to serialize gal into /tmp/LTL11964873540412897892.gal : 11 ms
[2023-03-22 01:44:49] [INFO ] Time to serialize properties into /tmp/LTL11054615306140964698.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11964873540412897892.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3559026570309932928.hoa' '-atoms' '/tmp/LTL11054615306140964698.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11054615306140964698.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3559026570309932928.hoa
Detected timeout of ITS tools.
[2023-03-22 01:45:04] [INFO ] Flatten gal took : 65 ms
[2023-03-22 01:45:04] [INFO ] Flatten gal took : 67 ms
[2023-03-22 01:45:04] [INFO ] Time to serialize gal into /tmp/LTL16431491737622411535.gal : 12 ms
[2023-03-22 01:45:04] [INFO ] Time to serialize properties into /tmp/LTL3849591861901328718.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16431491737622411535.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3849591861901328718.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F("(p1784<=p755)"))&&(F(G((("(p1590>p2486)")||(X("(p1784<=p755)")))U("(p1603>p1854)"))))))
Formula 0 simplified : G!"(p1784<=p755)" | GF((!"(p1590>p2486)" & X!"(p1784<=p755)") R !"(p1603>p1854)")
Detected timeout of ITS tools.
[2023-03-22 01:45:19] [INFO ] Flatten gal took : 66 ms
[2023-03-22 01:45:19] [INFO ] Applying decomposition
[2023-03-22 01:45:19] [INFO ] Flatten gal took : 66 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3199605057256703401.txt' '-o' '/tmp/graph3199605057256703401.bin' '-w' '/tmp/graph3199605057256703401.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3199605057256703401.bin' '-l' '-1' '-v' '-w' '/tmp/graph3199605057256703401.weights' '-q' '0' '-e' '0.001'
[2023-03-22 01:45:19] [INFO ] Decomposing Gal with order
[2023-03-22 01:45:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-22 01:45:19] [INFO ] Flatten gal took : 80 ms
[2023-03-22 01:45:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 29 ms.
[2023-03-22 01:45:19] [INFO ] Time to serialize gal into /tmp/LTL1017538264616883309.gal : 12 ms
[2023-03-22 01:45:19] [INFO ] Time to serialize properties into /tmp/LTL13108199163160387996.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1017538264616883309.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13108199163160387996.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F("(gu360.p1784<=gu360.p755)"))&&(F(G((("(gi318.gu320.p1590>gi318.gu320.p2486)")||(X("(gu360.p1784<=gu360.p755)")))U("(gi372.gu375...187
Formula 0 simplified : G!"(gu360.p1784<=gu360.p755)" | GF((!"(gi318.gu320.p1590>gi318.gu320.p2486)" & X!"(gu360.p1784<=gu360.p755)") R !"(gi372.gu375.p1603...176
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15880242066135206317
[2023-03-22 01:45:35] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15880242066135206317
Running compilation step : cd /tmp/ltsmin15880242066135206317;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15880242066135206317;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15880242066135206317;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property JoinFreeModules-PT-0500-LTLCardinality-15 finished in 194113 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (X(p1)&&G(p2))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(!p0&&F(p0)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(((p1||X(p0)) U p2)))))'
Found a Lengthening insensitive property : JoinFreeModules-PT-0500-LTLCardinality-15
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Support contains 6 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 178 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-22 01:45:38] [INFO ] Invariant cache hit.
[2023-03-22 01:45:40] [INFO ] Dead Transitions using invariants and state equation in 1855 ms found 0 transitions.
[2023-03-22 01:45:40] [INFO ] Invariant cache hit.
[2023-03-22 01:45:41] [INFO ] Implicit Places using invariants in 395 ms returned []
[2023-03-22 01:45:41] [INFO ] Invariant cache hit.
[2023-03-22 01:45:42] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 01:45:42] [INFO ] Implicit Places using invariants and state equation in 1751 ms returned []
Implicit Place search using SMT with State Equation took 2147 ms to find 0 implicit places.
[2023-03-22 01:45:42] [INFO ] Invariant cache hit.
[2023-03-22 01:45:44] [INFO ] Dead Transitions using invariants and state equation in 1790 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 5973 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Running random walk in product with property : JoinFreeModules-PT-0500-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(NOT p2), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s1783 s754), p2:(GT s1602 s1853), p1:(GT s1589 s2485)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 36790 steps with 0 reset in 10002 ms.
Product exploration timeout after 35170 steps with 0 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), true, (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 6 factoid took 325 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Incomplete random walk after 10029 steps, including 2 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2023-03-22 01:46:31] [INFO ] Invariant cache hit.
[2023-03-22 01:46:31] [INFO ] [Real]Absence check using 500 positive place invariants in 89 ms returned sat
[2023-03-22 01:46:33] [INFO ] After 2028ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 01:46:33] [INFO ] [Nat]Absence check using 500 positive place invariants in 95 ms returned sat
[2023-03-22 01:46:54] [INFO ] After 20464ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 01:46:54] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 01:46:56] [INFO ] After 2565ms SMT Verify possible using 500 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 01:46:57] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-22 01:46:57] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 2 ms to minimize.
[2023-03-22 01:46:57] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:46:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 795 ms
[2023-03-22 01:46:58] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-22 01:46:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 294 ms
[2023-03-22 01:46:58] [INFO ] After 4095ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-22 01:46:58] [INFO ] After 25039ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4002 ms.
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 20 are kept as prefixes of interest. Removing 2480 places using SCC suffix rule.1 ms
Discarding 2480 places :
Also discarding 3968 output transitions
Drop transitions removed 3968 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 20 transition count 32
Applied a total of 2 rules in 4 ms. Remains 20 /2500 variables (removed 2480) and now considering 32/4001 (removed 3969) transitions.
// Phase 1: matrix 32 rows 20 cols
[2023-03-22 01:47:02] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 01:47:02] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 20/2500 places, 32/4001 transitions.
Finished random walk after 803 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=401 )
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), true, (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (AND (NOT p1) (NOT p2))), (F (NOT p0)), (F (NOT p2))]
Knowledge based reduction with 6 factoid took 420 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 123 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Support contains 6 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 49 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2023-03-22 01:47:03] [INFO ] Computed 500 place invariants in 15 ms
[2023-03-22 01:47:04] [INFO ] Dead Transitions using invariants and state equation in 1793 ms found 0 transitions.
[2023-03-22 01:47:04] [INFO ] Invariant cache hit.
[2023-03-22 01:47:05] [INFO ] Implicit Places using invariants in 392 ms returned []
[2023-03-22 01:47:05] [INFO ] Invariant cache hit.
[2023-03-22 01:47:06] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 01:47:07] [INFO ] Implicit Places using invariants and state equation in 1759 ms returned []
Implicit Place search using SMT with State Equation took 2153 ms to find 0 implicit places.
[2023-03-22 01:47:07] [INFO ] Invariant cache hit.
[2023-03-22 01:47:08] [INFO ] Dead Transitions using invariants and state equation in 1849 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5846 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 6 factoid took 326 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Incomplete random walk after 10277 steps, including 2 resets, run finished after 215 ms. (steps per millisecond=47 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2023-03-22 01:47:34] [INFO ] Invariant cache hit.
[2023-03-22 01:47:34] [INFO ] [Real]Absence check using 500 positive place invariants in 91 ms returned sat
[2023-03-22 01:47:36] [INFO ] After 2042ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 01:47:36] [INFO ] [Nat]Absence check using 500 positive place invariants in 99 ms returned sat
[2023-03-22 01:47:56] [INFO ] After 19183ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 01:47:56] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 01:47:58] [INFO ] After 2522ms SMT Verify possible using 500 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 01:47:59] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-22 01:47:59] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 01:47:59] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 2 ms to minimize.
[2023-03-22 01:47:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 758 ms
[2023-03-22 01:47:59] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 01:48:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 282 ms
[2023-03-22 01:48:00] [INFO ] After 3997ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 737 ms.
[2023-03-22 01:48:00] [INFO ] After 24374ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4007 ms.
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 20 are kept as prefixes of interest. Removing 2480 places using SCC suffix rule.1 ms
Discarding 2480 places :
Also discarding 3968 output transitions
Drop transitions removed 3968 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 20 transition count 32
Applied a total of 2 rules in 5 ms. Remains 20 /2500 variables (removed 2480) and now considering 32/4001 (removed 3969) transitions.
// Phase 1: matrix 32 rows 20 cols
[2023-03-22 01:48:04] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 01:48:04] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 20/2500 places, 32/4001 transitions.
Finished random walk after 501 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=250 )
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (AND (NOT p1) (NOT p2))), (F (NOT p0)), (F (NOT p2))]
Knowledge based reduction with 6 factoid took 487 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 112 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Product exploration timeout after 37250 steps with 0 reset in 10002 ms.
Product exploration timeout after 35470 steps with 0 reset in 10003 ms.
Built C files in :
/tmp/ltsmin17760498619002455493
[2023-03-22 01:48:25] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17760498619002455493
Running compilation step : cd /tmp/ltsmin17760498619002455493;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17760498619002455493;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17760498619002455493;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 6 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 53 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2023-03-22 01:48:29] [INFO ] Computed 500 place invariants in 11 ms
[2023-03-22 01:48:30] [INFO ] Dead Transitions using invariants and state equation in 1956 ms found 0 transitions.
[2023-03-22 01:48:30] [INFO ] Invariant cache hit.
[2023-03-22 01:48:31] [INFO ] Implicit Places using invariants in 374 ms returned []
[2023-03-22 01:48:31] [INFO ] Invariant cache hit.
[2023-03-22 01:48:32] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 01:48:33] [INFO ] Implicit Places using invariants and state equation in 1669 ms returned []
Implicit Place search using SMT with State Equation took 2054 ms to find 0 implicit places.
[2023-03-22 01:48:33] [INFO ] Invariant cache hit.
[2023-03-22 01:48:34] [INFO ] Dead Transitions using invariants and state equation in 1831 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5900 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Built C files in :
/tmp/ltsmin379053702764287026
[2023-03-22 01:48:34] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin379053702764287026
Running compilation step : cd /tmp/ltsmin379053702764287026;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin379053702764287026;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin379053702764287026;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-22 01:48:38] [INFO ] Flatten gal took : 82 ms
[2023-03-22 01:48:38] [INFO ] Flatten gal took : 65 ms
[2023-03-22 01:48:38] [INFO ] Time to serialize gal into /tmp/LTL14754470693333150017.gal : 11 ms
[2023-03-22 01:48:38] [INFO ] Time to serialize properties into /tmp/LTL16180347726603632998.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14754470693333150017.gal' '-t' 'CGAL' '-hoa' '/tmp/aut361259581410341027.hoa' '-atoms' '/tmp/LTL16180347726603632998.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL16180347726603632998.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut361259581410341027.hoa
Detected timeout of ITS tools.
[2023-03-22 01:48:53] [INFO ] Flatten gal took : 65 ms
[2023-03-22 01:48:53] [INFO ] Flatten gal took : 65 ms
[2023-03-22 01:48:53] [INFO ] Time to serialize gal into /tmp/LTL4822889683415759794.gal : 13 ms
[2023-03-22 01:48:53] [INFO ] Time to serialize properties into /tmp/LTL10351482697591216450.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4822889683415759794.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10351482697591216450.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F("(p1784<=p755)"))&&(F(G((("(p1590>p2486)")||(X("(p1784<=p755)")))U("(p1603>p1854)"))))))
Formula 0 simplified : G!"(p1784<=p755)" | GF((!"(p1590>p2486)" & X!"(p1784<=p755)") R !"(p1603>p1854)")
Detected timeout of ITS tools.
[2023-03-22 01:49:08] [INFO ] Flatten gal took : 80 ms
[2023-03-22 01:49:08] [INFO ] Applying decomposition
[2023-03-22 01:49:08] [INFO ] Flatten gal took : 66 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph6224707297879346384.txt' '-o' '/tmp/graph6224707297879346384.bin' '-w' '/tmp/graph6224707297879346384.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6224707297879346384.bin' '-l' '-1' '-v' '-w' '/tmp/graph6224707297879346384.weights' '-q' '0' '-e' '0.001'
[2023-03-22 01:49:08] [INFO ] Decomposing Gal with order
[2023-03-22 01:49:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-22 01:49:08] [INFO ] Flatten gal took : 72 ms
[2023-03-22 01:49:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 49 ms.
[2023-03-22 01:49:09] [INFO ] Time to serialize gal into /tmp/LTL8251061681179590223.gal : 15 ms
[2023-03-22 01:49:09] [INFO ] Time to serialize properties into /tmp/LTL18087063258788204733.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8251061681179590223.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18087063258788204733.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F("(gu360.p1784<=gu360.p755)"))&&(F(G((("(gi498.gu501.p1590>gi498.gu501.p2486)")||(X("(gu360.p1784<=gu360.p755)")))U("(gi321.gu323...187
Formula 0 simplified : G!"(gu360.p1784<=gu360.p755)" | GF((!"(gi498.gu501.p1590>gi498.gu501.p2486)" & X!"(gu360.p1784<=gu360.p755)") R !"(gi321.gu323.p1603...176
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8927694600290239203
[2023-03-22 01:49:24] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8927694600290239203
Running compilation step : cd /tmp/ltsmin8927694600290239203;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8927694600290239203;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8927694600290239203;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property JoinFreeModules-PT-0500-LTLCardinality-15 finished in 228890 ms.
[2023-03-22 01:49:27] [INFO ] Flatten gal took : 70 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17041664370962970270
[2023-03-22 01:49:27] [INFO ] Too many transitions (4001) to apply POR reductions. Disabling POR matrices.
[2023-03-22 01:49:27] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17041664370962970270
Running compilation step : cd /tmp/ltsmin17041664370962970270;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-22 01:49:27] [INFO ] Applying decomposition
[2023-03-22 01:49:27] [INFO ] Flatten gal took : 77 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3728625084661948923.txt' '-o' '/tmp/graph3728625084661948923.bin' '-w' '/tmp/graph3728625084661948923.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3728625084661948923.bin' '-l' '-1' '-v' '-w' '/tmp/graph3728625084661948923.weights' '-q' '0' '-e' '0.001'
[2023-03-22 01:49:27] [INFO ] Decomposing Gal with order
[2023-03-22 01:49:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-22 01:49:27] [INFO ] Removed a total of 2 redundant transitions.
[2023-03-22 01:49:27] [INFO ] Flatten gal took : 90 ms
[2023-03-22 01:49:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 37 ms.
[2023-03-22 01:49:28] [INFO ] Time to serialize gal into /tmp/LTLCardinality17070144374259310060.gal : 13 ms
[2023-03-22 01:49:28] [INFO ] Time to serialize properties into /tmp/LTLCardinality14218604150785823035.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17070144374259310060.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14218604150785823035.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 4 LTL properties
Checking formula 0 : !(((G("(gu180.p895>=2)"))U((X("(gu167.p831>=1)"))&&(G("(gu131.p658>=1)")))))
Formula 0 simplified : F!"(gu180.p895>=2)" R (X!"(gu167.p831>=1)" | F!"(gu131.p658>=1)")
Compilation finished in 9866 ms.
Running link step : cd /tmp/ltsmin17041664370962970270;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin17041664370962970270;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true)) U (X((LTLAPp1==true))&&[]((LTLAPp2==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.039: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.040: LTL layer: formula: ([]((LTLAPp0==true)) U (X((LTLAPp1==true))&&[]((LTLAPp2==true))))
pins2lts-mc-linux64( 3/ 8), 0.040: "([]((LTLAPp0==true)) U (X((LTLAPp1==true))&&[]((LTLAPp2==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.054: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.070: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.072: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.083: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.101: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.101: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.107: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.109: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 1.923: There are 4010 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 1.923: State length is 2501, there are 4024 groups
pins2lts-mc-linux64( 0/ 8), 1.923: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 1.923: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 1.923: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 1.923: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 4.496: [Blue] ~120 levels ~960 states ~972536 transitions
pins2lts-mc-linux64( 3/ 8), 5.468: [Blue] ~240 levels ~1920 states ~1937336 transitions
pins2lts-mc-linux64( 3/ 8), 7.498: [Blue] ~480 levels ~3840 states ~3866936 transitions
pins2lts-mc-linux64( 2/ 8), 11.211: [Blue] ~960 levels ~7680 states ~7722040 transitions
pins2lts-mc-linux64( 2/ 8), 19.248: [Blue] ~1920 levels ~15360 states ~15441168 transitions
pins2lts-mc-linux64( 2/ 8), 35.259: [Blue] ~3840 levels ~30720 states ~30860792 transitions
pins2lts-mc-linux64( 4/ 8), 51.505: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 68.099:
pins2lts-mc-linux64( 0/ 8), 68.099: Explored 40610 states 40808098 transitions, fanout: 1004.878
pins2lts-mc-linux64( 0/ 8), 68.099: Total exploration time 66.140 sec (52.810 sec minimum, 59.791 sec on average)
pins2lts-mc-linux64( 0/ 8), 68.099: States per second: 614, Transitions per second: 616996
pins2lts-mc-linux64( 0/ 8), 68.099:
pins2lts-mc-linux64( 0/ 8), 68.099: State space has 40719923 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 68.099: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 68.099: blue states: 40610 (0.10%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 68.099: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 68.099: all-red states: 1 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 68.099:
pins2lts-mc-linux64( 0/ 8), 68.099: Total memory used for local state coloring: 0.6MB
pins2lts-mc-linux64( 0/ 8), 68.099:
pins2lts-mc-linux64( 0/ 8), 68.099: Queue width: 8B, total height: 40609, memory: 0.31MB
pins2lts-mc-linux64( 0/ 8), 68.099: Tree memory: 566.7MB, 14.6 B/state, compr.: 0.1%
pins2lts-mc-linux64( 0/ 8), 68.099: Tree fill ratio (roots/leafs): 30.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 68.099: Stored 4156 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 68.099: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 68.099: Est. total memory use: 567.0MB (~1024.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17041664370962970270;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true)) U (X((LTLAPp1==true))&&[]((LTLAPp2==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17041664370962970270;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true)) U (X((LTLAPp1==true))&&[]((LTLAPp2==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-22 02:16:07] [INFO ] Flatten gal took : 75 ms
[2023-03-22 02:16:07] [INFO ] Time to serialize gal into /tmp/LTLCardinality3405607181193287118.gal : 12 ms
[2023-03-22 02:16:07] [INFO ] Time to serialize properties into /tmp/LTLCardinality8090707837229712664.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality3405607181193287118.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8090707837229712664.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 4 LTL properties
Checking formula 0 : !(((G("(p895>=2)"))U((X("(p831>=1)"))&&(G("(p658>=1)")))))
Formula 0 simplified : F!"(p895>=2)" R (X!"(p831>=1)" | F!"(p658>=1)")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10228332 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16032016 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="JoinFreeModules-PT-0500"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is JoinFreeModules-PT-0500, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r229-tall-167856412900203"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-0500.tgz
mv JoinFreeModules-PT-0500 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;