About the Execution of ITS-Tools for CANInsertWithFailure-PT-040
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 14620.688 | 3600000.00 | 12006327.00 | 3476.60 | FFTFFT??FTTFFTF? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r294-smll-165463872300035.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is CANInsertWithFailure-PT-040, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463872300035
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 11K May 30 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 30 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 30 15:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 30 15:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K May 25 12:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 25 12:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 25 12:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 25 12:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 16K May 30 15:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K May 30 15:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 30 15:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K May 30 15:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 25 12:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 25 12:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 12:20 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 12:20 instance
-rw-r--r-- 1 mcc users 6 May 29 12:20 iscolored
-rw-r--r-- 1 mcc users 9.8M May 29 12:20 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 CANInsertWithFailure-PT-040-LTLCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-040-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1654676945320
Running Version 202205111006
[2022-06-08 08:29:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-08 08:29:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-08 08:29:08] [INFO ] Load time of PNML (sax parser for PT used): 1044 ms
[2022-06-08 08:29:08] [INFO ] Transformed 3684 places.
[2022-06-08 08:29:08] [INFO ] Transformed 9840 transitions.
[2022-06-08 08:29:08] [INFO ] Parsed PT model containing 3684 places and 9840 transitions in 1246 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 3684 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3684/3684 places, 9840/9840 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3683 transition count 9840
Applied a total of 1 rules in 1045 ms. Remains 3683 /3684 variables (removed 1) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2022-06-08 08:29:10] [INFO ] Computed 42 place invariants in 953 ms
[2022-06-08 08:29:12] [INFO ] Implicit Places using invariants in 2686 ms returned []
// Phase 1: matrix 9840 rows 3683 cols
[2022-06-08 08:29:13] [INFO ] Computed 42 place invariants in 804 ms
[2022-06-08 08:29:14] [INFO ] Implicit Places using invariants and state equation in 1926 ms returned []
Implicit Place search using SMT with State Equation took 4663 ms to find 0 implicit places.
// Phase 1: matrix 9840 rows 3683 cols
[2022-06-08 08:29:15] [INFO ] Computed 42 place invariants in 609 ms
[2022-06-08 08:29:24] [INFO ] Dead Transitions using invariants and state equation in 9508 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3683/3684 places, 9840/9840 transitions.
Finished structural reductions, in 1 iterations. Remains : 3683/3684 places, 9840/9840 transitions.
Support contains 39 out of 3683 places after structural reductions.
[2022-06-08 08:29:25] [INFO ] Flatten gal took : 645 ms
[2022-06-08 08:29:25] [INFO ] Flatten gal took : 413 ms
[2022-06-08 08:29:26] [INFO ] Input system was already deterministic with 9840 transitions.
Support contains 38 out of 3683 places (down from 39) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 10 resets, run finished after 1046 ms. (steps per millisecond=9 ) properties (out of 24) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
// Phase 1: matrix 9840 rows 3683 cols
[2022-06-08 08:29:28] [INFO ] Computed 42 place invariants in 539 ms
[2022-06-08 08:29:30] [INFO ] After 2308ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2022-06-08 08:29:32] [INFO ] [Nat]Absence check using 40 positive place invariants in 77 ms returned sat
[2022-06-08 08:29:32] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 96 ms returned sat
[2022-06-08 08:29:53] [INFO ] After 18992ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2022-06-08 08:29:53] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2022-06-08 08:29:55] [INFO ] After 1938ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :0 sat :18
[2022-06-08 08:29:55] [INFO ] After 1940ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-06-08 08:29:55] [INFO ] After 25054ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Parikh walk visited 0 properties in 2111 ms.
Support contains 31 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 278 transitions
Trivial Post-agglo rules discarded 278 transitions
Performed 278 trivial Post agglomeration. Transition count delta: 278
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 3683 transition count 9562
Reduce places removed 278 places and 0 transitions.
Iterating post reduction 1 with 278 rules applied. Total rules applied 556 place count 3405 transition count 9562
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 556 place count 3405 transition count 9561
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 558 place count 3404 transition count 9561
Performed 1543 Post agglomeration using F-continuation condition.Transition count delta: 1543
Deduced a syphon composed of 1543 places in 11 ms
Reduce places removed 1543 places and 0 transitions.
Iterating global reduction 2 with 3086 rules applied. Total rules applied 3644 place count 1861 transition count 8018
Drop transitions removed 1466 transitions
Redundant transition composition rules discarded 1466 transitions
Iterating global reduction 2 with 1466 rules applied. Total rules applied 5110 place count 1861 transition count 6552
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5111 place count 1861 transition count 6551
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5112 place count 1860 transition count 6551
Partial Free-agglomeration rule applied 1628 times.
Drop transitions removed 1628 transitions
Iterating global reduction 3 with 1628 rules applied. Total rules applied 6740 place count 1860 transition count 6551
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 3 with 40 rules applied. Total rules applied 6780 place count 1860 transition count 6551
Applied a total of 6780 rules in 3091 ms. Remains 1860 /3683 variables (removed 1823) and now considering 6551/9840 (removed 3289) transitions.
Finished structural reductions, in 1 iterations. Remains : 1860/3683 places, 6551/9840 transitions.
Incomplete random walk after 10000 steps, including 53 resets, run finished after 721 ms. (steps per millisecond=13 ) properties (out of 19) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :1
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 :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 6551 rows 1860 cols
[2022-06-08 08:30:01] [INFO ] Computed 42 place invariants in 198 ms
[2022-06-08 08:30:02] [INFO ] [Real]Absence check using 40 positive place invariants in 28 ms returned sat
[2022-06-08 08:30:02] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 35 ms returned sat
[2022-06-08 08:30:08] [INFO ] After 5308ms SMT Verify possible using state equation in real domain returned unsat :0 sat :8 real:2
[2022-06-08 08:30:08] [INFO ] State equation strengthened by 6327 read => feed constraints.
[2022-06-08 08:30:13] [INFO ] After 4548ms SMT Verify possible using 6327 Read/Feed constraints in real domain returned unsat :0 sat :0 real:10
[2022-06-08 08:30:13] [INFO ] After 11267ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-06-08 08:30:13] [INFO ] [Nat]Absence check using 40 positive place invariants in 27 ms returned sat
[2022-06-08 08:30:13] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 28 ms returned sat
[2022-06-08 08:30:19] [INFO ] After 5070ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2022-06-08 08:30:27] [INFO ] After 7798ms SMT Verify possible using 6327 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2022-06-08 08:30:34] [INFO ] After 14939ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
[2022-06-08 08:30:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-08 08:30:38] [INFO ] After 25053ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Parikh walk visited 0 properties in 240 ms.
Support contains 14 out of 1860 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1860/1860 places, 6551/6551 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 1852 transition count 6543
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 26 place count 1852 transition count 6543
Applied a total of 26 rules in 817 ms. Remains 1852 /1860 variables (removed 8) and now considering 6543/6551 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 1852/1860 places, 6543/6551 transitions.
Incomplete random walk after 10000 steps, including 54 resets, run finished after 532 ms. (steps per millisecond=18 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 80461 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 80461 steps, saw 25052 distinct states, run finished after 3003 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 6543 rows 1852 cols
[2022-06-08 08:30:43] [INFO ] Computed 42 place invariants in 327 ms
[2022-06-08 08:30:44] [INFO ] [Real]Absence check using 40 positive place invariants in 30 ms returned sat
[2022-06-08 08:30:44] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 28 ms returned sat
[2022-06-08 08:30:51] [INFO ] After 5995ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6 real:4
[2022-06-08 08:30:51] [INFO ] State equation strengthened by 6390 read => feed constraints.
[2022-06-08 08:30:54] [INFO ] After 3633ms SMT Verify possible using 6390 Read/Feed constraints in real domain returned unsat :0 sat :0 real:10
[2022-06-08 08:30:54] [INFO ] After 11290ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-06-08 08:30:55] [INFO ] [Nat]Absence check using 40 positive place invariants in 30 ms returned sat
[2022-06-08 08:30:55] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 28 ms returned sat
[2022-06-08 08:31:01] [INFO ] After 5319ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2022-06-08 08:31:08] [INFO ] After 6956ms SMT Verify possible using 6390 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2022-06-08 08:31:14] [INFO ] After 12900ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 4158 ms.
[2022-06-08 08:31:18] [INFO ] After 23500ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 366 ms.
Support contains 14 out of 1852 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1852/1852 places, 6543/6543 transitions.
Applied a total of 0 rules in 439 ms. Remains 1852 /1852 variables (removed 0) and now considering 6543/6543 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1852/1852 places, 6543/6543 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1852/1852 places, 6543/6543 transitions.
Applied a total of 0 rules in 308 ms. Remains 1852 /1852 variables (removed 0) and now considering 6543/6543 (removed 0) transitions.
// Phase 1: matrix 6543 rows 1852 cols
[2022-06-08 08:31:19] [INFO ] Computed 42 place invariants in 186 ms
[2022-06-08 08:31:22] [INFO ] Implicit Places using invariants in 3204 ms returned []
// Phase 1: matrix 6543 rows 1852 cols
[2022-06-08 08:31:22] [INFO ] Computed 42 place invariants in 179 ms
[2022-06-08 08:31:28] [INFO ] Implicit Places using invariants and state equation in 5828 ms returned []
Implicit Place search using SMT with State Equation took 9054 ms to find 0 implicit places.
[2022-06-08 08:31:29] [INFO ] Redundant transitions in 984 ms returned []
// Phase 1: matrix 6543 rows 1852 cols
[2022-06-08 08:31:29] [INFO ] Computed 42 place invariants in 194 ms
[2022-06-08 08:31:34] [INFO ] Dead Transitions using invariants and state equation in 5068 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1852/1852 places, 6543/6543 transitions.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 162 stabilizing places and 280 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1560 Post agglomeration using F-continuation condition.Transition count delta: 1560
Deduced a syphon composed of 1560 places in 3 ms
Reduce places removed 1560 places and 0 transitions.
Iterating global reduction 2 with 3120 rules applied. Total rules applied 3680 place count 1843 transition count 8000
Drop transitions removed 1482 transitions
Redundant transition composition rules discarded 1482 transitions
Iterating global reduction 2 with 1482 rules applied. Total rules applied 5162 place count 1843 transition count 6518
Applied a total of 5162 rules in 1871 ms. Remains 1843 /3683 variables (removed 1840) and now considering 6518/9840 (removed 3322) transitions.
// Phase 1: matrix 6518 rows 1843 cols
[2022-06-08 08:31:36] [INFO ] Computed 42 place invariants in 139 ms
[2022-06-08 08:31:38] [INFO ] Implicit Places using invariants in 1488 ms returned []
// Phase 1: matrix 6518 rows 1843 cols
[2022-06-08 08:31:38] [INFO ] Computed 42 place invariants in 234 ms
[2022-06-08 08:31:41] [INFO ] Implicit Places using invariants and state equation in 3320 ms returned []
Implicit Place search using SMT with State Equation took 4828 ms to find 0 implicit places.
[2022-06-08 08:31:42] [INFO ] Redundant transitions in 829 ms returned []
// Phase 1: matrix 6518 rows 1843 cols
[2022-06-08 08:31:42] [INFO ] Computed 42 place invariants in 155 ms
[2022-06-08 08:31:49] [INFO ] Dead Transitions using invariants and state equation in 7358 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1843/3683 places, 6518/9840 transitions.
Finished structural reductions, in 1 iterations. Remains : 1843/3683 places, 6518/9840 transitions.
Stuttering acceptance computed with spot in 229 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s1504 s1160)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 492 reset in 1444 ms.
Product exploration explored 100000 steps with 492 reset in 1594 ms.
Computed a total of 123 stabilizing places and 200 stable transitions
Computed a total of 123 stabilizing places and 200 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Finished random walk after 1760 steps, including 9 resets, run visited all 1 properties in 41 ms. (steps per millisecond=42 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 186 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Support contains 2 out of 1843 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1843/1843 places, 6518/6518 transitions.
Applied a total of 0 rules in 454 ms. Remains 1843 /1843 variables (removed 0) and now considering 6518/6518 (removed 0) transitions.
// Phase 1: matrix 6518 rows 1843 cols
[2022-06-08 08:31:54] [INFO ] Computed 42 place invariants in 227 ms
[2022-06-08 08:31:56] [INFO ] Implicit Places using invariants in 2034 ms returned []
// Phase 1: matrix 6518 rows 1843 cols
[2022-06-08 08:31:56] [INFO ] Computed 42 place invariants in 144 ms
[2022-06-08 08:31:59] [INFO ] Implicit Places using invariants and state equation in 3301 ms returned []
Implicit Place search using SMT with State Equation took 5340 ms to find 0 implicit places.
[2022-06-08 08:31:59] [INFO ] Redundant transitions in 474 ms returned []
// Phase 1: matrix 6518 rows 1843 cols
[2022-06-08 08:32:00] [INFO ] Computed 42 place invariants in 139 ms
[2022-06-08 08:32:06] [INFO ] Dead Transitions using invariants and state equation in 6095 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1843/1843 places, 6518/6518 transitions.
Computed a total of 123 stabilizing places and 200 stable transitions
Computed a total of 123 stabilizing places and 200 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Finished random walk after 9659 steps, including 47 resets, run visited all 1 properties in 184 ms. (steps per millisecond=52 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 178 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 497 reset in 1156 ms.
Stack based approach found an accepted trace after 81490 steps with 400 reset with depth 160 and stack size 158 in 1103 ms.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-00 finished in 34310 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(X(G(p0)))&&G(p1)))))'
Support contains 2 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1558 Post agglomeration using F-continuation condition.Transition count delta: 1558
Deduced a syphon composed of 1558 places in 3 ms
Reduce places removed 1558 places and 0 transitions.
Iterating global reduction 2 with 3116 rules applied. Total rules applied 3676 place count 1845 transition count 8002
Drop transitions removed 1480 transitions
Redundant transition composition rules discarded 1480 transitions
Iterating global reduction 2 with 1480 rules applied. Total rules applied 5156 place count 1845 transition count 6522
Applied a total of 5156 rules in 1741 ms. Remains 1845 /3683 variables (removed 1838) and now considering 6522/9840 (removed 3318) transitions.
// Phase 1: matrix 6522 rows 1845 cols
[2022-06-08 08:32:11] [INFO ] Computed 42 place invariants in 152 ms
[2022-06-08 08:32:12] [INFO ] Implicit Places using invariants in 1995 ms returned []
// Phase 1: matrix 6522 rows 1845 cols
[2022-06-08 08:32:13] [INFO ] Computed 42 place invariants in 142 ms
[2022-06-08 08:32:16] [INFO ] Implicit Places using invariants and state equation in 3363 ms returned []
Implicit Place search using SMT with State Equation took 5361 ms to find 0 implicit places.
[2022-06-08 08:32:17] [INFO ] Redundant transitions in 816 ms returned []
// Phase 1: matrix 6522 rows 1845 cols
[2022-06-08 08:32:17] [INFO ] Computed 42 place invariants in 141 ms
[2022-06-08 08:32:23] [INFO ] Dead Transitions using invariants and state equation in 6069 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1845/3683 places, 6522/9840 transitions.
Finished structural reductions, in 1 iterations. Remains : 1845/3683 places, 6522/9840 transitions.
Stuttering acceptance computed with spot in 355 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0, 1} source=0 dest: 0}, { cond=p1, acceptance={0, 1} source=0 dest: 1}, { cond=p1, acceptance={1} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0, 1} source=1 dest: 3}, { cond=p1, acceptance={0, 1} source=1 dest: 4}, { cond=p1, acceptance={1} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={0, 1} source=2 dest: 0}, { cond=p1, acceptance={1} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 4}, { cond=(AND p1 p0), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p1 p0), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=4 dest: 4}, { cond=(AND p1 p0), acceptance={} source=4 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={1} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={1} source=5 dest: 2}]], initial=0, aps=[p1:(LEQ 3 s1282), p0:(GT 2 s807)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 187 steps with 0 reset in 5 ms.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-01 finished in 14397 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(X(p0)))||X(F(p1))))'
Support contains 4 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 578 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2022-06-08 08:32:24] [INFO ] Computed 42 place invariants in 698 ms
[2022-06-08 08:32:25] [INFO ] Implicit Places using invariants in 1470 ms returned []
// Phase 1: matrix 9840 rows 3683 cols
[2022-06-08 08:32:26] [INFO ] Computed 42 place invariants in 517 ms
[2022-06-08 08:32:26] [INFO ] Implicit Places using invariants and state equation in 1335 ms returned []
Implicit Place search using SMT with State Equation took 2807 ms to find 0 implicit places.
// Phase 1: matrix 9840 rows 3683 cols
[2022-06-08 08:32:27] [INFO ] Computed 42 place invariants in 726 ms
[2022-06-08 08:32:28] [INFO ] Dead Transitions using invariants and state equation in 1511 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(LEQ s3334 s877), p0:(LEQ s2273 s1366)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 5294 ms.
Product exploration explored 100000 steps with 50000 reset in 5212 ms.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 4 factoid took 91 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-02 finished in 15743 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)&&X((p2||X(G(p2))))))'
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 598 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2022-06-08 08:32:40] [INFO ] Computed 42 place invariants in 583 ms
[2022-06-08 08:32:41] [INFO ] Implicit Places using invariants in 1976 ms returned []
// Phase 1: matrix 9840 rows 3683 cols
[2022-06-08 08:32:42] [INFO ] Computed 42 place invariants in 602 ms
[2022-06-08 08:32:43] [INFO ] Implicit Places using invariants and state equation in 1944 ms returned []
Implicit Place search using SMT with State Equation took 3927 ms to find 0 implicit places.
// Phase 1: matrix 9840 rows 3683 cols
[2022-06-08 08:32:44] [INFO ] Computed 42 place invariants in 780 ms
[2022-06-08 08:32:55] [INFO ] Dead Transitions using invariants and state equation in 11571 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), (NOT p2)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ 3 s1868), p0:(LEQ s2765 s361), p2:(GT s3424 s2809)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 66 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-03 finished in 16313 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 524 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2022-06-08 08:32:56] [INFO ] Computed 42 place invariants in 680 ms
[2022-06-08 08:32:57] [INFO ] Implicit Places using invariants in 1760 ms returned []
// Phase 1: matrix 9840 rows 3683 cols
[2022-06-08 08:32:58] [INFO ] Computed 42 place invariants in 490 ms
[2022-06-08 08:32:59] [INFO ] Implicit Places using invariants and state equation in 1780 ms returned []
Implicit Place search using SMT with State Equation took 3546 ms to find 0 implicit places.
// Phase 1: matrix 9840 rows 3683 cols
[2022-06-08 08:33:00] [INFO ] Computed 42 place invariants in 535 ms
[2022-06-08 08:33:10] [INFO ] Dead Transitions using invariants and state equation in 10766 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GT s1155 s2574)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-04 finished in 14954 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((F(p0)&&p1))||F(G(p0)))))'
Support contains 2 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 4 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3678 place count 1844 transition count 8001
Drop transitions removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5159 place count 1844 transition count 6520
Applied a total of 5159 rules in 1502 ms. Remains 1844 /3683 variables (removed 1839) and now considering 6520/9840 (removed 3320) transitions.
// Phase 1: matrix 6520 rows 1844 cols
[2022-06-08 08:33:12] [INFO ] Computed 42 place invariants in 256 ms
[2022-06-08 08:33:14] [INFO ] Implicit Places using invariants in 1959 ms returned []
// Phase 1: matrix 6520 rows 1844 cols
[2022-06-08 08:33:14] [INFO ] Computed 42 place invariants in 151 ms
[2022-06-08 08:33:17] [INFO ] Implicit Places using invariants and state equation in 3370 ms returned []
Implicit Place search using SMT with State Equation took 5351 ms to find 0 implicit places.
[2022-06-08 08:33:18] [INFO ] Redundant transitions in 789 ms returned []
// Phase 1: matrix 6520 rows 1844 cols
[2022-06-08 08:33:18] [INFO ] Computed 42 place invariants in 144 ms
[2022-06-08 08:33:24] [INFO ] Dead Transitions using invariants and state equation in 6279 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1844/3683 places, 6520/9840 transitions.
Finished structural reductions, in 1 iterations. Remains : 1844/3683 places, 6520/9840 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 3 s278), p1:(LEQ 2 s1750)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 490 reset in 1164 ms.
Product exploration explored 100000 steps with 491 reset in 1210 ms.
Computed a total of 123 stabilizing places and 200 stable transitions
Computed a total of 123 stabilizing places and 200 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 392 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 50 resets, run finished after 363 ms. (steps per millisecond=27 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) 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 3) seen :0
Interrupted probabilistic random walk after 74414 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 74414 steps, saw 25692 distinct states, run finished after 3002 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 6520 rows 1844 cols
[2022-06-08 08:33:31] [INFO ] Computed 42 place invariants in 183 ms
[2022-06-08 08:33:31] [INFO ] [Real]Absence check using 40 positive place invariants in 26 ms returned sat
[2022-06-08 08:33:31] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 27 ms returned sat
[2022-06-08 08:33:34] [INFO ] After 3024ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2022-06-08 08:33:34] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2022-06-08 08:33:35] [INFO ] After 849ms SMT Verify possible using 4757 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-08 08:33:35] [INFO ] After 4439ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-08 08:33:36] [INFO ] [Nat]Absence check using 40 positive place invariants in 25 ms returned sat
[2022-06-08 08:33:36] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 27 ms returned sat
[2022-06-08 08:33:40] [INFO ] After 4520ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-08 08:33:43] [INFO ] After 2633ms SMT Verify possible using 4757 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-06-08 08:33:44] [INFO ] After 3736ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 892 ms.
[2022-06-08 08:33:45] [INFO ] After 9657ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 1844 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1844/1844 places, 6520/6520 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1844 transition count 6519
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1843 transition count 6519
Partial Free-agglomeration rule applied 1640 times.
Drop transitions removed 1640 transitions
Iterating global reduction 1 with 1640 rules applied. Total rules applied 1642 place count 1843 transition count 6519
Applied a total of 1642 rules in 843 ms. Remains 1843 /1844 variables (removed 1) and now considering 6519/6520 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 1843/1844 places, 6519/6520 transitions.
Incomplete random walk after 10000 steps, including 53 resets, run finished after 396 ms. (steps per millisecond=25 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) 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 3) seen :0
Interrupted probabilistic random walk after 71935 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 71935 steps, saw 24021 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 6519 rows 1843 cols
[2022-06-08 08:33:49] [INFO ] Computed 42 place invariants in 268 ms
[2022-06-08 08:33:50] [INFO ] [Real]Absence check using 40 positive place invariants in 43 ms returned sat
[2022-06-08 08:33:50] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 43 ms returned sat
[2022-06-08 08:33:54] [INFO ] After 3909ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2022-06-08 08:33:54] [INFO ] State equation strengthened by 6396 read => feed constraints.
[2022-06-08 08:33:55] [INFO ] After 1306ms SMT Verify possible using 6396 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-08 08:33:55] [INFO ] After 6061ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-08 08:33:56] [INFO ] [Nat]Absence check using 40 positive place invariants in 40 ms returned sat
[2022-06-08 08:33:56] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 42 ms returned sat
[2022-06-08 08:34:01] [INFO ] After 4574ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-08 08:34:03] [INFO ] After 2765ms SMT Verify possible using 6396 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-06-08 08:34:05] [INFO ] After 4516ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1385 ms.
[2022-06-08 08:34:07] [INFO ] After 11142ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 15 ms.
Support contains 2 out of 1843 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 282 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1843/1843 places, 6519/6519 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 294 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
// Phase 1: matrix 6519 rows 1843 cols
[2022-06-08 08:34:07] [INFO ] Computed 42 place invariants in 309 ms
[2022-06-08 08:34:12] [INFO ] Implicit Places using invariants in 4692 ms returned []
// Phase 1: matrix 6519 rows 1843 cols
[2022-06-08 08:34:12] [INFO ] Computed 42 place invariants in 267 ms
[2022-06-08 08:34:17] [INFO ] Implicit Places using invariants and state equation in 5181 ms returned []
Implicit Place search using SMT with State Equation took 9880 ms to find 0 implicit places.
[2022-06-08 08:34:18] [INFO ] Redundant transitions in 681 ms returned []
// Phase 1: matrix 6519 rows 1843 cols
[2022-06-08 08:34:18] [INFO ] Computed 42 place invariants in 186 ms
[2022-06-08 08:34:25] [INFO ] Dead Transitions using invariants and state equation in 6915 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1843/1843 places, 6519/6519 transitions.
Graph (trivial) has 6272 edges and 1843 vertex of which 1678 / 1843 are part of one of the 2 SCC in 15 ms
Free SCC test removed 1676 places
Drop transitions removed 4715 transitions
Ensure Unique test removed 1632 transitions
Reduce isomorphic transitions removed 6347 transitions.
Graph (complete) has 414 edges and 167 vertex of which 46 are kept as prefixes of interest. Removing 121 places using SCC suffix rule.1 ms
Discarding 121 places :
Also discarding 39 output transitions
Drop transitions removed 39 transitions
Drop transitions removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 82 rules applied. Total rules applied 84 place count 46 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 85 place count 45 transition count 51
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 123 place count 7 transition count 13
Iterating global reduction 2 with 38 rules applied. Total rules applied 161 place count 7 transition count 13
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 163 place count 7 transition count 11
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 place count 7 transition count 10
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 166 place count 6 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 167 place count 5 transition count 8
Applied a total of 167 rules in 43 ms. Remains 5 /1843 variables (removed 1838) and now considering 8/6519 (removed 6511) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 8 rows 5 cols
[2022-06-08 08:34:25] [INFO ] Computed 0 place invariants in 1 ms
[2022-06-08 08:34:25] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-08 08:34:25] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-08 08:34:25] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-06-08 08:34:25] [INFO ] After 56ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2022-06-08 08:34:25] [INFO ] Flatten gal took : 2 ms
[2022-06-08 08:34:25] [INFO ] Flatten gal took : 0 ms
[2022-06-08 08:34:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13716805836085933722.gal : 4 ms
[2022-06-08 08:34:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15947081942005421989.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms9918489307012979393;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13716805836085933722.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15947081942005421989.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality15947081942005421989.prop.
Reachability property apf2 is true.
SDD proceeding with computation,2 properties remain. new max is 2
SDD size :1 after 9
Reachability property apf1 is true.
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,19,0.050603,3760,2,12,8,79,6,0,27,50,0
Total reachable state count : 19
Verifying 3 reachability properties.
Reachability property apf0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,1,0.050897,3760,2,6,8,79,7,0,30,50,0
Reachability property apf1 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf1,1,0.051147,3760,2,6,8,79,8,0,34,50,0
Reachability property apf2 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf2,1,0.051398,3760,2,6,8,79,9,0,36,50,0
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 351 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 1844 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1844/1844 places, 6520/6520 transitions.
Applied a total of 0 rules in 283 ms. Remains 1844 /1844 variables (removed 0) and now considering 6520/6520 (removed 0) transitions.
// Phase 1: matrix 6520 rows 1844 cols
[2022-06-08 08:34:26] [INFO ] Computed 42 place invariants in 258 ms
[2022-06-08 08:34:28] [INFO ] Implicit Places using invariants in 2163 ms returned []
// Phase 1: matrix 6520 rows 1844 cols
[2022-06-08 08:34:28] [INFO ] Computed 42 place invariants in 232 ms
[2022-06-08 08:34:30] [INFO ] Implicit Places using invariants and state equation in 2296 ms returned []
Implicit Place search using SMT with State Equation took 4460 ms to find 0 implicit places.
[2022-06-08 08:34:31] [INFO ] Redundant transitions in 482 ms returned []
// Phase 1: matrix 6520 rows 1844 cols
[2022-06-08 08:34:31] [INFO ] Computed 42 place invariants in 240 ms
[2022-06-08 08:34:37] [INFO ] Dead Transitions using invariants and state equation in 6414 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1844/1844 places, 6520/6520 transitions.
Computed a total of 123 stabilizing places and 200 stable transitions
Computed a total of 123 stabilizing places and 200 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 252 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 49 resets, run finished after 351 ms. (steps per millisecond=28 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 78154 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 78154 steps, saw 26096 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 6520 rows 1844 cols
[2022-06-08 08:34:41] [INFO ] Computed 42 place invariants in 142 ms
[2022-06-08 08:34:42] [INFO ] [Real]Absence check using 40 positive place invariants in 26 ms returned sat
[2022-06-08 08:34:42] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 27 ms returned sat
[2022-06-08 08:34:44] [INFO ] After 2648ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2022-06-08 08:34:45] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2022-06-08 08:34:46] [INFO ] After 1013ms SMT Verify possible using 4757 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-08 08:34:46] [INFO ] After 4285ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-08 08:34:46] [INFO ] [Nat]Absence check using 40 positive place invariants in 37 ms returned sat
[2022-06-08 08:34:46] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 42 ms returned sat
[2022-06-08 08:34:50] [INFO ] After 4145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-08 08:34:53] [INFO ] After 2477ms SMT Verify possible using 4757 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-06-08 08:34:54] [INFO ] After 3850ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1058 ms.
[2022-06-08 08:34:55] [INFO ] After 9724ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 1844 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1844/1844 places, 6520/6520 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1844 transition count 6519
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1843 transition count 6519
Partial Free-agglomeration rule applied 1640 times.
Drop transitions removed 1640 transitions
Iterating global reduction 1 with 1640 rules applied. Total rules applied 1642 place count 1843 transition count 6519
Applied a total of 1642 rules in 908 ms. Remains 1843 /1844 variables (removed 1) and now considering 6519/6520 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 1843/1844 places, 6519/6520 transitions.
Incomplete random walk after 10000 steps, including 54 resets, run finished after 419 ms. (steps per millisecond=23 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 78609 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 78609 steps, saw 24765 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 6519 rows 1843 cols
[2022-06-08 08:35:00] [INFO ] Computed 42 place invariants in 308 ms
[2022-06-08 08:35:01] [INFO ] [Real]Absence check using 40 positive place invariants in 29 ms returned sat
[2022-06-08 08:35:01] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 28 ms returned sat
[2022-06-08 08:35:04] [INFO ] After 3407ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2022-06-08 08:35:04] [INFO ] State equation strengthened by 6396 read => feed constraints.
[2022-06-08 08:35:05] [INFO ] After 1143ms SMT Verify possible using 6396 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-08 08:35:05] [INFO ] After 5235ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-08 08:35:06] [INFO ] [Nat]Absence check using 40 positive place invariants in 28 ms returned sat
[2022-06-08 08:35:06] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 36 ms returned sat
[2022-06-08 08:35:11] [INFO ] After 4670ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-08 08:35:13] [INFO ] After 2656ms SMT Verify possible using 6396 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-06-08 08:35:15] [INFO ] After 4089ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1009 ms.
[2022-06-08 08:35:16] [INFO ] After 10370ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 1843 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 424 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1843/1843 places, 6519/6519 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 513 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
// Phase 1: matrix 6519 rows 1843 cols
[2022-06-08 08:35:17] [INFO ] Computed 42 place invariants in 289 ms
[2022-06-08 08:35:21] [INFO ] Implicit Places using invariants in 4272 ms returned []
// Phase 1: matrix 6519 rows 1843 cols
[2022-06-08 08:35:21] [INFO ] Computed 42 place invariants in 310 ms
[2022-06-08 08:35:27] [INFO ] Implicit Places using invariants and state equation in 5669 ms returned []
Implicit Place search using SMT with State Equation took 9943 ms to find 0 implicit places.
[2022-06-08 08:35:27] [INFO ] Redundant transitions in 760 ms returned []
// Phase 1: matrix 6519 rows 1843 cols
[2022-06-08 08:35:27] [INFO ] Computed 42 place invariants in 192 ms
[2022-06-08 08:35:35] [INFO ] Dead Transitions using invariants and state equation in 7482 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1843/1843 places, 6519/6519 transitions.
Graph (trivial) has 6272 edges and 1843 vertex of which 1678 / 1843 are part of one of the 2 SCC in 1 ms
Free SCC test removed 1676 places
Drop transitions removed 4715 transitions
Ensure Unique test removed 1632 transitions
Reduce isomorphic transitions removed 6347 transitions.
Graph (complete) has 414 edges and 167 vertex of which 46 are kept as prefixes of interest. Removing 121 places using SCC suffix rule.1 ms
Discarding 121 places :
Also discarding 39 output transitions
Drop transitions removed 39 transitions
Drop transitions removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 82 rules applied. Total rules applied 84 place count 46 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 85 place count 45 transition count 51
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 123 place count 7 transition count 13
Iterating global reduction 2 with 38 rules applied. Total rules applied 161 place count 7 transition count 13
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 163 place count 7 transition count 11
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 place count 7 transition count 10
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 166 place count 6 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 167 place count 5 transition count 8
Applied a total of 167 rules in 14 ms. Remains 5 /1843 variables (removed 1838) and now considering 8/6519 (removed 6511) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 8 rows 5 cols
[2022-06-08 08:35:35] [INFO ] Computed 0 place invariants in 1 ms
[2022-06-08 08:35:35] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-08 08:35:35] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-08 08:35:35] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-06-08 08:35:35] [INFO ] After 40ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2022-06-08 08:35:35] [INFO ] Flatten gal took : 1 ms
[2022-06-08 08:35:35] [INFO ] Flatten gal took : 1 ms
[2022-06-08 08:35:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16711895463583460908.gal : 4 ms
[2022-06-08 08:35:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7712559673687326607.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms16246305191870446476;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16711895463583460908.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7712559673687326607.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality7712559673687326607.prop.
Reachability property apf2 is true.
SDD proceeding with computation,2 properties remain. new max is 2
SDD size :1 after 9
Reachability property apf1 is true.
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,19,0.004259,3936,2,12,8,79,6,0,27,50,0
Total reachable state count : 19
Verifying 3 reachability properties.
Reachability property apf0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,1,0.004483,3936,2,6,8,79,7,0,30,50,0
Reachability property apf1 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf1,1,0.004724,3936,2,6,8,79,8,0,34,50,0
Reachability property apf2 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf2,1,0.004953,3936,2,6,8,79,9,0,36,50,0
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 253 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 494 reset in 1202 ms.
Product exploration explored 100000 steps with 489 reset in 1238 ms.
Built C files in :
/tmp/ltsmin11706888133056722466
[2022-06-08 08:35:38] [INFO ] Too many transitions (6520) to apply POR reductions. Disabling POR matrices.
[2022-06-08 08:35:38] [INFO ] Built C files in 171ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11706888133056722466
Running compilation step : cd /tmp/ltsmin11706888133056722466;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11706888133056722466;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11706888133056722466;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 1844 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1844/1844 places, 6520/6520 transitions.
Applied a total of 0 rules in 256 ms. Remains 1844 /1844 variables (removed 0) and now considering 6520/6520 (removed 0) transitions.
// Phase 1: matrix 6520 rows 1844 cols
[2022-06-08 08:35:42] [INFO ] Computed 42 place invariants in 255 ms
[2022-06-08 08:35:43] [INFO ] Implicit Places using invariants in 1950 ms returned []
// Phase 1: matrix 6520 rows 1844 cols
[2022-06-08 08:35:44] [INFO ] Computed 42 place invariants in 142 ms
[2022-06-08 08:35:46] [INFO ] Implicit Places using invariants and state equation in 2898 ms returned []
Implicit Place search using SMT with State Equation took 4864 ms to find 0 implicit places.
[2022-06-08 08:35:47] [INFO ] Redundant transitions in 477 ms returned []
// Phase 1: matrix 6520 rows 1844 cols
[2022-06-08 08:35:47] [INFO ] Computed 42 place invariants in 142 ms
[2022-06-08 08:35:54] [INFO ] Dead Transitions using invariants and state equation in 7164 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1844/1844 places, 6520/6520 transitions.
Built C files in :
/tmp/ltsmin13201735657716251335
[2022-06-08 08:35:54] [INFO ] Too many transitions (6520) to apply POR reductions. Disabling POR matrices.
[2022-06-08 08:35:54] [INFO ] Built C files in 84ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13201735657716251335
Running compilation step : cd /tmp/ltsmin13201735657716251335;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13201735657716251335;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13201735657716251335;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-08 08:35:58] [INFO ] Flatten gal took : 198 ms
[2022-06-08 08:35:58] [INFO ] Flatten gal took : 249 ms
[2022-06-08 08:35:58] [INFO ] Time to serialize gal into /tmp/LTL8629145440774871859.gal : 47 ms
[2022-06-08 08:35:58] [INFO ] Time to serialize properties into /tmp/LTL4805930710515277099.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8629145440774871859.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4805930710515277099.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8629145...266
Read 1 LTL properties
Checking formula 0 : !((G((F((F("(Node0requestsent36<3)"))&&("(Node37GiveAnswer26>=2)")))||(F(G("(Node0requestsent36<3)"))))))
Formula 0 simplified : !G(F("(Node37GiveAnswer26>=2)" & F"(Node0requestsent36<3)") | FG"(Node0requestsent36<3)")
Detected timeout of ITS tools.
[2022-06-08 08:36:13] [INFO ] Flatten gal took : 193 ms
[2022-06-08 08:36:13] [INFO ] Applying decomposition
[2022-06-08 08:36:14] [INFO ] Flatten gal took : 183 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1066718013727434733.txt' '-o' '/tmp/graph1066718013727434733.bin' '-w' '/tmp/graph1066718013727434733.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1066718013727434733.bin' '-l' '-1' '-v' '-w' '/tmp/graph1066718013727434733.weights' '-q' '0' '-e' '0.001'
[2022-06-08 08:36:14] [INFO ] Decomposing Gal with order
[2022-06-08 08:36:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-08 08:36:16] [INFO ] Removed a total of 4817 redundant transitions.
[2022-06-08 08:36:17] [INFO ] Flatten gal took : 1831 ms
[2022-06-08 08:36:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 3121 labels/synchronizations in 534 ms.
[2022-06-08 08:36:17] [INFO ] Time to serialize gal into /tmp/LTL7682237300766147024.gal : 82 ms
[2022-06-08 08:36:17] [INFO ] Time to serialize properties into /tmp/LTL9811872343025015587.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7682237300766147024.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9811872343025015587.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7682237...245
Read 1 LTL properties
Checking formula 0 : !((G((F((F("(u1.Node0requestsent36<3)"))&&("(u27.Node37GiveAnswer26>=2)")))||(F(G("(u1.Node0requestsent36<3)"))))))
Formula 0 simplified : !G(F("(u27.Node37GiveAnswer26>=2)" & F"(u1.Node0requestsent36<3)") | FG"(u1.Node0requestsent36<3)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15905992808404769069
[2022-06-08 08:36:33] [INFO ] Built C files in 83ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15905992808404769069
Running compilation step : cd /tmp/ltsmin15905992808404769069;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15905992808404769069;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15905992808404769069;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-06 finished in 205573 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 2 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3678 place count 1844 transition count 8001
Drop transitions removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5159 place count 1844 transition count 6520
Applied a total of 5159 rules in 1663 ms. Remains 1844 /3683 variables (removed 1839) and now considering 6520/9840 (removed 3320) transitions.
// Phase 1: matrix 6520 rows 1844 cols
[2022-06-08 08:36:37] [INFO ] Computed 42 place invariants in 197 ms
[2022-06-08 08:36:39] [INFO ] Implicit Places using invariants in 1989 ms returned []
// Phase 1: matrix 6520 rows 1844 cols
[2022-06-08 08:36:39] [INFO ] Computed 42 place invariants in 138 ms
[2022-06-08 08:36:42] [INFO ] Implicit Places using invariants and state equation in 3066 ms returned []
Implicit Place search using SMT with State Equation took 5059 ms to find 0 implicit places.
[2022-06-08 08:36:43] [INFO ] Redundant transitions in 491 ms returned []
// Phase 1: matrix 6520 rows 1844 cols
[2022-06-08 08:36:43] [INFO ] Computed 42 place invariants in 149 ms
[2022-06-08 08:36:50] [INFO ] Dead Transitions using invariants and state equation in 7026 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1844/3683 places, 6520/9840 transitions.
Finished structural reductions, in 1 iterations. Remains : 1844/3683 places, 6520/9840 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 2 s1373)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 492 reset in 1253 ms.
Product exploration explored 100000 steps with 492 reset in 1341 ms.
Computed a total of 123 stabilizing places and 200 stable transitions
Computed a total of 123 stabilizing places and 200 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 48 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 93594 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 93594 steps, saw 28137 distinct states, run finished after 3002 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 6520 rows 1844 cols
[2022-06-08 08:36:56] [INFO ] Computed 42 place invariants in 233 ms
[2022-06-08 08:36:57] [INFO ] [Real]Absence check using 40 positive place invariants in 36 ms returned sat
[2022-06-08 08:36:57] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 43 ms returned sat
[2022-06-08 08:36:59] [INFO ] After 2494ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-08 08:36:59] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2022-06-08 08:37:00] [INFO ] After 1096ms SMT Verify possible using 4757 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 08:37:00] [INFO ] After 4211ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 08:37:01] [INFO ] [Nat]Absence check using 40 positive place invariants in 42 ms returned sat
[2022-06-08 08:37:01] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 42 ms returned sat
[2022-06-08 08:37:04] [INFO ] After 2571ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-08 08:37:05] [INFO ] After 1747ms SMT Verify possible using 4757 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-08 08:37:06] [INFO ] After 2179ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 307 ms.
[2022-06-08 08:37:06] [INFO ] After 5625ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 1844 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1844/1844 places, 6520/6520 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1844 transition count 6519
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1843 transition count 6519
Partial Free-agglomeration rule applied 1641 times.
Drop transitions removed 1641 transitions
Iterating global reduction 1 with 1641 rules applied. Total rules applied 1643 place count 1843 transition count 6519
Applied a total of 1643 rules in 1050 ms. Remains 1843 /1844 variables (removed 1) and now considering 6519/6520 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 1843/1844 places, 6519/6520 transitions.
Incomplete random walk after 10000 steps, including 54 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 81662 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 81662 steps, saw 25213 distinct states, run finished after 3002 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 6519 rows 1843 cols
[2022-06-08 08:37:11] [INFO ] Computed 42 place invariants in 308 ms
[2022-06-08 08:37:11] [INFO ] [Real]Absence check using 40 positive place invariants in 39 ms returned sat
[2022-06-08 08:37:11] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 43 ms returned sat
[2022-06-08 08:37:15] [INFO ] After 4014ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-08 08:37:15] [INFO ] State equation strengthened by 6397 read => feed constraints.
[2022-06-08 08:37:17] [INFO ] After 1293ms SMT Verify possible using 6397 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 08:37:17] [INFO ] After 5938ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 08:37:17] [INFO ] [Nat]Absence check using 40 positive place invariants in 41 ms returned sat
[2022-06-08 08:37:17] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 27 ms returned sat
[2022-06-08 08:37:21] [INFO ] After 3898ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-08 08:37:23] [INFO ] After 1836ms SMT Verify possible using 6397 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-08 08:37:23] [INFO ] After 2287ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 279 ms.
[2022-06-08 08:37:24] [INFO ] After 6960ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 1843 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 486 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1843/1843 places, 6519/6519 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 347 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
// Phase 1: matrix 6519 rows 1843 cols
[2022-06-08 08:37:25] [INFO ] Computed 42 place invariants in 307 ms
[2022-06-08 08:37:28] [INFO ] Implicit Places using invariants in 3969 ms returned []
// Phase 1: matrix 6519 rows 1843 cols
[2022-06-08 08:37:29] [INFO ] Computed 42 place invariants in 185 ms
[2022-06-08 08:37:32] [INFO ] Implicit Places using invariants and state equation in 3924 ms returned []
Implicit Place search using SMT with State Equation took 7898 ms to find 0 implicit places.
[2022-06-08 08:37:33] [INFO ] Redundant transitions in 497 ms returned []
// Phase 1: matrix 6519 rows 1843 cols
[2022-06-08 08:37:33] [INFO ] Computed 42 place invariants in 202 ms
[2022-06-08 08:37:39] [INFO ] Dead Transitions using invariants and state equation in 5950 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1843/1843 places, 6519/6519 transitions.
Graph (trivial) has 6276 edges and 1843 vertex of which 1679 / 1843 are part of one of the 2 SCC in 1 ms
Free SCC test removed 1677 places
Drop transitions removed 4718 transitions
Ensure Unique test removed 1632 transitions
Reduce isomorphic transitions removed 6350 transitions.
Graph (complete) has 411 edges and 166 vertex of which 45 are kept as prefixes of interest. Removing 121 places using SCC suffix rule.0 ms
Discarding 121 places :
Also discarding 39 output transitions
Drop transitions removed 39 transitions
Drop transitions removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 82 rules applied. Total rules applied 84 place count 45 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 85 place count 44 transition count 48
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 123 place count 6 transition count 10
Iterating global reduction 2 with 38 rules applied. Total rules applied 161 place count 6 transition count 10
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 163 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 166 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 167 place count 4 transition count 5
Applied a total of 167 rules in 24 ms. Remains 4 /1843 variables (removed 1839) and now considering 5/6519 (removed 6514) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 4 cols
[2022-06-08 08:37:39] [INFO ] Computed 0 place invariants in 0 ms
[2022-06-08 08:37:39] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 08:37:39] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-08 08:37:39] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-06-08 08:37:39] [INFO ] After 28ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-08 08:37:39] [INFO ] Flatten gal took : 1 ms
[2022-06-08 08:37:39] [INFO ] Flatten gal took : 2 ms
[2022-06-08 08:37:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17910478854114254518.gal : 1 ms
[2022-06-08 08:37:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4968884306190016775.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms16945454323919086601;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17910478854114254518.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4968884306190016775.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality4968884306190016775.prop.
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6,0.002959,3488,2,7,6,33,6,0,21,18,0
Total reachable state count : 6
Verifying 1 reachability properties.
Reachability property apf0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,1,0.003314,3928,2,5,6,33,7,0,24,18,0
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 1844 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1844/1844 places, 6520/6520 transitions.
Applied a total of 0 rules in 407 ms. Remains 1844 /1844 variables (removed 0) and now considering 6520/6520 (removed 0) transitions.
// Phase 1: matrix 6520 rows 1844 cols
[2022-06-08 08:37:40] [INFO ] Computed 42 place invariants in 165 ms
[2022-06-08 08:37:41] [INFO ] Implicit Places using invariants in 1542 ms returned []
// Phase 1: matrix 6520 rows 1844 cols
[2022-06-08 08:37:41] [INFO ] Computed 42 place invariants in 233 ms
[2022-06-08 08:37:44] [INFO ] Implicit Places using invariants and state equation in 2679 ms returned []
Implicit Place search using SMT with State Equation took 4225 ms to find 0 implicit places.
[2022-06-08 08:37:44] [INFO ] Redundant transitions in 539 ms returned []
// Phase 1: matrix 6520 rows 1844 cols
[2022-06-08 08:37:45] [INFO ] Computed 42 place invariants in 214 ms
[2022-06-08 08:37:51] [INFO ] Dead Transitions using invariants and state equation in 6470 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1844/1844 places, 6520/6520 transitions.
Computed a total of 123 stabilizing places and 200 stable transitions
Computed a total of 123 stabilizing places and 200 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 49 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 74397 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 74397 steps, saw 25692 distinct states, run finished after 3005 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 6520 rows 1844 cols
[2022-06-08 08:37:54] [INFO ] Computed 42 place invariants in 138 ms
[2022-06-08 08:37:55] [INFO ] [Real]Absence check using 40 positive place invariants in 42 ms returned sat
[2022-06-08 08:37:55] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 44 ms returned sat
[2022-06-08 08:37:58] [INFO ] After 2772ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-08 08:37:58] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2022-06-08 08:37:59] [INFO ] After 901ms SMT Verify possible using 4757 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 08:37:59] [INFO ] After 4178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 08:37:59] [INFO ] [Nat]Absence check using 40 positive place invariants in 41 ms returned sat
[2022-06-08 08:37:59] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 44 ms returned sat
[2022-06-08 08:38:02] [INFO ] After 2500ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-08 08:38:03] [INFO ] After 1689ms SMT Verify possible using 4757 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-08 08:38:04] [INFO ] After 2044ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 352 ms.
[2022-06-08 08:38:04] [INFO ] After 5431ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 1844 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1844/1844 places, 6520/6520 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1844 transition count 6519
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1843 transition count 6519
Partial Free-agglomeration rule applied 1641 times.
Drop transitions removed 1641 transitions
Iterating global reduction 1 with 1641 rules applied. Total rules applied 1643 place count 1843 transition count 6519
Applied a total of 1643 rules in 1020 ms. Remains 1843 /1844 variables (removed 1) and now considering 6519/6520 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 1843/1844 places, 6519/6520 transitions.
Incomplete random walk after 10000 steps, including 52 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 93290 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 93290 steps, saw 26701 distinct states, run finished after 3004 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 6519 rows 1843 cols
[2022-06-08 08:38:08] [INFO ] Computed 42 place invariants in 193 ms
[2022-06-08 08:38:09] [INFO ] [Real]Absence check using 40 positive place invariants in 28 ms returned sat
[2022-06-08 08:38:09] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 26 ms returned sat
[2022-06-08 08:38:13] [INFO ] After 3914ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-08 08:38:13] [INFO ] State equation strengthened by 6397 read => feed constraints.
[2022-06-08 08:38:14] [INFO ] After 1449ms SMT Verify possible using 6397 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 08:38:14] [INFO ] After 5848ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 08:38:15] [INFO ] [Nat]Absence check using 40 positive place invariants in 25 ms returned sat
[2022-06-08 08:38:15] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 26 ms returned sat
[2022-06-08 08:38:18] [INFO ] After 3684ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-08 08:38:20] [INFO ] After 1668ms SMT Verify possible using 6397 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-08 08:38:20] [INFO ] After 2049ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 227 ms.
[2022-06-08 08:38:21] [INFO ] After 6329ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 1843 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 403 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1843/1843 places, 6519/6519 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 349 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
// Phase 1: matrix 6519 rows 1843 cols
[2022-06-08 08:38:22] [INFO ] Computed 42 place invariants in 180 ms
[2022-06-08 08:38:25] [INFO ] Implicit Places using invariants in 4154 ms returned []
// Phase 1: matrix 6519 rows 1843 cols
[2022-06-08 08:38:26] [INFO ] Computed 42 place invariants in 182 ms
[2022-06-08 08:38:29] [INFO ] Implicit Places using invariants and state equation in 3626 ms returned []
Implicit Place search using SMT with State Equation took 7795 ms to find 0 implicit places.
[2022-06-08 08:38:30] [INFO ] Redundant transitions in 498 ms returned []
// Phase 1: matrix 6519 rows 1843 cols
[2022-06-08 08:38:30] [INFO ] Computed 42 place invariants in 307 ms
[2022-06-08 08:38:36] [INFO ] Dead Transitions using invariants and state equation in 6493 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1843/1843 places, 6519/6519 transitions.
Graph (trivial) has 6276 edges and 1843 vertex of which 1679 / 1843 are part of one of the 2 SCC in 2 ms
Free SCC test removed 1677 places
Drop transitions removed 4718 transitions
Ensure Unique test removed 1632 transitions
Reduce isomorphic transitions removed 6350 transitions.
Graph (complete) has 411 edges and 166 vertex of which 45 are kept as prefixes of interest. Removing 121 places using SCC suffix rule.0 ms
Discarding 121 places :
Also discarding 39 output transitions
Drop transitions removed 39 transitions
Drop transitions removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 82 rules applied. Total rules applied 84 place count 45 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 85 place count 44 transition count 48
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 123 place count 6 transition count 10
Iterating global reduction 2 with 38 rules applied. Total rules applied 161 place count 6 transition count 10
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 163 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 166 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 167 place count 4 transition count 5
Applied a total of 167 rules in 25 ms. Remains 4 /1843 variables (removed 1839) and now considering 5/6519 (removed 6514) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 4 cols
[2022-06-08 08:38:36] [INFO ] Computed 0 place invariants in 1 ms
[2022-06-08 08:38:36] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 08:38:36] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-08 08:38:36] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-06-08 08:38:36] [INFO ] After 28ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-08 08:38:36] [INFO ] Flatten gal took : 0 ms
[2022-06-08 08:38:36] [INFO ] Flatten gal took : 0 ms
[2022-06-08 08:38:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10553604078376746478.gal : 1 ms
[2022-06-08 08:38:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8725092739472984235.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms17984923847826933845;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10553604078376746478.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8725092739472984235.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality8725092739472984235.prop.
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6,0.004297,3488,2,7,6,33,6,0,21,18,0
Total reachable state count : 6
Verifying 1 reachability properties.
Reachability property apf0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,1,0.004854,3928,2,5,6,33,7,0,24,18,0
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 494 reset in 1152 ms.
Product exploration explored 100000 steps with 495 reset in 1200 ms.
Built C files in :
/tmp/ltsmin6549718432973972797
[2022-06-08 08:38:39] [INFO ] Too many transitions (6520) to apply POR reductions. Disabling POR matrices.
[2022-06-08 08:38:39] [INFO ] Built C files in 116ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6549718432973972797
Running compilation step : cd /tmp/ltsmin6549718432973972797;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6549718432973972797;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6549718432973972797;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 1 out of 1844 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1844/1844 places, 6520/6520 transitions.
Applied a total of 0 rules in 250 ms. Remains 1844 /1844 variables (removed 0) and now considering 6520/6520 (removed 0) transitions.
// Phase 1: matrix 6520 rows 1844 cols
[2022-06-08 08:38:43] [INFO ] Computed 42 place invariants in 153 ms
[2022-06-08 08:38:44] [INFO ] Implicit Places using invariants in 1820 ms returned []
// Phase 1: matrix 6520 rows 1844 cols
[2022-06-08 08:38:44] [INFO ] Computed 42 place invariants in 150 ms
[2022-06-08 08:38:47] [INFO ] Implicit Places using invariants and state equation in 2941 ms returned []
Implicit Place search using SMT with State Equation took 4762 ms to find 0 implicit places.
[2022-06-08 08:38:48] [INFO ] Redundant transitions in 476 ms returned []
// Phase 1: matrix 6520 rows 1844 cols
[2022-06-08 08:38:48] [INFO ] Computed 42 place invariants in 150 ms
[2022-06-08 08:38:55] [INFO ] Dead Transitions using invariants and state equation in 7218 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1844/1844 places, 6520/6520 transitions.
Built C files in :
/tmp/ltsmin17471958709332008292
[2022-06-08 08:38:55] [INFO ] Too many transitions (6520) to apply POR reductions. Disabling POR matrices.
[2022-06-08 08:38:55] [INFO ] Built C files in 86ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17471958709332008292
Running compilation step : cd /tmp/ltsmin17471958709332008292;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17471958709332008292;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17471958709332008292;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-08 08:38:58] [INFO ] Flatten gal took : 231 ms
[2022-06-08 08:38:59] [INFO ] Flatten gal took : 236 ms
[2022-06-08 08:38:59] [INFO ] Time to serialize gal into /tmp/LTL3044102008661110832.gal : 42 ms
[2022-06-08 08:38:59] [INFO ] Time to serialize properties into /tmp/LTL10678128840603910928.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3044102008661110832.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10678128840603910928.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3044102...267
Read 1 LTL properties
Checking formula 0 : !((G(F("(Node28GiveAnswer9<2)"))))
Formula 0 simplified : !GF"(Node28GiveAnswer9<2)"
Detected timeout of ITS tools.
[2022-06-08 08:39:14] [INFO ] Flatten gal took : 157 ms
[2022-06-08 08:39:14] [INFO ] Applying decomposition
[2022-06-08 08:39:14] [INFO ] Flatten gal took : 157 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2764293630311056739.txt' '-o' '/tmp/graph2764293630311056739.bin' '-w' '/tmp/graph2764293630311056739.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2764293630311056739.bin' '-l' '-1' '-v' '-w' '/tmp/graph2764293630311056739.weights' '-q' '0' '-e' '0.001'
[2022-06-08 08:39:14] [INFO ] Decomposing Gal with order
[2022-06-08 08:39:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-08 08:39:15] [INFO ] Removed a total of 4787 redundant transitions.
[2022-06-08 08:39:16] [INFO ] Flatten gal took : 906 ms
[2022-06-08 08:39:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 3121 labels/synchronizations in 591 ms.
[2022-06-08 08:39:16] [INFO ] Time to serialize gal into /tmp/LTL2046912449982047079.gal : 32 ms
[2022-06-08 08:39:16] [INFO ] Time to serialize properties into /tmp/LTL5800884485891233993.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2046912449982047079.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5800884485891233993.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2046912...245
Read 1 LTL properties
Checking formula 0 : !((G(F("(u10.Node28GiveAnswer9<2)"))))
Formula 0 simplified : !GF"(u10.Node28GiveAnswer9<2)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8265593201516302552
[2022-06-08 08:39:31] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8265593201516302552
Running compilation step : cd /tmp/ltsmin8265593201516302552;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8265593201516302552;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8265593201516302552;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-07 finished in 178765 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 342 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2022-06-08 08:39:35] [INFO ] Computed 42 place invariants in 504 ms
[2022-06-08 08:39:36] [INFO ] Implicit Places using invariants in 1766 ms returned []
// Phase 1: matrix 9840 rows 3683 cols
[2022-06-08 08:39:37] [INFO ] Computed 42 place invariants in 501 ms
[2022-06-08 08:39:38] [INFO ] Implicit Places using invariants and state equation in 1616 ms returned []
Implicit Place search using SMT with State Equation took 3392 ms to find 0 implicit places.
// Phase 1: matrix 9840 rows 3683 cols
[2022-06-08 08:39:39] [INFO ] Computed 42 place invariants in 544 ms
[2022-06-08 08:39:49] [INFO ] Dead Transitions using invariants and state equation in 11059 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GT s1402 s1835) (GT 2 s1180))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 4929 ms.
Product exploration explored 100000 steps with 50000 reset in 4914 ms.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 58 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-10 finished in 24867 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U p1))'
Support contains 3 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 278 transitions
Trivial Post-agglo rules discarded 278 transitions
Performed 278 trivial Post agglomeration. Transition count delta: 278
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 3683 transition count 9562
Reduce places removed 278 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 279 rules applied. Total rules applied 557 place count 3405 transition count 9561
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 558 place count 3404 transition count 9561
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 558 place count 3404 transition count 9560
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 3 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 3 with 3118 rules applied. Total rules applied 3678 place count 1844 transition count 8001
Drop transitions removed 1482 transitions
Redundant transition composition rules discarded 1482 transitions
Iterating global reduction 3 with 1482 rules applied. Total rules applied 5160 place count 1844 transition count 6519
Applied a total of 5160 rules in 1600 ms. Remains 1844 /3683 variables (removed 1839) and now considering 6519/9840 (removed 3321) transitions.
// Phase 1: matrix 6519 rows 1844 cols
[2022-06-08 08:40:01] [INFO ] Computed 42 place invariants in 183 ms
[2022-06-08 08:40:03] [INFO ] Implicit Places using invariants in 2497 ms returned []
// Phase 1: matrix 6519 rows 1844 cols
[2022-06-08 08:40:04] [INFO ] Computed 42 place invariants in 160 ms
[2022-06-08 08:40:07] [INFO ] Implicit Places using invariants and state equation in 3627 ms returned []
Implicit Place search using SMT with State Equation took 6145 ms to find 0 implicit places.
[2022-06-08 08:40:08] [INFO ] Redundant transitions in 563 ms returned []
// Phase 1: matrix 6519 rows 1844 cols
[2022-06-08 08:40:08] [INFO ] Computed 42 place invariants in 171 ms
[2022-06-08 08:40:15] [INFO ] Dead Transitions using invariants and state equation in 7723 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1844/3683 places, 6519/9840 transitions.
Finished structural reductions, in 1 iterations. Remains : 1844/3683 places, 6519/9840 transitions.
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(LEQ 1 s871), p0:(LEQ s73 s792)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 109 steps with 0 reset in 3 ms.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-11 finished in 16143 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((X(p0) U p1)||p1)))'
Support contains 1 out of 3683 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 3 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3678 place count 1844 transition count 8001
Drop transitions removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5159 place count 1844 transition count 6520
Applied a total of 5159 rules in 1714 ms. Remains 1844 /3683 variables (removed 1839) and now considering 6520/9840 (removed 3320) transitions.
// Phase 1: matrix 6520 rows 1844 cols
[2022-06-08 08:40:17] [INFO ] Computed 42 place invariants in 211 ms
[2022-06-08 08:40:19] [INFO ] Implicit Places using invariants in 2318 ms returned []
// Phase 1: matrix 6520 rows 1844 cols
[2022-06-08 08:40:20] [INFO ] Computed 42 place invariants in 246 ms
[2022-06-08 08:40:23] [INFO ] Implicit Places using invariants and state equation in 3537 ms returned []
Implicit Place search using SMT with State Equation took 5857 ms to find 0 implicit places.
[2022-06-08 08:40:23] [INFO ] Redundant transitions in 508 ms returned []
// Phase 1: matrix 6520 rows 1844 cols
[2022-06-08 08:40:24] [INFO ] Computed 42 place invariants in 152 ms
[2022-06-08 08:40:29] [INFO ] Dead Transitions using invariants and state equation in 5802 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1844/3683 places, 6520/9840 transitions.
Finished structural reductions, in 1 iterations. Remains : 1844/3683 places, 6520/9840 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(LEQ 1 s515)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 190 steps with 0 reset in 2 ms.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-12 finished in 13971 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G(p1)))'
Support contains 4 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 354 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2022-06-08 08:40:30] [INFO ] Computed 42 place invariants in 768 ms
[2022-06-08 08:40:32] [INFO ] Implicit Places using invariants in 2029 ms returned []
// Phase 1: matrix 9840 rows 3683 cols
[2022-06-08 08:40:33] [INFO ] Computed 42 place invariants in 788 ms
[2022-06-08 08:40:33] [INFO ] Implicit Places using invariants and state equation in 1559 ms returned []
Implicit Place search using SMT with State Equation took 3597 ms to find 0 implicit places.
// Phase 1: matrix 9840 rows 3683 cols
[2022-06-08 08:40:34] [INFO ] Computed 42 place invariants in 739 ms
[2022-06-08 08:40:43] [INFO ] Dead Transitions using invariants and state equation in 9481 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 174 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(LEQ s2816 s2884), p1:(GT s361 s2733)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 4929 ms.
Product exploration explored 100000 steps with 50000 reset in 5112 ms.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 6 factoid took 90 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-13 finished in 23798 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(!(X(F(p0)) U !(F(p1) U p2))))))'
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1560 Post agglomeration using F-continuation condition.Transition count delta: 1560
Deduced a syphon composed of 1560 places in 3 ms
Reduce places removed 1560 places and 0 transitions.
Iterating global reduction 2 with 3120 rules applied. Total rules applied 3680 place count 1843 transition count 8000
Drop transitions removed 1482 transitions
Redundant transition composition rules discarded 1482 transitions
Iterating global reduction 2 with 1482 rules applied. Total rules applied 5162 place count 1843 transition count 6518
Applied a total of 5162 rules in 1753 ms. Remains 1843 /3683 variables (removed 1840) and now considering 6518/9840 (removed 3322) transitions.
// Phase 1: matrix 6518 rows 1843 cols
[2022-06-08 08:40:55] [INFO ] Computed 42 place invariants in 230 ms
[2022-06-08 08:40:57] [INFO ] Implicit Places using invariants in 2036 ms returned []
// Phase 1: matrix 6518 rows 1843 cols
[2022-06-08 08:40:57] [INFO ] Computed 42 place invariants in 233 ms
[2022-06-08 08:40:59] [INFO ] Implicit Places using invariants and state equation in 2256 ms returned []
Implicit Place search using SMT with State Equation took 4322 ms to find 0 implicit places.
[2022-06-08 08:41:00] [INFO ] Redundant transitions in 521 ms returned []
// Phase 1: matrix 6518 rows 1843 cols
[2022-06-08 08:41:00] [INFO ] Computed 42 place invariants in 230 ms
[2022-06-08 08:41:06] [INFO ] Dead Transitions using invariants and state equation in 5886 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1843/3683 places, 6518/9840 transitions.
Finished structural reductions, in 1 iterations. Remains : 1843/3683 places, 6518/9840 transitions.
Stuttering acceptance computed with spot in 221 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={1} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND p2 (NOT p1) p0), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p2:(GT s473 s602), p1:(LEQ 2 s1483), p0:(LEQ s280 s270)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 208 steps with 0 reset in 11 ms.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-14 finished in 12809 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1558 Post agglomeration using F-continuation condition.Transition count delta: 1558
Deduced a syphon composed of 1558 places in 2 ms
Reduce places removed 1558 places and 0 transitions.
Iterating global reduction 2 with 3116 rules applied. Total rules applied 3676 place count 1845 transition count 8002
Drop transitions removed 1480 transitions
Redundant transition composition rules discarded 1480 transitions
Iterating global reduction 2 with 1480 rules applied. Total rules applied 5156 place count 1845 transition count 6522
Applied a total of 5156 rules in 1686 ms. Remains 1845 /3683 variables (removed 1838) and now considering 6522/9840 (removed 3318) transitions.
// Phase 1: matrix 6522 rows 1845 cols
[2022-06-08 08:41:08] [INFO ] Computed 42 place invariants in 237 ms
[2022-06-08 08:41:09] [INFO ] Implicit Places using invariants in 1567 ms returned []
// Phase 1: matrix 6522 rows 1845 cols
[2022-06-08 08:41:09] [INFO ] Computed 42 place invariants in 234 ms
[2022-06-08 08:41:12] [INFO ] Implicit Places using invariants and state equation in 2775 ms returned []
Implicit Place search using SMT with State Equation took 4369 ms to find 0 implicit places.
[2022-06-08 08:41:13] [INFO ] Redundant transitions in 716 ms returned []
// Phase 1: matrix 6522 rows 1845 cols
[2022-06-08 08:41:13] [INFO ] Computed 42 place invariants in 145 ms
[2022-06-08 08:41:19] [INFO ] Dead Transitions using invariants and state equation in 5920 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1845/3683 places, 6522/9840 transitions.
Finished structural reductions, in 1 iterations. Remains : 1845/3683 places, 6522/9840 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-15 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:(OR (GT 3 s930) (GT s744 s552))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 489 reset in 1434 ms.
Product exploration explored 100000 steps with 490 reset in 1388 ms.
Computed a total of 123 stabilizing places and 200 stable transitions
Computed a total of 123 stabilizing places and 200 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 49 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 92317 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 92317 steps, saw 27994 distinct states, run finished after 3003 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 6522 rows 1845 cols
[2022-06-08 08:41:25] [INFO ] Computed 42 place invariants in 215 ms
[2022-06-08 08:41:26] [INFO ] [Real]Absence check using 40 positive place invariants in 36 ms returned sat
[2022-06-08 08:41:26] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 39 ms returned sat
[2022-06-08 08:41:29] [INFO ] After 3527ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 08:41:29] [INFO ] [Nat]Absence check using 40 positive place invariants in 30 ms returned sat
[2022-06-08 08:41:29] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 41 ms returned sat
[2022-06-08 08:41:33] [INFO ] After 3757ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-08 08:41:33] [INFO ] State equation strengthened by 4756 read => feed constraints.
[2022-06-08 08:41:35] [INFO ] After 2056ms SMT Verify possible using 4756 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-08 08:41:36] [INFO ] After 2623ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 273 ms.
[2022-06-08 08:41:36] [INFO ] After 7146ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 1845 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1845/1845 places, 6522/6522 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1845 transition count 6521
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1844 transition count 6521
Partial Free-agglomeration rule applied 1640 times.
Drop transitions removed 1640 transitions
Iterating global reduction 1 with 1640 rules applied. Total rules applied 1642 place count 1844 transition count 6521
Applied a total of 1642 rules in 1039 ms. Remains 1844 /1845 variables (removed 1) and now considering 6521/6522 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 1844/1845 places, 6521/6522 transitions.
Incomplete random walk after 10000 steps, including 54 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 83037 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 83037 steps, saw 25416 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 6521 rows 1844 cols
[2022-06-08 08:41:40] [INFO ] Computed 42 place invariants in 167 ms
[2022-06-08 08:41:41] [INFO ] [Real]Absence check using 40 positive place invariants in 41 ms returned sat
[2022-06-08 08:41:41] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 47 ms returned sat
[2022-06-08 08:41:44] [INFO ] After 3815ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 08:41:45] [INFO ] [Nat]Absence check using 40 positive place invariants in 36 ms returned sat
[2022-06-08 08:41:45] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 39 ms returned sat
[2022-06-08 08:41:48] [INFO ] After 3027ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-08 08:41:48] [INFO ] State equation strengthened by 6395 read => feed constraints.
[2022-06-08 08:41:50] [INFO ] After 2425ms SMT Verify possible using 6395 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-08 08:41:51] [INFO ] After 2800ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 451 ms.
[2022-06-08 08:41:51] [INFO ] After 6970ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 1844 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1844/1844 places, 6521/6521 transitions.
Applied a total of 0 rules in 445 ms. Remains 1844 /1844 variables (removed 0) and now considering 6521/6521 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1844/1844 places, 6521/6521 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1844/1844 places, 6521/6521 transitions.
Applied a total of 0 rules in 282 ms. Remains 1844 /1844 variables (removed 0) and now considering 6521/6521 (removed 0) transitions.
// Phase 1: matrix 6521 rows 1844 cols
[2022-06-08 08:41:52] [INFO ] Computed 42 place invariants in 167 ms
[2022-06-08 08:41:55] [INFO ] Implicit Places using invariants in 3358 ms returned []
// Phase 1: matrix 6521 rows 1844 cols
[2022-06-08 08:41:55] [INFO ] Computed 42 place invariants in 167 ms
[2022-06-08 08:42:02] [INFO ] Implicit Places using invariants and state equation in 6658 ms returned []
Implicit Place search using SMT with State Equation took 10025 ms to find 0 implicit places.
[2022-06-08 08:42:03] [INFO ] Redundant transitions in 693 ms returned []
// Phase 1: matrix 6521 rows 1844 cols
[2022-06-08 08:42:03] [INFO ] Computed 42 place invariants in 283 ms
[2022-06-08 08:42:08] [INFO ] Dead Transitions using invariants and state equation in 5535 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1844/1844 places, 6521/6521 transitions.
Graph (trivial) has 6270 edges and 1844 vertex of which 1678 / 1844 are part of one of the 2 SCC in 1 ms
Free SCC test removed 1676 places
Drop transitions removed 4714 transitions
Ensure Unique test removed 1632 transitions
Reduce isomorphic transitions removed 6346 transitions.
Graph (complete) has 417 edges and 168 vertex of which 47 are kept as prefixes of interest. Removing 121 places using SCC suffix rule.0 ms
Discarding 121 places :
Also discarding 39 output transitions
Drop transitions removed 39 transitions
Drop transitions removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 82 rules applied. Total rules applied 84 place count 47 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 85 place count 46 transition count 54
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 123 place count 8 transition count 16
Iterating global reduction 2 with 38 rules applied. Total rules applied 161 place count 8 transition count 16
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 163 place count 8 transition count 14
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 place count 8 transition count 13
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 166 place count 7 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 167 place count 6 transition count 11
Applied a total of 167 rules in 31 ms. Remains 6 /1844 variables (removed 1838) and now considering 11/6521 (removed 6510) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 6 cols
[2022-06-08 08:42:08] [INFO ] Computed 0 place invariants in 0 ms
[2022-06-08 08:42:08] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 08:42:08] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-08 08:42:08] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-06-08 08:42:08] [INFO ] After 48ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-08 08:42:08] [INFO ] Flatten gal took : 1 ms
[2022-06-08 08:42:08] [INFO ] Flatten gal took : 0 ms
[2022-06-08 08:42:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3087545157875689985.gal : 1 ms
[2022-06-08 08:42:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5351278197341831694.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms8760500792593837344;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3087545157875689985.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5351278197341831694.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality5351278197341831694.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 5 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,34,0.004227,3512,2,16,7,109,6,0,33,75,0
Total reachable state count : 34
Verifying 1 reachability properties.
Reachability property apf0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,1,0.004765,3952,2,7,7,109,7,0,41,75,0
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 1845 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1845/1845 places, 6522/6522 transitions.
Applied a total of 0 rules in 373 ms. Remains 1845 /1845 variables (removed 0) and now considering 6522/6522 (removed 0) transitions.
// Phase 1: matrix 6522 rows 1845 cols
[2022-06-08 08:42:09] [INFO ] Computed 42 place invariants in 233 ms
[2022-06-08 08:42:10] [INFO ] Implicit Places using invariants in 1535 ms returned []
// Phase 1: matrix 6522 rows 1845 cols
[2022-06-08 08:42:11] [INFO ] Computed 42 place invariants in 228 ms
[2022-06-08 08:42:12] [INFO ] Implicit Places using invariants and state equation in 1520 ms returned []
Implicit Place search using SMT with State Equation took 3064 ms to find 0 implicit places.
[2022-06-08 08:42:13] [INFO ] Redundant transitions in 737 ms returned []
// Phase 1: matrix 6522 rows 1845 cols
[2022-06-08 08:42:13] [INFO ] Computed 42 place invariants in 140 ms
[2022-06-08 08:42:18] [INFO ] Dead Transitions using invariants and state equation in 5573 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1845/1845 places, 6522/6522 transitions.
Computed a total of 123 stabilizing places and 200 stable transitions
Computed a total of 123 stabilizing places and 200 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 48 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 91572 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 91572 steps, saw 27901 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 6522 rows 1845 cols
[2022-06-08 08:42:22] [INFO ] Computed 42 place invariants in 139 ms
[2022-06-08 08:42:22] [INFO ] [Real]Absence check using 40 positive place invariants in 24 ms returned sat
[2022-06-08 08:42:22] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 25 ms returned sat
[2022-06-08 08:42:25] [INFO ] After 3427ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 08:42:26] [INFO ] [Nat]Absence check using 40 positive place invariants in 24 ms returned sat
[2022-06-08 08:42:26] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 25 ms returned sat
[2022-06-08 08:42:29] [INFO ] After 3339ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-08 08:42:29] [INFO ] State equation strengthened by 4756 read => feed constraints.
[2022-06-08 08:42:31] [INFO ] After 2206ms SMT Verify possible using 4756 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-08 08:42:32] [INFO ] After 2576ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 317 ms.
[2022-06-08 08:42:32] [INFO ] After 6664ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 1845 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1845/1845 places, 6522/6522 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1845 transition count 6521
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1844 transition count 6521
Partial Free-agglomeration rule applied 1640 times.
Drop transitions removed 1640 transitions
Iterating global reduction 1 with 1640 rules applied. Total rules applied 1642 place count 1844 transition count 6521
Applied a total of 1642 rules in 1061 ms. Remains 1844 /1845 variables (removed 1) and now considering 6521/6522 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 1844/1845 places, 6521/6522 transitions.
Incomplete random walk after 10000 steps, including 54 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 94974 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 94974 steps, saw 26942 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 6521 rows 1844 cols
[2022-06-08 08:42:36] [INFO ] Computed 42 place invariants in 267 ms
[2022-06-08 08:42:37] [INFO ] [Real]Absence check using 40 positive place invariants in 40 ms returned sat
[2022-06-08 08:42:37] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 43 ms returned sat
[2022-06-08 08:42:40] [INFO ] After 3627ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 08:42:40] [INFO ] [Nat]Absence check using 40 positive place invariants in 27 ms returned sat
[2022-06-08 08:42:40] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 29 ms returned sat
[2022-06-08 08:42:43] [INFO ] After 2804ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-08 08:42:43] [INFO ] State equation strengthened by 6395 read => feed constraints.
[2022-06-08 08:42:46] [INFO ] After 2219ms SMT Verify possible using 6395 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-08 08:42:46] [INFO ] After 2571ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 286 ms.
[2022-06-08 08:42:46] [INFO ] After 6157ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 1844 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1844/1844 places, 6521/6521 transitions.
Applied a total of 0 rules in 447 ms. Remains 1844 /1844 variables (removed 0) and now considering 6521/6521 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1844/1844 places, 6521/6521 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1844/1844 places, 6521/6521 transitions.
Applied a total of 0 rules in 287 ms. Remains 1844 /1844 variables (removed 0) and now considering 6521/6521 (removed 0) transitions.
// Phase 1: matrix 6521 rows 1844 cols
[2022-06-08 08:42:47] [INFO ] Computed 42 place invariants in 169 ms
[2022-06-08 08:42:50] [INFO ] Implicit Places using invariants in 2701 ms returned []
// Phase 1: matrix 6521 rows 1844 cols
[2022-06-08 08:42:50] [INFO ] Computed 42 place invariants in 286 ms
[2022-06-08 08:42:56] [INFO ] Implicit Places using invariants and state equation in 6731 ms returned []
Implicit Place search using SMT with State Equation took 9453 ms to find 0 implicit places.
[2022-06-08 08:42:57] [INFO ] Redundant transitions in 791 ms returned []
// Phase 1: matrix 6521 rows 1844 cols
[2022-06-08 08:42:57] [INFO ] Computed 42 place invariants in 181 ms
[2022-06-08 08:43:03] [INFO ] Dead Transitions using invariants and state equation in 5584 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1844/1844 places, 6521/6521 transitions.
Graph (trivial) has 6270 edges and 1844 vertex of which 1678 / 1844 are part of one of the 2 SCC in 3 ms
Free SCC test removed 1676 places
Drop transitions removed 4714 transitions
Ensure Unique test removed 1632 transitions
Reduce isomorphic transitions removed 6346 transitions.
Graph (complete) has 417 edges and 168 vertex of which 47 are kept as prefixes of interest. Removing 121 places using SCC suffix rule.0 ms
Discarding 121 places :
Also discarding 39 output transitions
Drop transitions removed 39 transitions
Drop transitions removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 82 rules applied. Total rules applied 84 place count 47 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 85 place count 46 transition count 54
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 123 place count 8 transition count 16
Iterating global reduction 2 with 38 rules applied. Total rules applied 161 place count 8 transition count 16
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 163 place count 8 transition count 14
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 place count 8 transition count 13
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 166 place count 7 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 167 place count 6 transition count 11
Applied a total of 167 rules in 40 ms. Remains 6 /1844 variables (removed 1838) and now considering 11/6521 (removed 6510) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 6 cols
[2022-06-08 08:43:03] [INFO ] Computed 0 place invariants in 0 ms
[2022-06-08 08:43:03] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 08:43:03] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-08 08:43:03] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-06-08 08:43:03] [INFO ] After 53ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-08 08:43:03] [INFO ] Flatten gal took : 1 ms
[2022-06-08 08:43:03] [INFO ] Flatten gal took : 2 ms
[2022-06-08 08:43:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11847182272489704929.gal : 1 ms
[2022-06-08 08:43:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14240344634872232909.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms531737589838521110;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11847182272489704929.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14240344634872232909.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality14240344634872232909.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 5 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,34,0.004243,3516,2,16,7,112,6,0,33,76,0
Total reachable state count : 34
Verifying 1 reachability properties.
Reachability property apf0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,1,0.004661,3956,2,7,7,112,7,0,41,76,0
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 492 reset in 1402 ms.
Product exploration explored 100000 steps with 490 reset in 1153 ms.
Built C files in :
/tmp/ltsmin2521251006026645781
[2022-06-08 08:43:06] [INFO ] Too many transitions (6522) to apply POR reductions. Disabling POR matrices.
[2022-06-08 08:43:06] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2521251006026645781
Running compilation step : cd /tmp/ltsmin2521251006026645781;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2521251006026645781;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2521251006026645781;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 3 out of 1845 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1845/1845 places, 6522/6522 transitions.
Applied a total of 0 rules in 246 ms. Remains 1845 /1845 variables (removed 0) and now considering 6522/6522 (removed 0) transitions.
// Phase 1: matrix 6522 rows 1845 cols
[2022-06-08 08:43:09] [INFO ] Computed 42 place invariants in 153 ms
[2022-06-08 08:43:11] [INFO ] Implicit Places using invariants in 2028 ms returned []
// Phase 1: matrix 6522 rows 1845 cols
[2022-06-08 08:43:11] [INFO ] Computed 42 place invariants in 158 ms
[2022-06-08 08:43:15] [INFO ] Implicit Places using invariants and state equation in 3237 ms returned []
Implicit Place search using SMT with State Equation took 5266 ms to find 0 implicit places.
[2022-06-08 08:43:15] [INFO ] Redundant transitions in 500 ms returned []
// Phase 1: matrix 6522 rows 1845 cols
[2022-06-08 08:43:15] [INFO ] Computed 42 place invariants in 142 ms
[2022-06-08 08:43:23] [INFO ] Dead Transitions using invariants and state equation in 8158 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1845/1845 places, 6522/6522 transitions.
Built C files in :
/tmp/ltsmin9463935243236912817
[2022-06-08 08:43:23] [INFO ] Too many transitions (6522) to apply POR reductions. Disabling POR matrices.
[2022-06-08 08:43:23] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9463935243236912817
Running compilation step : cd /tmp/ltsmin9463935243236912817;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9463935243236912817;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9463935243236912817;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-08 08:43:27] [INFO ] Flatten gal took : 310 ms
[2022-06-08 08:43:27] [INFO ] Flatten gal took : 219 ms
[2022-06-08 08:43:27] [INFO ] Time to serialize gal into /tmp/LTL16576143282894360113.gal : 43 ms
[2022-06-08 08:43:27] [INFO ] Time to serialize properties into /tmp/LTL6961768897786464092.ltl : 118 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16576143282894360113.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6961768897786464092.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1657614...267
Read 1 LTL properties
Checking formula 0 : !((G(F("((Node17GiveAnswer5<3)||(Node12GiveAnswer21>Node7requestsent30))"))))
Formula 0 simplified : !GF"((Node17GiveAnswer5<3)||(Node12GiveAnswer21>Node7requestsent30))"
Detected timeout of ITS tools.
[2022-06-08 08:43:42] [INFO ] Flatten gal took : 160 ms
[2022-06-08 08:43:42] [INFO ] Applying decomposition
[2022-06-08 08:43:43] [INFO ] Flatten gal took : 164 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14586473887710581059.txt' '-o' '/tmp/graph14586473887710581059.bin' '-w' '/tmp/graph14586473887710581059.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14586473887710581059.bin' '-l' '-1' '-v' '-w' '/tmp/graph14586473887710581059.weights' '-q' '0' '-e' '0.001'
[2022-06-08 08:43:43] [INFO ] Decomposing Gal with order
[2022-06-08 08:43:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-08 08:43:44] [INFO ] Removed a total of 4798 redundant transitions.
[2022-06-08 08:43:44] [INFO ] Flatten gal took : 775 ms
[2022-06-08 08:43:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 3119 labels/synchronizations in 417 ms.
[2022-06-08 08:43:45] [INFO ] Time to serialize gal into /tmp/LTL11508878829554476915.gal : 36 ms
[2022-06-08 08:43:45] [INFO ] Time to serialize properties into /tmp/LTL13235997645305181710.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11508878829554476915.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13235997645305181710.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1150887...268
Read 1 LTL properties
Checking formula 0 : !((G(F("((gi0.gu6.Node17GiveAnswer5<3)||(gu41.Node12GiveAnswer21>gu41.Node7requestsent30))"))))
Formula 0 simplified : !GF"((gi0.gu6.Node17GiveAnswer5<3)||(gu41.Node12GiveAnswer21>gu41.Node7requestsent30))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8328667227356961417
[2022-06-08 08:44:00] [INFO ] Built C files in 81ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8328667227356961417
Running compilation step : cd /tmp/ltsmin8328667227356961417;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8328667227356961417;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8328667227356961417;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-15 finished in 177443 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((F(p0)&&p1))||F(G(p0)))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2022-06-08 08:44:04] [INFO ] Flatten gal took : 254 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6797192448692794207
[2022-06-08 08:44:04] [INFO ] Too many transitions (9840) to apply POR reductions. Disabling POR matrices.
[2022-06-08 08:44:05] [INFO ] Built C files in 222ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6797192448692794207
Running compilation step : cd /tmp/ltsmin6797192448692794207;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-08 08:44:05] [INFO ] Applying decomposition
[2022-06-08 08:44:05] [INFO ] Flatten gal took : 320 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17704742264340884384.txt' '-o' '/tmp/graph17704742264340884384.bin' '-w' '/tmp/graph17704742264340884384.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17704742264340884384.bin' '-l' '-1' '-v' '-w' '/tmp/graph17704742264340884384.weights' '-q' '0' '-e' '0.001'
[2022-06-08 08:44:06] [INFO ] Decomposing Gal with order
[2022-06-08 08:44:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-08 08:44:07] [INFO ] Removed a total of 4817 redundant transitions.
[2022-06-08 08:44:07] [INFO ] Flatten gal took : 842 ms
[2022-06-08 08:44:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 3045 labels/synchronizations in 392 ms.
[2022-06-08 08:44:09] [INFO ] Time to serialize gal into /tmp/LTLCardinality14641277745389840283.gal : 43 ms
[2022-06-08 08:44:09] [INFO ] Time to serialize properties into /tmp/LTLCardinality6526521456235670594.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality14641277745389840283.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6526521456235670594.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...289
Read 3 LTL properties
Checking formula 0 : !((G((F((F("(gi0.gi1.gi39.gu2.Node0requestsent36<3)"))&&("(gi0.gi1.gi39.gu107.Node37GiveAnswer26>=2)")))||(F(G("(gi0.gi1.gi39.gu2.Node...179
Formula 0 simplified : !G(F("(gi0.gi1.gi39.gu107.Node37GiveAnswer26>=2)" & F"(gi0.gi1.gi39.gu2.Node0requestsent36<3)") | FG"(gi0.gi1.gi39.gu2.Node0requests...165
Compilation finished in 87220 ms.
Running link step : cd /tmp/ltsmin6797192448692794207;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 121 ms.
Running LTSmin : cd /tmp/ltsmin6797192448692794207;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((<>((LTLAPp0==true))&&(LTLAPp1==true)))||<>([]((LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin6797192448692794207;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((<>((LTLAPp0==true))&&(LTLAPp1==true)))||<>([]((LTLAPp0==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin6797192448692794207;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp2==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-06-08 09:09:10] [INFO ] Flatten gal took : 543 ms
[2022-06-08 09:09:11] [INFO ] Time to serialize gal into /tmp/LTLCardinality16825428116683404689.gal : 70 ms
[2022-06-08 09:09:11] [INFO ] Time to serialize properties into /tmp/LTLCardinality13227037543772523513.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality16825428116683404689.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13227037543772523513.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...290
Read 3 LTL properties
Checking formula 0 : !((G((F((F("(Node0requestsent36<3)"))&&("(Node37GiveAnswer26>=2)")))||(F(G("(Node0requestsent36<3)"))))))
Formula 0 simplified : !G(F("(Node37GiveAnswer26>=2)" & F"(Node0requestsent36<3)") | FG"(Node0requestsent36<3)")
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin6797192448692794207;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp2==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin6797192448692794207;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp3==true)))' '--buchi-type=spotba'
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANInsertWithFailure-PT-040"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is CANInsertWithFailure-PT-040, 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 r294-smll-165463872300035"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-040.tgz
mv CANInsertWithFailure-PT-040 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 ;