fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r389-oct2-167903713400339
Last Updated
May 14, 2023

About the Execution of ITS-Tools for ShieldIIPt-PT-100A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16221.203 3600000.00 5155627.00 133510.30 FFFTF?FTFTFFFFFF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r389-oct2-167903713400339.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ShieldIIPt-PT-100A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713400339
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 8.8K Feb 25 19:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 19:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 18:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 18:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 21:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 25 21:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 19:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K Feb 25 19:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 539K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPt-PT-100A-LTLCardinality-00
FORMULA_NAME ShieldIIPt-PT-100A-LTLCardinality-01
FORMULA_NAME ShieldIIPt-PT-100A-LTLCardinality-02
FORMULA_NAME ShieldIIPt-PT-100A-LTLCardinality-03
FORMULA_NAME ShieldIIPt-PT-100A-LTLCardinality-04
FORMULA_NAME ShieldIIPt-PT-100A-LTLCardinality-05
FORMULA_NAME ShieldIIPt-PT-100A-LTLCardinality-06
FORMULA_NAME ShieldIIPt-PT-100A-LTLCardinality-07
FORMULA_NAME ShieldIIPt-PT-100A-LTLCardinality-08
FORMULA_NAME ShieldIIPt-PT-100A-LTLCardinality-09
FORMULA_NAME ShieldIIPt-PT-100A-LTLCardinality-10
FORMULA_NAME ShieldIIPt-PT-100A-LTLCardinality-11
FORMULA_NAME ShieldIIPt-PT-100A-LTLCardinality-12
FORMULA_NAME ShieldIIPt-PT-100A-LTLCardinality-13
FORMULA_NAME ShieldIIPt-PT-100A-LTLCardinality-14
FORMULA_NAME ShieldIIPt-PT-100A-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679191876738

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-100A
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-19 02:11:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 02:11:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 02:11:19] [INFO ] Load time of PNML (sax parser for PT used): 150 ms
[2023-03-19 02:11:19] [INFO ] Transformed 1903 places.
[2023-03-19 02:11:19] [INFO ] Transformed 1403 transitions.
[2023-03-19 02:11:19] [INFO ] Found NUPN structural information;
[2023-03-19 02:11:19] [INFO ] Parsed PT model containing 1903 places and 1403 transitions and 6006 arcs in 319 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldIIPt-PT-100A-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100A-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100A-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100A-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100A-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100A-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100A-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 231 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2023-03-19 02:11:20] [INFO ] Computed 901 place invariants in 34 ms
[2023-03-19 02:11:22] [INFO ] Implicit Places using invariants in 1912 ms returned []
[2023-03-19 02:11:22] [INFO ] Invariant cache hit.
[2023-03-19 02:11:26] [INFO ] Implicit Places using invariants and state equation in 4211 ms returned []
Implicit Place search using SMT with State Equation took 6221 ms to find 0 implicit places.
[2023-03-19 02:11:26] [INFO ] Invariant cache hit.
[2023-03-19 02:11:28] [INFO ] Dead Transitions using invariants and state equation in 2141 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8602 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Support contains 32 out of 1903 places after structural reductions.
[2023-03-19 02:11:29] [INFO ] Flatten gal took : 249 ms
[2023-03-19 02:11:29] [INFO ] Flatten gal took : 176 ms
[2023-03-19 02:11:29] [INFO ] Input system was already deterministic with 1402 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 566 ms. (steps per millisecond=17 ) properties (out of 19) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-19 02:11:31] [INFO ] Invariant cache hit.
[2023-03-19 02:11:33] [INFO ] [Real]Absence check using 901 positive place invariants in 776 ms returned sat
[2023-03-19 02:11:36] [INFO ] After 4464ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-19 02:11:37] [INFO ] [Nat]Absence check using 901 positive place invariants in 260 ms returned sat
[2023-03-19 02:11:42] [INFO ] After 4664ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-19 02:11:51] [INFO ] After 13433ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 4058 ms.
[2023-03-19 02:11:55] [INFO ] After 19246ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 3235 ms.
Support contains 21 out of 1903 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1903 transition count 1401
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1901 transition count 1400
Partial Free-agglomeration rule applied 193 times.
Drop transitions removed 193 transitions
Iterating global reduction 0 with 193 rules applied. Total rules applied 197 place count 1901 transition count 1400
Applied a total of 197 rules in 483 ms. Remains 1901 /1903 variables (removed 2) and now considering 1400/1402 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 483 ms. Remains : 1901/1903 places, 1400/1402 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 459 ms. (steps per millisecond=21 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 64884 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{0=1, 2=1, 4=1, 7=1, 8=1}
Probabilistic random walk after 64884 steps, saw 63596 distinct states, run finished after 3002 ms. (steps per millisecond=21 ) properties seen :5
Running SMT prover for 5 properties.
// Phase 1: matrix 1400 rows 1901 cols
[2023-03-19 02:12:04] [INFO ] Computed 901 place invariants in 18 ms
[2023-03-19 02:12:04] [INFO ] [Real]Absence check using 901 positive place invariants in 224 ms returned sat
[2023-03-19 02:12:06] [INFO ] After 2652ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-19 02:12:07] [INFO ] [Nat]Absence check using 901 positive place invariants in 247 ms returned sat
[2023-03-19 02:12:11] [INFO ] After 3592ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-19 02:12:11] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-19 02:12:13] [INFO ] After 2025ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-19 02:12:16] [INFO ] After 4610ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 2206 ms.
[2023-03-19 02:12:18] [INFO ] After 11473ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 1931 ms.
Support contains 9 out of 1901 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1901/1901 places, 1400/1400 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1901 transition count 1400
Applied a total of 2 rules in 159 ms. Remains 1901 /1901 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 1901/1901 places, 1400/1400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 331 ms. (steps per millisecond=30 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 68165 steps, run timeout after 3004 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68165 steps, saw 66856 distinct states, run finished after 3005 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1400 rows 1901 cols
[2023-03-19 02:12:24] [INFO ] Computed 901 place invariants in 6 ms
[2023-03-19 02:12:24] [INFO ] [Real]Absence check using 901 positive place invariants in 210 ms returned sat
[2023-03-19 02:12:26] [INFO ] After 2642ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-19 02:12:28] [INFO ] [Nat]Absence check using 901 positive place invariants in 549 ms returned sat
[2023-03-19 02:12:31] [INFO ] After 3069ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-19 02:12:31] [INFO ] State equation strengthened by 101 read => feed constraints.
[2023-03-19 02:12:34] [INFO ] After 3051ms SMT Verify possible using 101 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-19 02:12:36] [INFO ] After 4571ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 2755 ms.
[2023-03-19 02:12:39] [INFO ] After 12121ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 1841 ms.
Support contains 9 out of 1901 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1901/1901 places, 1400/1400 transitions.
Applied a total of 0 rules in 72 ms. Remains 1901 /1901 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 1901/1901 places, 1400/1400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1901/1901 places, 1400/1400 transitions.
Applied a total of 0 rules in 66 ms. Remains 1901 /1901 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
[2023-03-19 02:12:41] [INFO ] Invariant cache hit.
[2023-03-19 02:12:43] [INFO ] Implicit Places using invariants in 2256 ms returned [1893, 1894]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2274 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1899/1901 places, 1400/1400 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1899 transition count 1399
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1898 transition count 1399
Applied a total of 2 rules in 80 ms. Remains 1898 /1899 variables (removed 1) and now considering 1399/1400 (removed 1) transitions.
// Phase 1: matrix 1399 rows 1898 cols
[2023-03-19 02:12:43] [INFO ] Computed 899 place invariants in 8 ms
[2023-03-19 02:12:46] [INFO ] Implicit Places using invariants in 2839 ms returned [1887]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2850 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1897/1901 places, 1399/1400 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1896 transition count 1398
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1896 transition count 1398
Applied a total of 2 rules in 151 ms. Remains 1896 /1897 variables (removed 1) and now considering 1398/1399 (removed 1) transitions.
// Phase 1: matrix 1398 rows 1896 cols
[2023-03-19 02:12:46] [INFO ] Computed 898 place invariants in 5 ms
[2023-03-19 02:12:48] [INFO ] Implicit Places using invariants in 1976 ms returned []
[2023-03-19 02:12:48] [INFO ] Invariant cache hit.
[2023-03-19 02:12:49] [INFO ] State equation strengthened by 98 read => feed constraints.
[2023-03-19 02:12:54] [INFO ] Implicit Places using invariants and state equation in 6144 ms returned []
Implicit Place search using SMT with State Equation took 8185 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 1896/1901 places, 1398/1400 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 13608 ms. Remains : 1896/1901 places, 1398/1400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 606 ms. (steps per millisecond=16 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 65462 steps, run timeout after 3006 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 65462 steps, saw 64180 distinct states, run finished after 3006 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-19 02:12:58] [INFO ] Invariant cache hit.
[2023-03-19 02:12:59] [INFO ] [Real]Absence check using 898 positive place invariants in 229 ms returned sat
[2023-03-19 02:13:01] [INFO ] After 2495ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-19 02:13:02] [INFO ] [Nat]Absence check using 898 positive place invariants in 454 ms returned sat
[2023-03-19 02:13:05] [INFO ] After 3068ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-19 02:13:05] [INFO ] State equation strengthened by 98 read => feed constraints.
[2023-03-19 02:13:17] [INFO ] After 11584ms SMT Verify possible using 98 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-19 02:13:19] [INFO ] After 13601ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1986 ms.
[2023-03-19 02:13:21] [INFO ] After 19794ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 1686 ms.
Support contains 9 out of 1896 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1896/1896 places, 1398/1398 transitions.
Applied a total of 0 rules in 63 ms. Remains 1896 /1896 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 1896/1896 places, 1398/1398 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1896/1896 places, 1398/1398 transitions.
Applied a total of 0 rules in 62 ms. Remains 1896 /1896 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
[2023-03-19 02:13:23] [INFO ] Invariant cache hit.
[2023-03-19 02:13:24] [INFO ] Implicit Places using invariants in 1235 ms returned []
[2023-03-19 02:13:24] [INFO ] Invariant cache hit.
[2023-03-19 02:13:25] [INFO ] State equation strengthened by 98 read => feed constraints.
[2023-03-19 02:13:31] [INFO ] Implicit Places using invariants and state equation in 6836 ms returned []
Implicit Place search using SMT with State Equation took 8091 ms to find 0 implicit places.
[2023-03-19 02:13:31] [INFO ] Redundant transitions in 79 ms returned []
[2023-03-19 02:13:31] [INFO ] Invariant cache hit.
[2023-03-19 02:13:32] [INFO ] Dead Transitions using invariants and state equation in 1388 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9648 ms. Remains : 1896/1896 places, 1398/1398 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0)||(G(p2)&&p1)))))'
Support contains 5 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 55 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2023-03-19 02:13:33] [INFO ] Computed 901 place invariants in 4 ms
[2023-03-19 02:13:34] [INFO ] Implicit Places using invariants in 1624 ms returned []
[2023-03-19 02:13:34] [INFO ] Invariant cache hit.
[2023-03-19 02:13:37] [INFO ] Implicit Places using invariants and state equation in 3003 ms returned []
Implicit Place search using SMT with State Equation took 4634 ms to find 0 implicit places.
[2023-03-19 02:13:37] [INFO ] Invariant cache hit.
[2023-03-19 02:13:39] [INFO ] Dead Transitions using invariants and state equation in 1639 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6357 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 438 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p0), (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p2), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=1 dest: 2}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (NEQ s917 0) (NEQ s791 1)), p2:(NEQ s409 1), p0:(AND (NEQ s892 0) (NEQ s1232 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA ShieldIIPt-PT-100A-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100A-LTLCardinality-04 finished in 6937 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&F(p1))))'
Support contains 4 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 70 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
[2023-03-19 02:13:39] [INFO ] Invariant cache hit.
[2023-03-19 02:13:41] [INFO ] Implicit Places using invariants in 1807 ms returned []
[2023-03-19 02:13:41] [INFO ] Invariant cache hit.
[2023-03-19 02:13:45] [INFO ] Implicit Places using invariants and state equation in 3607 ms returned []
Implicit Place search using SMT with State Equation took 5429 ms to find 0 implicit places.
[2023-03-19 02:13:45] [INFO ] Invariant cache hit.
[2023-03-19 02:13:47] [INFO ] Dead Transitions using invariants and state equation in 1841 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7350 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s1287 0) (EQ s312 1)), p1:(AND (NEQ s1387 0) (NEQ s602 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1440 ms.
Product exploration explored 100000 steps with 0 reset in 1985 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 647 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 1) seen :0
Finished probabilistic random walk after 24858 steps, run visited all 1 properties in 514 ms. (steps per millisecond=48 )
Probabilistic random walk after 24858 steps, saw 24247 distinct states, run finished after 516 ms. (steps per millisecond=48 ) properties seen :1
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 594 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 1903 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 81 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
[2023-03-19 02:13:53] [INFO ] Invariant cache hit.
[2023-03-19 02:13:54] [INFO ] Implicit Places using invariants in 1386 ms returned []
[2023-03-19 02:13:54] [INFO ] Invariant cache hit.
[2023-03-19 02:13:57] [INFO ] Implicit Places using invariants and state equation in 3119 ms returned []
Implicit Place search using SMT with State Equation took 4524 ms to find 0 implicit places.
[2023-03-19 02:13:57] [INFO ] Invariant cache hit.
[2023-03-19 02:13:59] [INFO ] Dead Transitions using invariants and state equation in 1343 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5976 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 224 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 1) seen :0
Finished probabilistic random walk after 24858 steps, run visited all 1 properties in 453 ms. (steps per millisecond=54 )
Probabilistic random walk after 24858 steps, saw 24247 distinct states, run finished after 455 ms. (steps per millisecond=54 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 196 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1490 ms.
Product exploration explored 100000 steps with 0 reset in 1839 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 1903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1903 transition count 1402
Deduced a syphon composed of 1 places in 6 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1903 transition count 1402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 4 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1903 transition count 1402
Deduced a syphon composed of 2 places in 4 ms
Applied a total of 2 rules in 378 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
[2023-03-19 02:14:05] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 1402 rows 1903 cols
[2023-03-19 02:14:05] [INFO ] Computed 901 place invariants in 4 ms
[2023-03-19 02:14:07] [INFO ] Dead Transitions using invariants and state equation in 1846 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1903/1903 places, 1402/1402 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2253 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Built C files in :
/tmp/ltsmin1499208387900644548
[2023-03-19 02:14:07] [INFO ] Built C files in 79ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1499208387900644548
Running compilation step : cd /tmp/ltsmin1499208387900644548;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1499208387900644548;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1499208387900644548;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 76 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2023-03-19 02:14:10] [INFO ] Computed 901 place invariants in 7 ms
[2023-03-19 02:14:11] [INFO ] Implicit Places using invariants in 1507 ms returned []
[2023-03-19 02:14:11] [INFO ] Invariant cache hit.
[2023-03-19 02:14:15] [INFO ] Implicit Places using invariants and state equation in 3206 ms returned []
Implicit Place search using SMT with State Equation took 4722 ms to find 0 implicit places.
[2023-03-19 02:14:15] [INFO ] Invariant cache hit.
[2023-03-19 02:14:16] [INFO ] Dead Transitions using invariants and state equation in 1656 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6458 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Built C files in :
/tmp/ltsmin11985147365315472041
[2023-03-19 02:14:16] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11985147365315472041
Running compilation step : cd /tmp/ltsmin11985147365315472041;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11985147365315472041;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11985147365315472041;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-19 02:14:20] [INFO ] Flatten gal took : 121 ms
[2023-03-19 02:14:20] [INFO ] Flatten gal took : 118 ms
[2023-03-19 02:14:20] [INFO ] Time to serialize gal into /tmp/LTL11622823976746498840.gal : 15 ms
[2023-03-19 02:14:20] [INFO ] Time to serialize properties into /tmp/LTL562731178383905115.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11622823976746498840.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11180042093729964790.hoa' '-atoms' '/tmp/LTL562731178383905115.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL562731178383905115.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11180042093729964790.hoa
Detected timeout of ITS tools.
[2023-03-19 02:14:35] [INFO ] Flatten gal took : 122 ms
[2023-03-19 02:14:35] [INFO ] Flatten gal took : 107 ms
[2023-03-19 02:14:35] [INFO ] Time to serialize gal into /tmp/LTL7409907486694877422.gal : 11 ms
[2023-03-19 02:14:35] [INFO ] Time to serialize properties into /tmp/LTL5416446748637094905.ltl : 16 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7409907486694877422.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5416446748637094905.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((G("((p1287==0)||(p312==1))"))&&(F("((p1387==1)&&(p602==0))")))))
Formula 0 simplified : X(F!"((p1287==0)||(p312==1))" | G!"((p1387==1)&&(p602==0))")
Detected timeout of ITS tools.
[2023-03-19 02:14:50] [INFO ] Flatten gal took : 145 ms
[2023-03-19 02:14:50] [INFO ] Applying decomposition
[2023-03-19 02:14:51] [INFO ] Flatten gal took : 102 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph12323118363291975617.txt' '-o' '/tmp/graph12323118363291975617.bin' '-w' '/tmp/graph12323118363291975617.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12323118363291975617.bin' '-l' '-1' '-v' '-w' '/tmp/graph12323118363291975617.weights' '-q' '0' '-e' '0.001'
[2023-03-19 02:14:51] [INFO ] Decomposing Gal with order
[2023-03-19 02:14:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 02:14:51] [INFO ] Removed a total of 300 redundant transitions.
[2023-03-19 02:14:51] [INFO ] Flatten gal took : 215 ms
[2023-03-19 02:14:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 162 ms.
[2023-03-19 02:14:52] [INFO ] Time to serialize gal into /tmp/LTL7833318163396450428.gal : 41 ms
[2023-03-19 02:14:52] [INFO ] Time to serialize properties into /tmp/LTL15345396761447772910.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7833318163396450428.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15345396761447772910.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((G("((i31.i0.i1.u541.p1287==0)||(i6.i0.i4.u130.p312==1))"))&&(F("((i32.i2.i1.u583.p1387==1)&&(i14.u252.p602==0))")))))
Formula 0 simplified : X(F!"((i31.i0.i1.u541.p1287==0)||(i6.i0.i4.u130.p312==1))" | G!"((i32.i2.i1.u583.p1387==1)&&(i14.u252.p602==0))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7937742534810757077
[2023-03-19 02:15:07] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7937742534810757077
Running compilation step : cd /tmp/ltsmin7937742534810757077;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2990 ms.
Running link step : cd /tmp/ltsmin7937742534810757077;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 103 ms.
Running LTSmin : cd /tmp/ltsmin7937742534810757077;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((LTLAPp0==true))&&<>((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPt-PT-100A-LTLCardinality-05 finished in 102436 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&X((G(p2)||p1))))))'
Support contains 2 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 93 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
[2023-03-19 02:15:22] [INFO ] Invariant cache hit.
[2023-03-19 02:15:24] [INFO ] Implicit Places using invariants in 1943 ms returned []
[2023-03-19 02:15:24] [INFO ] Invariant cache hit.
[2023-03-19 02:15:27] [INFO ] Implicit Places using invariants and state equation in 3517 ms returned []
Implicit Place search using SMT with State Equation took 5478 ms to find 0 implicit places.
[2023-03-19 02:15:27] [INFO ] Invariant cache hit.
[2023-03-19 02:15:29] [INFO ] Dead Transitions using invariants and state equation in 1682 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7254 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 322 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 4}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(EQ s1748 0), p1:(OR (EQ s1748 1) (EQ s97 0)), p2:(EQ s97 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-100A-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100A-LTLCardinality-06 finished in 7617 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U p1)))'
Support contains 4 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 85 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
[2023-03-19 02:15:30] [INFO ] Invariant cache hit.
[2023-03-19 02:15:31] [INFO ] Implicit Places using invariants in 1316 ms returned []
[2023-03-19 02:15:31] [INFO ] Invariant cache hit.
[2023-03-19 02:15:35] [INFO ] Implicit Places using invariants and state equation in 4246 ms returned []
Implicit Place search using SMT with State Equation took 5602 ms to find 0 implicit places.
[2023-03-19 02:15:35] [INFO ] Invariant cache hit.
[2023-03-19 02:15:36] [INFO ] Dead Transitions using invariants and state equation in 1273 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6976 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s1305 0) (EQ s368 1)), p0:(OR (EQ s1149 0) (EQ s665 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 6452 ms.
Product exploration explored 100000 steps with 50000 reset in 6583 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), true, (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 6 factoid took 180 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-100A-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-100A-LTLCardinality-07 finished in 20380 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(X(X(p0)))&&(p1 U !p2))))'
Support contains 6 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 87 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
[2023-03-19 02:15:50] [INFO ] Invariant cache hit.
[2023-03-19 02:15:52] [INFO ] Implicit Places using invariants in 1745 ms returned []
[2023-03-19 02:15:52] [INFO ] Invariant cache hit.
[2023-03-19 02:15:55] [INFO ] Implicit Places using invariants and state equation in 3120 ms returned []
Implicit Place search using SMT with State Equation took 4895 ms to find 0 implicit places.
[2023-03-19 02:15:55] [INFO ] Invariant cache hit.
[2023-03-19 02:15:56] [INFO ] Dead Transitions using invariants and state equation in 1482 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6465 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 914 ms :[(OR (NOT p0) p2), (NOT p0), p2, (NOT p0), (NOT p0), (AND (NOT p0) p2), (NOT p0), (NOT p0), (AND (NOT p0) p2), (NOT p0), (NOT p0), (AND (NOT p0) p2)]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (AND p2 (NOT p1))), acceptance={} source=0 dest: 0}, { cond=(OR (AND p0 (NOT p2)) (AND p0 p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p2 p1), acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p0) (AND p2 (NOT p1))), acceptance={} source=1 dest: 3}, { cond=(OR (AND p0 (NOT p2)) (AND p0 p1)), acceptance={} source=1 dest: 4}, { cond=(AND p0 p2 p1), acceptance={} source=1 dest: 5}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p2 p1), acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (AND p2 (NOT p1))), acceptance={} source=3 dest: 6}, { cond=(OR (AND p0 (NOT p2)) (AND p0 p1)), acceptance={} source=3 dest: 7}, { cond=(AND p0 p2 p1), acceptance={} source=3 dest: 8}], [{ cond=(OR (NOT p0) (AND p2 (NOT p1))), acceptance={} source=4 dest: 9}, { cond=(OR (AND p0 (NOT p2)) (AND p0 p1)), acceptance={} source=4 dest: 10}, { cond=(AND p0 p2 p1), acceptance={} source=4 dest: 11}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND p2 p1), acceptance={} source=5 dest: 8}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}], [{ cond=(NOT p0), acceptance={} source=7 dest: 3}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=8 dest: 0}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=8 dest: 2}], [{ cond=(NOT p0), acceptance={} source=9 dest: 6}], [{ cond=(NOT p0), acceptance={} source=10 dest: 9}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=11 dest: 6}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=11 dest: 8}]], initial=0, aps=[p0:(OR (EQ s1080 0) (EQ s212 1)), p2:(OR (EQ s525 0) (EQ s17 1)), p1:(AND (OR (EQ s269 0) (EQ s985 1)) (OR (EQ s525 0) (EQ s17 1)))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 1533 ms.
Stack based approach found an accepted trace after 21 steps with 4 reset with depth 6 and stack size 6 in 1 ms.
FORMULA ShieldIIPt-PT-100A-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-100A-LTLCardinality-08 finished in 8973 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 1903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1903 transition count 1401
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1901 transition count 1400
Applied a total of 4 rules in 163 ms. Remains 1901 /1903 variables (removed 2) and now considering 1400/1402 (removed 2) transitions.
// Phase 1: matrix 1400 rows 1901 cols
[2023-03-19 02:15:59] [INFO ] Computed 901 place invariants in 5 ms
[2023-03-19 02:16:01] [INFO ] Implicit Places using invariants in 1721 ms returned [1893, 1894]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1736 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1899/1903 places, 1400/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1899 transition count 1399
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1898 transition count 1399
Applied a total of 2 rules in 93 ms. Remains 1898 /1899 variables (removed 1) and now considering 1399/1400 (removed 1) transitions.
// Phase 1: matrix 1399 rows 1898 cols
[2023-03-19 02:16:01] [INFO ] Computed 899 place invariants in 8 ms
[2023-03-19 02:16:03] [INFO ] Implicit Places using invariants in 1811 ms returned [1887]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1814 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1897/1903 places, 1399/1402 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1896 transition count 1398
Applied a total of 2 rules in 130 ms. Remains 1896 /1897 variables (removed 1) and now considering 1398/1399 (removed 1) transitions.
// Phase 1: matrix 1398 rows 1896 cols
[2023-03-19 02:16:03] [INFO ] Computed 898 place invariants in 9 ms
[2023-03-19 02:16:04] [INFO ] Implicit Places using invariants in 1629 ms returned []
[2023-03-19 02:16:04] [INFO ] Invariant cache hit.
[2023-03-19 02:16:08] [INFO ] Implicit Places using invariants and state equation in 3215 ms returned []
Implicit Place search using SMT with State Equation took 4871 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1896/1903 places, 1398/1402 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 8809 ms. Remains : 1896/1903 places, 1398/1402 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLCardinality-11 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:(AND (EQ s508 1) (OR (EQ s1082 0) (EQ s1409 1)))], 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 0 reset in 1373 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 1 ms.
FORMULA ShieldIIPt-PT-100A-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-100A-LTLCardinality-11 finished in 10323 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(G(p1)))))'
Support contains 3 out of 1903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1902 transition count 1400
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1900 transition count 1400
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1898 transition count 1399
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 6 place count 1898 transition count 1398
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 1897 transition count 1398
Applied a total of 8 rules in 196 ms. Remains 1897 /1903 variables (removed 6) and now considering 1398/1402 (removed 4) transitions.
// Phase 1: matrix 1398 rows 1897 cols
[2023-03-19 02:16:09] [INFO ] Computed 899 place invariants in 6 ms
[2023-03-19 02:16:11] [INFO ] Implicit Places using invariants in 1673 ms returned [1886]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1675 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1896/1903 places, 1398/1402 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1895 transition count 1397
Applied a total of 2 rules in 137 ms. Remains 1895 /1896 variables (removed 1) and now considering 1397/1398 (removed 1) transitions.
// Phase 1: matrix 1397 rows 1895 cols
[2023-03-19 02:16:11] [INFO ] Computed 898 place invariants in 8 ms
[2023-03-19 02:16:13] [INFO ] Implicit Places using invariants in 1405 ms returned []
[2023-03-19 02:16:13] [INFO ] Invariant cache hit.
[2023-03-19 02:16:16] [INFO ] Implicit Places using invariants and state equation in 2988 ms returned []
Implicit Place search using SMT with State Equation took 4413 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1895/1903 places, 1397/1402 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6423 ms. Remains : 1895/1903 places, 1397/1402 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s1599 1), p1:(OR (EQ s1067 0) (EQ s969 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 1422 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 1 ms.
FORMULA ShieldIIPt-PT-100A-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-100A-LTLCardinality-12 finished in 8032 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(F(p0)) U (p1 U !p0))))'
Support contains 3 out of 1903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1903 transition count 1401
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1901 transition count 1400
Applied a total of 4 rules in 149 ms. Remains 1901 /1903 variables (removed 2) and now considering 1400/1402 (removed 2) transitions.
// Phase 1: matrix 1400 rows 1901 cols
[2023-03-19 02:16:17] [INFO ] Computed 901 place invariants in 7 ms
[2023-03-19 02:16:19] [INFO ] Implicit Places using invariants in 1973 ms returned [1893, 1894]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1980 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1899/1903 places, 1400/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1899 transition count 1399
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1898 transition count 1399
Applied a total of 2 rules in 106 ms. Remains 1898 /1899 variables (removed 1) and now considering 1399/1400 (removed 1) transitions.
// Phase 1: matrix 1399 rows 1898 cols
[2023-03-19 02:16:19] [INFO ] Computed 899 place invariants in 3 ms
[2023-03-19 02:16:21] [INFO ] Implicit Places using invariants in 1785 ms returned [1887]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1788 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1897/1903 places, 1399/1402 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1896 transition count 1398
Applied a total of 2 rules in 113 ms. Remains 1896 /1897 variables (removed 1) and now considering 1398/1399 (removed 1) transitions.
// Phase 1: matrix 1398 rows 1896 cols
[2023-03-19 02:16:21] [INFO ] Computed 898 place invariants in 4 ms
[2023-03-19 02:16:24] [INFO ] Implicit Places using invariants in 2311 ms returned []
[2023-03-19 02:16:24] [INFO ] Invariant cache hit.
[2023-03-19 02:16:27] [INFO ] Implicit Places using invariants and state equation in 3614 ms returned []
Implicit Place search using SMT with State Equation took 5954 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1896/1903 places, 1398/1402 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 10090 ms. Remains : 1896/1903 places, 1398/1402 transitions.
Stuttering acceptance computed with spot in 194 ms :[p0, (NOT p0), p0]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s83 1), p1:(OR (EQ s618 0) (EQ s1809 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 23531 reset in 3765 ms.
Stack based approach found an accepted trace after 159 steps with 36 reset with depth 4 and stack size 4 in 7 ms.
FORMULA ShieldIIPt-PT-100A-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-100A-LTLCardinality-13 finished in 14096 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1903 transition count 1401
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1901 transition count 1400
Applied a total of 4 rules in 137 ms. Remains 1901 /1903 variables (removed 2) and now considering 1400/1402 (removed 2) transitions.
// Phase 1: matrix 1400 rows 1901 cols
[2023-03-19 02:16:31] [INFO ] Computed 901 place invariants in 7 ms
[2023-03-19 02:16:33] [INFO ] Implicit Places using invariants in 2036 ms returned [1893, 1894]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2046 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1899/1903 places, 1400/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1899 transition count 1399
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1898 transition count 1399
Applied a total of 2 rules in 78 ms. Remains 1898 /1899 variables (removed 1) and now considering 1399/1400 (removed 1) transitions.
// Phase 1: matrix 1399 rows 1898 cols
[2023-03-19 02:16:33] [INFO ] Computed 899 place invariants in 8 ms
[2023-03-19 02:16:35] [INFO ] Implicit Places using invariants in 1557 ms returned [1887]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1573 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1897/1903 places, 1399/1402 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1896 transition count 1398
Applied a total of 2 rules in 109 ms. Remains 1896 /1897 variables (removed 1) and now considering 1398/1399 (removed 1) transitions.
// Phase 1: matrix 1398 rows 1896 cols
[2023-03-19 02:16:35] [INFO ] Computed 898 place invariants in 7 ms
[2023-03-19 02:16:37] [INFO ] Implicit Places using invariants in 1740 ms returned []
[2023-03-19 02:16:37] [INFO ] Invariant cache hit.
[2023-03-19 02:16:41] [INFO ] Implicit Places using invariants and state equation in 3854 ms returned []
Implicit Place search using SMT with State Equation took 5615 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1896/1903 places, 1398/1402 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 9571 ms. Remains : 1896/1903 places, 1398/1402 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s1760 0) (NEQ s429 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 1475 ms.
Stack based approach found an accepted trace after 653 steps with 0 reset with depth 654 and stack size 614 in 12 ms.
FORMULA ShieldIIPt-PT-100A-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-100A-LTLCardinality-14 finished in 11154 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&F(p1))))'
[2023-03-19 02:16:43] [INFO ] Flatten gal took : 129 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14199658088962138566
[2023-03-19 02:16:43] [INFO ] Computing symmetric may disable matrix : 1402 transitions.
[2023-03-19 02:16:43] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 02:16:43] [INFO ] Computing symmetric may enable matrix : 1402 transitions.
[2023-03-19 02:16:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 02:16:43] [INFO ] Applying decomposition
[2023-03-19 02:16:43] [INFO ] Flatten gal took : 100 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph12400637574908143316.txt' '-o' '/tmp/graph12400637574908143316.bin' '-w' '/tmp/graph12400637574908143316.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12400637574908143316.bin' '-l' '-1' '-v' '-w' '/tmp/graph12400637574908143316.weights' '-q' '0' '-e' '0.001'
[2023-03-19 02:16:43] [INFO ] Decomposing Gal with order
[2023-03-19 02:16:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 02:16:43] [INFO ] Computing Do-Not-Accords matrix : 1402 transitions.
[2023-03-19 02:16:43] [INFO ] Computation of Completed DNA matrix. took 44 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 02:16:43] [INFO ] Built C files in 372ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14199658088962138566
Running compilation step : cd /tmp/ltsmin14199658088962138566;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-19 02:16:43] [INFO ] Removed a total of 300 redundant transitions.
[2023-03-19 02:16:43] [INFO ] Flatten gal took : 118 ms
[2023-03-19 02:16:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 69 ms.
[2023-03-19 02:16:43] [INFO ] Time to serialize gal into /tmp/LTLCardinality8252257520221758170.gal : 26 ms
[2023-03-19 02:16:43] [INFO ] Time to serialize properties into /tmp/LTLCardinality9284412437620489932.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality8252257520221758170.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9284412437620489932.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((G("((i28.i0.i0.u541.p1287==0)||(i6.i0.i0.u130.p312==1))"))&&(F("((i30.i0.i0.u583.p1387!=0)&&(i13.i1.i2.u252.p602!=1))")))))
Formula 0 simplified : X(F!"((i28.i0.i0.u541.p1287==0)||(i6.i0.i0.u130.p312==1))" | G!"((i30.i0.i0.u583.p1387!=0)&&(i13.i1.i2.u252.p602!=1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Compilation finished in 5148 ms.
Running link step : cd /tmp/ltsmin14199658088962138566;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 131 ms.
Running LTSmin : cd /tmp/ltsmin14199658088962138566;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((LTLAPp0==true))&&<>((LTLAPp1==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.023: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.021: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.030: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.031: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.031: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.512: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.513: LTL layer: formula: X(([]((LTLAPp0==true))&&<>((LTLAPp1==true))))
pins2lts-mc-linux64( 1/ 8), 0.530: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.558: "X(([]((LTLAPp0==true))&&<>((LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.568: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.584: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.631: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.668: buchi has 4 states
pins2lts-mc-linux64( 7/ 8), 0.728: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.708: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.733: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.746: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.748: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 1.554: DFS-FIFO for weak LTL, using special progress label 1405
pins2lts-mc-linux64( 0/ 8), 1.554: There are 1406 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 1.554: State length is 1904, there are 1409 groups
pins2lts-mc-linux64( 0/ 8), 1.554: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 1.554: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 1.554: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 1.554: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 1.702: ~2 levels ~960 states ~4200 transitions
pins2lts-mc-linux64( 1/ 8), 1.819: ~2 levels ~1920 states ~9744 transitions
pins2lts-mc-linux64( 1/ 8), 2.082: ~2 levels ~3840 states ~22424 transitions
pins2lts-mc-linux64( 1/ 8), 2.588: ~2 levels ~7680 states ~51344 transitions
pins2lts-mc-linux64( 1/ 8), 3.455: ~2 levels ~15360 states ~112224 transitions
pins2lts-mc-linux64( 1/ 8), 5.152: ~2 levels ~30720 states ~240536 transitions
pins2lts-mc-linux64( 1/ 8), 8.541: ~2 levels ~61440 states ~512792 transitions
pins2lts-mc-linux64( 1/ 8), 15.161: ~2 levels ~122880 states ~1079688 transitions
pins2lts-mc-linux64( 2/ 8), 28.263: ~1 levels ~245760 states ~2166408 transitions
pins2lts-mc-linux64( 6/ 8), 53.906: ~1 levels ~491520 states ~4501024 transitions
pins2lts-mc-linux64( 2/ 8), 105.440: ~1 levels ~983040 states ~9656576 transitions
pins2lts-mc-linux64( 6/ 8), 208.125: ~1 levels ~1966080 states ~19564856 transitions
pins2lts-mc-linux64( 6/ 8), 419.566: ~1 levels ~3932160 states ~41766024 transitions
pins2lts-mc-linux64( 0/ 8), 521.125: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 521.218:
pins2lts-mc-linux64( 0/ 8), 521.218: mean standard work distribution: 1.0% (states) 2.4% (transitions)
pins2lts-mc-linux64( 0/ 8), 521.218:
pins2lts-mc-linux64( 0/ 8), 521.218: Explored 4766404 states 53349406 transitions, fanout: 11.193
pins2lts-mc-linux64( 0/ 8), 521.218: Total exploration time 519.650 sec (519.540 sec minimum, 519.596 sec on average)
pins2lts-mc-linux64( 0/ 8), 521.218: States per second: 9172, Transitions per second: 102664
pins2lts-mc-linux64( 0/ 8), 521.218:
pins2lts-mc-linux64( 0/ 8), 521.218: Progress states detected: 9355236
pins2lts-mc-linux64( 0/ 8), 521.218: Redundant explorations: -49.0512
pins2lts-mc-linux64( 0/ 8), 521.218:
pins2lts-mc-linux64( 0/ 8), 521.218: Queue width: 8B, total height: 7616933, memory: 58.11MB
pins2lts-mc-linux64( 0/ 8), 521.218: Tree memory: 327.4MB, 36.7 B/state, compr.: 0.5%
pins2lts-mc-linux64( 0/ 8), 521.218: Tree fill ratio (roots/leafs): 6.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 521.218: Stored 1429 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 521.218: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 521.218: Est. total memory use: 385.5MB (~1082.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14199658088962138566;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((LTLAPp0==true))&&<>((LTLAPp1==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14199658088962138566;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((LTLAPp0==true))&&<>((LTLAPp1==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-19 02:38:33] [INFO ] Applying decomposition
[2023-03-19 02:38:36] [INFO ] Flatten gal took : 2884 ms
[2023-03-19 02:38:36] [INFO ] Decomposing Gal with order
[2023-03-19 02:38:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 02:38:38] [INFO ] Removed a total of 400 redundant transitions.
[2023-03-19 02:38:38] [INFO ] Flatten gal took : 535 ms
[2023-03-19 02:38:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 60 ms.
[2023-03-19 02:38:38] [INFO ] Time to serialize gal into /tmp/LTLCardinality6432042168319941513.gal : 76 ms
[2023-03-19 02:38:38] [INFO ] Time to serialize properties into /tmp/LTLCardinality15818322984244483142.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality6432042168319941513.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15818322984244483142.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((G("((u678.p1287==0)||(i130.u165.p312==1))"))&&(F("((u730.p1387!=0)&&(u317.p602!=1))")))))
Formula 0 simplified : X(F!"((u678.p1287==0)||(i130.u165.p312==1))" | G!"((u730.p1387!=0)&&(u317.p602!=1))")
Detected timeout of ITS tools.
[2023-03-19 03:00:35] [INFO ] Flatten gal took : 3196 ms
[2023-03-19 03:00:36] [INFO ] Input system was already deterministic with 1402 transitions.
[2023-03-19 03:00:36] [INFO ] Transformed 1903 places.
[2023-03-19 03:00:36] [INFO ] Transformed 1402 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-19 03:00:37] [INFO ] Time to serialize gal into /tmp/LTLCardinality18077932604989650538.gal : 20 ms
[2023-03-19 03:00:37] [INFO ] Time to serialize properties into /tmp/LTLCardinality1585431240970128695.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality18077932604989650538.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1585431240970128695.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((G("((p1287==0)||(p312==1))"))&&(F("((p1387!=0)&&(p602!=1))")))))
Formula 0 simplified : X(F!"((p1287==0)||(p312==1))" | G!"((p1387!=0)&&(p602!=1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 10811280 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16048204 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-100A"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is ShieldIIPt-PT-100A, 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 r389-oct2-167903713400339"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-100A.tgz
mv ShieldIIPt-PT-100A 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;