Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r263-tall-171654371900017.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is MultiCrashLeafsetExtension-PT-S16C05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-tall-171654371900017
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.0M
-rw-r--r-- 1 mcc users 18K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 121K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Apr 22 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 05:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 12 05:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 12 05:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 12 05:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 4.6M May 18 16:43 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 MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716624608041

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C05
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-25 08:10:09] [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]
[2024-05-25 08:10:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 08:10:09] [INFO ] Load time of PNML (sax parser for PT used): 247 ms
[2024-05-25 08:10:09] [INFO ] Transformed 4914 places.
[2024-05-25 08:10:09] [INFO ] Transformed 6913 transitions.
[2024-05-25 08:10:09] [INFO ] Parsed PT model containing 4914 places and 6913 transitions and 26710 arcs in 471 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 4914 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4914/4914 places, 6913/6913 transitions.
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 4885 transition count 6913
Discarding 1341 places :
Symmetric choice reduction at 1 with 1341 rule applications. Total rules 1370 place count 3544 transition count 5572
Iterating global reduction 1 with 1341 rules applied. Total rules applied 2711 place count 3544 transition count 5572
Discarding 1172 places :
Symmetric choice reduction at 1 with 1172 rule applications. Total rules 3883 place count 2372 transition count 4400
Iterating global reduction 1 with 1172 rules applied. Total rules applied 5055 place count 2372 transition count 4400
Discarding 220 places :
Symmetric choice reduction at 1 with 220 rule applications. Total rules 5275 place count 2152 transition count 3300
Iterating global reduction 1 with 220 rules applied. Total rules applied 5495 place count 2152 transition count 3300
Applied a total of 5495 rules in 911 ms. Remains 2152 /4914 variables (removed 2762) and now considering 3300/6913 (removed 3613) transitions.
[2024-05-25 08:10:11] [INFO ] Flow matrix only has 3028 transitions (discarded 272 similar events)
// Phase 1: matrix 3028 rows 2152 cols
[2024-05-25 08:10:11] [INFO ] Computed 506 invariants in 139 ms
[2024-05-25 08:10:14] [INFO ] Implicit Places using invariants in 2903 ms returned [4, 8, 12, 14, 16, 18, 20, 22, 27, 34, 43, 54, 67, 82, 98, 114, 116, 120, 122, 124, 137, 148, 157, 164, 169, 174, 197, 204, 207, 208, 209, 210, 211, 212, 215, 220, 227, 236, 247, 260, 274, 288, 289, 290, 291, 292, 293, 304, 313, 320, 325, 328, 330, 353, 360, 363, 364, 365, 366, 367, 368, 370, 373, 378, 385, 394, 405, 417, 429, 430, 431, 432, 433, 434, 443, 450, 455, 458, 460, 462, 485, 492, 496, 497, 498, 499, 500, 502, 506, 509, 514, 521, 530, 540, 553, 556, 557, 567, 572, 575, 579, 581, 583, 606, 613, 616, 617, 618, 619, 620, 621, 623, 625, 627, 630, 635, 642, 650, 658, 659, 660, 661, 663, 668, 674, 676, 678, 680, 682, 705, 712, 715, 716, 717, 718, 719, 720, 722, 724, 726, 728, 731, 736, 742, 748, 749, 750, 751, 752, 753, 756, 758, 760, 762, 764, 766, 789, 796, 801, 802, 803, 804, 808, 810, 812, 817, 819, 822, 826, 830, 831, 832, 833, 834, 835, 837, 839, 841, 843, 845, 847, 870, 877, 880, 881, 882, 885, 889, 891, 893, 898, 900, 902, 904, 907, 908, 909, 910, 911, 912, 914, 916, 918, 920, 922, 924, 947, 949, 953, 956, 957, 958, 959, 960, 961, 963, 965, 967, 969, 971, 973, 975, 978, 979, 980, 981, 982, 983, 985, 987, 989, 991, 993, 995, 1018, 1025, 1028, 1029, 1031, 1032, 1033, 1038, 1040, 1042, 1044, 1046, 1048, 1050, 1053, 1054, 1055, 1056, 1057, 1058, 1060, 1062, 1064, 1066, 1068, 1070, 1093, 1100, 1103, 1104, 1105, 1106, 1107, 1108, 1110, 1112, 1114, 1116, 1118, 1120, 1123, 1128, 1129, 1130, 1131, 1132, 1133, 1136, 1138, 1140, 1142, 1144, 1147, 1170, 1177, 1180, 1181, 1182, 1183, 1184, 1185, 1187, 1189, 1191, 1193, 1195, 1198, 1203, 1210, 1212, 1213, 1214, 1215, 1222, 1225, 1227, 1229, 1231, 1233, 1256, 1263, 1266, 1267, 1268, 1269, 1270, 1271, 1273, 1275, 1277, 1279, 1282, 1287, 1294, 1303, 1304, 1305, 1306, 1308, 1317, 1322, 1325, 1327, 1329, 1331, 1354, 1361, 1364, 1368, 1369, 1370, 1374, 1376, 1378, 1384, 1396, 1405, 1416, 1417, 1418, 1419, 1420, 1421, 1430, 1437, 1442, 1445, 1447, 1449, 1472, 1479, 1482, 1483, 1484, 1485, 1486, 1487, 1489, 1491, 1494, 1499, 1506, 1515, 1526, 1539, 1540, 1541, 1542, 1544, 1555, 1564, 1573, 1578, 1581, 1583, 1606, 1613, 1616, 1617, 1618, 1619, 1620, 1621, 1623, 1626, 1631, 1638, 1647, 1658, 1671, 1686, 1687, 1688, 1689, 1690, 1691, 1704, 1715, 1724, 1731, 1736, 1739, 1762, 1764, 1768, 1771, 1772, 1773, 1774, 1775, 1776, 1779, 1784, 1791, 1800, 1811, 1824, 1839, 1857, 1858, 1860, 1861, 1879, 1892, 1905, 1914, 1921, 1926, 1950]
Discarding 443 places :
Implicit Place search using SMT only with invariants took 2940 ms to find 443 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1709/4914 places, 3300/6913 transitions.
Discarding 142 places :
Symmetric choice reduction at 0 with 142 rule applications. Total rules 142 place count 1567 transition count 3158
Iterating global reduction 0 with 142 rules applied. Total rules applied 284 place count 1567 transition count 3158
Discarding 140 places :
Symmetric choice reduction at 0 with 140 rule applications. Total rules 424 place count 1427 transition count 3018
Iterating global reduction 0 with 140 rules applied. Total rules applied 564 place count 1427 transition count 3018
Discarding 139 places :
Symmetric choice reduction at 0 with 139 rule applications. Total rules 703 place count 1288 transition count 2879
Iterating global reduction 0 with 139 rules applied. Total rules applied 842 place count 1288 transition count 2879
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 859 place count 1271 transition count 2794
Iterating global reduction 0 with 17 rules applied. Total rules applied 876 place count 1271 transition count 2794
Applied a total of 876 rules in 603 ms. Remains 1271 /1709 variables (removed 438) and now considering 2794/3300 (removed 506) transitions.
[2024-05-25 08:10:14] [INFO ] Flow matrix only has 2522 transitions (discarded 272 similar events)
// Phase 1: matrix 2522 rows 1271 cols
[2024-05-25 08:10:14] [INFO ] Computed 63 invariants in 30 ms
[2024-05-25 08:10:15] [INFO ] Implicit Places using invariants in 1260 ms returned []
[2024-05-25 08:10:15] [INFO ] Flow matrix only has 2522 transitions (discarded 272 similar events)
[2024-05-25 08:10:15] [INFO ] Invariant cache hit.
[2024-05-25 08:10:16] [INFO ] State equation strengthened by 958 read => feed constraints.
[2024-05-25 08:10:27] [INFO ] Implicit Places using invariants and state equation in 12033 ms returned []
Implicit Place search using SMT with State Equation took 13296 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1271/4914 places, 2794/6913 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 17753 ms. Remains : 1271/4914 places, 2794/6913 transitions.
Support contains 36 out of 1271 places after structural reductions.
[2024-05-25 08:10:28] [INFO ] Flatten gal took : 246 ms
[2024-05-25 08:10:28] [INFO ] Flatten gal took : 131 ms
[2024-05-25 08:10:28] [INFO ] Input system was already deterministic with 2794 transitions.
Support contains 35 out of 1271 places (down from 36) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 191 resets, run finished after 428 ms. (steps per millisecond=23 ) properties (out of 22) seen :6
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
[2024-05-25 08:10:29] [INFO ] Flow matrix only has 2522 transitions (discarded 272 similar events)
[2024-05-25 08:10:29] [INFO ] Invariant cache hit.
[2024-05-25 08:10:29] [INFO ] [Real]Absence check using 31 positive place invariants in 25 ms returned sat
[2024-05-25 08:10:30] [INFO ] [Real]Absence check using 31 positive and 32 generalized place invariants in 17 ms returned sat
[2024-05-25 08:10:30] [INFO ] After 577ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:15
[2024-05-25 08:10:30] [INFO ] [Nat]Absence check using 31 positive place invariants in 23 ms returned sat
[2024-05-25 08:10:30] [INFO ] [Nat]Absence check using 31 positive and 32 generalized place invariants in 13 ms returned sat
[2024-05-25 08:10:32] [INFO ] After 1629ms SMT Verify possible using state equation in natural domain returned unsat :10 sat :6
[2024-05-25 08:10:32] [INFO ] State equation strengthened by 958 read => feed constraints.
[2024-05-25 08:10:33] [INFO ] After 1442ms SMT Verify possible using 958 Read/Feed constraints in natural domain returned unsat :10 sat :6
[2024-05-25 08:10:34] [INFO ] Deduced a trap composed of 477 places in 575 ms of which 13 ms to minimize.
[2024-05-25 08:10:35] [INFO ] Deduced a trap composed of 289 places in 600 ms of which 2 ms to minimize.
[2024-05-25 08:10:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1394 ms
[2024-05-25 08:10:36] [INFO ] Deduced a trap composed of 137 places in 587 ms of which 2 ms to minimize.
[2024-05-25 08:10:36] [INFO ] Deduced a trap composed of 307 places in 566 ms of which 1 ms to minimize.
[2024-05-25 08:10:37] [INFO ] Deduced a trap composed of 144 places in 572 ms of which 2 ms to minimize.
[2024-05-25 08:10:38] [INFO ] Deduced a trap composed of 151 places in 556 ms of which 2 ms to minimize.
[2024-05-25 08:10:38] [INFO ] Deduced a trap composed of 145 places in 578 ms of which 1 ms to minimize.
[2024-05-25 08:10:39] [INFO ] Deduced a trap composed of 138 places in 562 ms of which 2 ms to minimize.
[2024-05-25 08:10:40] [INFO ] Deduced a trap composed of 321 places in 551 ms of which 1 ms to minimize.
[2024-05-25 08:10:40] [INFO ] Deduced a trap composed of 311 places in 573 ms of which 1 ms to minimize.
[2024-05-25 08:10:41] [INFO ] Deduced a trap composed of 126 places in 552 ms of which 1 ms to minimize.
[2024-05-25 08:10:42] [INFO ] Deduced a trap composed of 331 places in 596 ms of which 2 ms to minimize.
[2024-05-25 08:10:42] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 6966 ms
[2024-05-25 08:10:43] [INFO ] Deduced a trap composed of 360 places in 595 ms of which 1 ms to minimize.
[2024-05-25 08:10:44] [INFO ] Deduced a trap composed of 189 places in 585 ms of which 1 ms to minimize.
[2024-05-25 08:10:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1411 ms
[2024-05-25 08:10:45] [INFO ] Deduced a trap composed of 248 places in 581 ms of which 2 ms to minimize.
[2024-05-25 08:10:45] [INFO ] Deduced a trap composed of 414 places in 554 ms of which 1 ms to minimize.
[2024-05-25 08:10:46] [INFO ] Deduced a trap composed of 176 places in 601 ms of which 1 ms to minimize.
[2024-05-25 08:10:47] [INFO ] Deduced a trap composed of 191 places in 558 ms of which 1 ms to minimize.
[2024-05-25 08:10:47] [INFO ] Deduced a trap composed of 146 places in 561 ms of which 1 ms to minimize.
[2024-05-25 08:10:48] [INFO ] Deduced a trap composed of 181 places in 561 ms of which 1 ms to minimize.
[2024-05-25 08:10:49] [INFO ] Deduced a trap composed of 185 places in 572 ms of which 1 ms to minimize.
[2024-05-25 08:10:49] [INFO ] Deduced a trap composed of 384 places in 563 ms of which 2 ms to minimize.
[2024-05-25 08:10:50] [INFO ] Deduced a trap composed of 203 places in 581 ms of which 1 ms to minimize.
[2024-05-25 08:10:51] [INFO ] Deduced a trap composed of 180 places in 567 ms of which 1 ms to minimize.
[2024-05-25 08:10:51] [INFO ] Deduced a trap composed of 186 places in 564 ms of which 1 ms to minimize.
[2024-05-25 08:10:52] [INFO ] Deduced a trap composed of 212 places in 590 ms of which 2 ms to minimize.
[2024-05-25 08:10:53] [INFO ] Deduced a trap composed of 354 places in 538 ms of which 2 ms to minimize.
[2024-05-25 08:10:54] [INFO ] Deduced a trap composed of 190 places in 576 ms of which 2 ms to minimize.
[2024-05-25 08:10:54] [INFO ] Deduced a trap composed of 204 places in 611 ms of which 1 ms to minimize.
[2024-05-25 08:10:55] [INFO ] Deduced a trap composed of 202 places in 587 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 08:10:55] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 08:10:55] [INFO ] After 25395ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:15
Fused 16 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 28 ms.
Support contains 10 out of 1271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1271/1271 places, 2794/2794 transitions.
Graph (complete) has 5807 edges and 1271 vertex of which 1270 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 1270 transition count 2779
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 1255 transition count 2779
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 31 place count 1255 transition count 2755
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 79 place count 1231 transition count 2755
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 90 place count 1220 transition count 2740
Iterating global reduction 2 with 11 rules applied. Total rules applied 101 place count 1220 transition count 2740
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 101 place count 1220 transition count 2736
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 109 place count 1216 transition count 2736
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 119 place count 1206 transition count 2694
Iterating global reduction 2 with 10 rules applied. Total rules applied 129 place count 1206 transition count 2694
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 131 place count 1204 transition count 2684
Iterating global reduction 2 with 2 rules applied. Total rules applied 133 place count 1204 transition count 2684
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 191 place count 1175 transition count 2655
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 198 place count 1168 transition count 2648
Iterating global reduction 2 with 7 rules applied. Total rules applied 205 place count 1168 transition count 2648
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 211 place count 1162 transition count 2618
Iterating global reduction 2 with 6 rules applied. Total rules applied 217 place count 1162 transition count 2618
Free-agglomeration rule (complex) applied 144 times.
Iterating global reduction 2 with 144 rules applied. Total rules applied 361 place count 1162 transition count 3462
Reduce places removed 144 places and 0 transitions.
Iterating post reduction 2 with 144 rules applied. Total rules applied 505 place count 1018 transition count 3462
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 517 place count 1018 transition count 3462
Applied a total of 517 rules in 1580 ms. Remains 1018 /1271 variables (removed 253) and now considering 3462/2794 (removed -668) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1594 ms. Remains : 1018/1271 places, 3462/2794 transitions.
Incomplete random walk after 10000 steps, including 339 resets, run finished after 426 ms. (steps per millisecond=23 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 39 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 67995 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{2=1}
Probabilistic random walk after 67995 steps, saw 28734 distinct states, run finished after 3002 ms. (steps per millisecond=22 ) properties seen :1
Running SMT prover for 5 properties.
[2024-05-25 08:11:00] [INFO ] Flow matrix only has 3066 transitions (discarded 396 similar events)
// Phase 1: matrix 3066 rows 1018 cols
[2024-05-25 08:11:00] [INFO ] Computed 62 invariants in 36 ms
[2024-05-25 08:11:00] [INFO ] After 205ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-25 08:11:01] [INFO ] [Nat]Absence check using 32 positive place invariants in 20 ms returned sat
[2024-05-25 08:11:01] [INFO ] [Nat]Absence check using 32 positive and 30 generalized place invariants in 6 ms returned sat
[2024-05-25 08:11:03] [INFO ] After 1797ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-25 08:11:03] [INFO ] State equation strengthened by 1878 read => feed constraints.
[2024-05-25 08:11:04] [INFO ] After 1607ms SMT Verify possible using 1878 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-25 08:11:05] [INFO ] Deduced a trap composed of 86 places in 567 ms of which 1 ms to minimize.
[2024-05-25 08:11:06] [INFO ] Deduced a trap composed of 273 places in 456 ms of which 1 ms to minimize.
[2024-05-25 08:11:06] [INFO ] Deduced a trap composed of 99 places in 555 ms of which 1 ms to minimize.
[2024-05-25 08:11:07] [INFO ] Deduced a trap composed of 77 places in 501 ms of which 4 ms to minimize.
[2024-05-25 08:11:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2450 ms
[2024-05-25 08:11:08] [INFO ] Deduced a trap composed of 173 places in 452 ms of which 8 ms to minimize.
[2024-05-25 08:11:09] [INFO ] Deduced a trap composed of 110 places in 519 ms of which 1 ms to minimize.
[2024-05-25 08:11:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1198 ms
[2024-05-25 08:11:10] [INFO ] Deduced a trap composed of 93 places in 531 ms of which 1 ms to minimize.
[2024-05-25 08:11:10] [INFO ] Deduced a trap composed of 93 places in 507 ms of which 1 ms to minimize.
[2024-05-25 08:11:11] [INFO ] Deduced a trap composed of 91 places in 564 ms of which 1 ms to minimize.
[2024-05-25 08:11:12] [INFO ] Deduced a trap composed of 89 places in 488 ms of which 2 ms to minimize.
[2024-05-25 08:11:13] [INFO ] Deduced a trap composed of 100 places in 518 ms of which 1 ms to minimize.
[2024-05-25 08:11:13] [INFO ] Deduced a trap composed of 92 places in 480 ms of which 0 ms to minimize.
[2024-05-25 08:11:14] [INFO ] Deduced a trap composed of 89 places in 567 ms of which 1 ms to minimize.
[2024-05-25 08:11:15] [INFO ] Deduced a trap composed of 101 places in 517 ms of which 1 ms to minimize.
[2024-05-25 08:11:16] [INFO ] Deduced a trap composed of 180 places in 480 ms of which 1 ms to minimize.
[2024-05-25 08:11:16] [INFO ] Deduced a trap composed of 87 places in 540 ms of which 1 ms to minimize.
[2024-05-25 08:11:17] [INFO ] Deduced a trap composed of 84 places in 528 ms of which 1 ms to minimize.
[2024-05-25 08:11:18] [INFO ] Deduced a trap composed of 104 places in 551 ms of which 1 ms to minimize.
[2024-05-25 08:11:19] [INFO ] Deduced a trap composed of 80 places in 515 ms of which 1 ms to minimize.
[2024-05-25 08:11:20] [INFO ] Deduced a trap composed of 92 places in 503 ms of which 1 ms to minimize.
[2024-05-25 08:11:21] [INFO ] Deduced a trap composed of 108 places in 499 ms of which 1 ms to minimize.
[2024-05-25 08:11:21] [INFO ] Deduced a trap composed of 111 places in 500 ms of which 1 ms to minimize.
[2024-05-25 08:11:24] [INFO ] Deduced a trap composed of 75 places in 516 ms of which 1 ms to minimize.
[2024-05-25 08:11:24] [INFO ] Deduced a trap composed of 208 places in 439 ms of which 1 ms to minimize.
[2024-05-25 08:11:25] [INFO ] Deduced a trap composed of 90 places in 484 ms of which 1 ms to minimize.
[2024-05-25 08:11:26] [INFO ] Deduced a trap composed of 86 places in 541 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 08:11:26] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 08:11:26] [INFO ] After 25145ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 14 ms.
Support contains 9 out of 1018 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1018/1018 places, 3462/3462 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1018 transition count 3461
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1017 transition count 3461
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 1017 transition count 3461
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 1016 transition count 3460
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 1016 transition count 3460
Applied a total of 5 rules in 237 ms. Remains 1016 /1018 variables (removed 2) and now considering 3460/3462 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 238 ms. Remains : 1016/1018 places, 3460/3462 transitions.
Incomplete random walk after 10000 steps, including 340 resets, run finished after 351 ms. (steps per millisecond=28 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 67988 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 67988 steps, saw 28724 distinct states, run finished after 3002 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-25 08:11:29] [INFO ] Flow matrix only has 3064 transitions (discarded 396 similar events)
// Phase 1: matrix 3064 rows 1016 cols
[2024-05-25 08:11:29] [INFO ] Computed 62 invariants in 26 ms
[2024-05-25 08:11:30] [INFO ] After 171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-25 08:11:30] [INFO ] [Nat]Absence check using 32 positive place invariants in 22 ms returned sat
[2024-05-25 08:11:30] [INFO ] [Nat]Absence check using 32 positive and 30 generalized place invariants in 6 ms returned sat
[2024-05-25 08:11:32] [INFO ] After 1902ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-25 08:11:32] [INFO ] State equation strengthened by 1878 read => feed constraints.
[2024-05-25 08:11:35] [INFO ] After 3252ms SMT Verify possible using 1878 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-25 08:11:36] [INFO ] Deduced a trap composed of 263 places in 481 ms of which 0 ms to minimize.
[2024-05-25 08:11:37] [INFO ] Deduced a trap composed of 74 places in 554 ms of which 1 ms to minimize.
[2024-05-25 08:11:37] [INFO ] Deduced a trap composed of 84 places in 540 ms of which 1 ms to minimize.
[2024-05-25 08:11:38] [INFO ] Deduced a trap composed of 84 places in 542 ms of which 1 ms to minimize.
[2024-05-25 08:11:38] [INFO ] Deduced a trap composed of 72 places in 505 ms of which 1 ms to minimize.
[2024-05-25 08:11:39] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3088 ms
[2024-05-25 08:11:40] [INFO ] Deduced a trap composed of 165 places in 431 ms of which 1 ms to minimize.
[2024-05-25 08:11:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 578 ms
[2024-05-25 08:11:40] [INFO ] Deduced a trap composed of 86 places in 492 ms of which 1 ms to minimize.
[2024-05-25 08:11:41] [INFO ] Deduced a trap composed of 87 places in 561 ms of which 2 ms to minimize.
[2024-05-25 08:11:42] [INFO ] Deduced a trap composed of 89 places in 567 ms of which 4 ms to minimize.
[2024-05-25 08:11:42] [INFO ] Deduced a trap composed of 83 places in 543 ms of which 1 ms to minimize.
[2024-05-25 08:11:43] [INFO ] Deduced a trap composed of 169 places in 474 ms of which 2 ms to minimize.
[2024-05-25 08:11:44] [INFO ] Deduced a trap composed of 87 places in 545 ms of which 5 ms to minimize.
[2024-05-25 08:11:44] [INFO ] Deduced a trap composed of 113 places in 508 ms of which 1 ms to minimize.
[2024-05-25 08:11:45] [INFO ] Deduced a trap composed of 86 places in 518 ms of which 1 ms to minimize.
[2024-05-25 08:11:46] [INFO ] Deduced a trap composed of 143 places in 495 ms of which 1 ms to minimize.
[2024-05-25 08:11:46] [INFO ] Deduced a trap composed of 91 places in 539 ms of which 1 ms to minimize.
[2024-05-25 08:11:47] [INFO ] Deduced a trap composed of 90 places in 497 ms of which 1 ms to minimize.
[2024-05-25 08:11:47] [INFO ] Deduced a trap composed of 92 places in 509 ms of which 1 ms to minimize.
[2024-05-25 08:11:48] [INFO ] Deduced a trap composed of 87 places in 538 ms of which 1 ms to minimize.
[2024-05-25 08:11:49] [INFO ] Deduced a trap composed of 102 places in 535 ms of which 1 ms to minimize.
[2024-05-25 08:11:50] [INFO ] Deduced a trap composed of 92 places in 538 ms of which 1 ms to minimize.
[2024-05-25 08:11:50] [INFO ] Deduced a trap composed of 83 places in 533 ms of which 1 ms to minimize.
[2024-05-25 08:11:51] [INFO ] Deduced a trap composed of 75 places in 504 ms of which 1 ms to minimize.
[2024-05-25 08:11:53] [INFO ] Deduced a trap composed of 91 places in 552 ms of which 1 ms to minimize.
[2024-05-25 08:11:53] [INFO ] Deduced a trap composed of 79 places in 538 ms of which 1 ms to minimize.
[2024-05-25 08:11:54] [INFO ] Deduced a trap composed of 84 places in 524 ms of which 1 ms to minimize.
[2024-05-25 08:11:55] [INFO ] Deduced a trap composed of 182 places in 507 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 08:11:55] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 08:11:55] [INFO ] After 25047ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 22 ms.
Support contains 9 out of 1016 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1016/1016 places, 3460/3460 transitions.
Applied a total of 0 rules in 96 ms. Remains 1016 /1016 variables (removed 0) and now considering 3460/3460 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 1016/1016 places, 3460/3460 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1016/1016 places, 3460/3460 transitions.
Applied a total of 0 rules in 96 ms. Remains 1016 /1016 variables (removed 0) and now considering 3460/3460 (removed 0) transitions.
[2024-05-25 08:11:55] [INFO ] Flow matrix only has 3064 transitions (discarded 396 similar events)
[2024-05-25 08:11:55] [INFO ] Invariant cache hit.
[2024-05-25 08:11:56] [INFO ] Implicit Places using invariants in 1080 ms returned [82, 301, 335, 336, 337, 386, 433, 434, 460, 507, 567, 627, 628, 636, 914, 915]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 1086 ms to find 16 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1000/1016 places, 3460/3460 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 990 transition count 3450
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 990 transition count 3450
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 29 place count 981 transition count 3441
Iterating global reduction 0 with 9 rules applied. Total rules applied 38 place count 981 transition count 3441
Applied a total of 38 rules in 148 ms. Remains 981 /1000 variables (removed 19) and now considering 3441/3460 (removed 19) transitions.
[2024-05-25 08:11:56] [INFO ] Flow matrix only has 3045 transitions (discarded 396 similar events)
// Phase 1: matrix 3045 rows 981 cols
[2024-05-25 08:11:56] [INFO ] Computed 46 invariants in 25 ms
[2024-05-25 08:11:57] [INFO ] Implicit Places using invariants in 1012 ms returned []
[2024-05-25 08:11:57] [INFO ] Flow matrix only has 3045 transitions (discarded 396 similar events)
[2024-05-25 08:11:57] [INFO ] Invariant cache hit.
[2024-05-25 08:11:58] [INFO ] State equation strengthened by 1878 read => feed constraints.
[2024-05-25 08:12:14] [INFO ] Implicit Places using invariants and state equation in 16678 ms returned []
Implicit Place search using SMT with State Equation took 17697 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 981/1016 places, 3441/3460 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 19027 ms. Remains : 981/1016 places, 3441/3460 transitions.
Successfully simplified 10 atomic propositions for a total of 11 simplifications.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 439 stabilizing places and 1161 stable transitions
Graph (complete) has 8615 edges and 1271 vertex of which 1270 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.25 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1271 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1271/1271 places, 2794/2794 transitions.
Graph (complete) has 8615 edges and 1271 vertex of which 1270 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.17 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 1270 transition count 2778
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 1254 transition count 2778
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 33 place count 1254 transition count 2754
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 81 place count 1230 transition count 2754
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 94 place count 1217 transition count 2737
Iterating global reduction 2 with 13 rules applied. Total rules applied 107 place count 1217 transition count 2737
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 107 place count 1217 transition count 2733
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 115 place count 1213 transition count 2733
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 127 place count 1201 transition count 2681
Iterating global reduction 2 with 12 rules applied. Total rules applied 139 place count 1201 transition count 2681
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 141 place count 1199 transition count 2671
Iterating global reduction 2 with 2 rules applied. Total rules applied 143 place count 1199 transition count 2671
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 201 place count 1170 transition count 2642
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 209 place count 1162 transition count 2634
Iterating global reduction 2 with 8 rules applied. Total rules applied 217 place count 1162 transition count 2634
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 224 place count 1155 transition count 2599
Iterating global reduction 2 with 7 rules applied. Total rules applied 231 place count 1155 transition count 2599
Applied a total of 231 rules in 480 ms. Remains 1155 /1271 variables (removed 116) and now considering 2599/2794 (removed 195) transitions.
[2024-05-25 08:12:14] [INFO ] Flow matrix only has 2327 transitions (discarded 272 similar events)
// Phase 1: matrix 2327 rows 1155 cols
[2024-05-25 08:12:15] [INFO ] Computed 62 invariants in 34 ms
[2024-05-25 08:12:15] [INFO ] Implicit Places using invariants in 1008 ms returned [93, 345, 386, 387, 388, 445, 500, 501, 531, 532, 648, 692, 718, 719, 729, 829, 1046, 1047]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 1010 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1137/1271 places, 2599/2794 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1126 transition count 2588
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1126 transition count 2588
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 1115 transition count 2577
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 1115 transition count 2577
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 50 place count 1109 transition count 2547
Iterating global reduction 0 with 6 rules applied. Total rules applied 56 place count 1109 transition count 2547
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 68 place count 1103 transition count 2541
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 74 place count 1097 transition count 2535
Iterating global reduction 0 with 6 rules applied. Total rules applied 80 place count 1097 transition count 2535
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 85 place count 1092 transition count 2510
Iterating global reduction 0 with 5 rules applied. Total rules applied 90 place count 1092 transition count 2510
Applied a total of 90 rules in 360 ms. Remains 1092 /1137 variables (removed 45) and now considering 2510/2599 (removed 89) transitions.
[2024-05-25 08:12:16] [INFO ] Flow matrix only has 2238 transitions (discarded 272 similar events)
// Phase 1: matrix 2238 rows 1092 cols
[2024-05-25 08:12:16] [INFO ] Computed 44 invariants in 20 ms
[2024-05-25 08:12:17] [INFO ] Implicit Places using invariants in 909 ms returned []
[2024-05-25 08:12:17] [INFO ] Flow matrix only has 2238 transitions (discarded 272 similar events)
[2024-05-25 08:12:17] [INFO ] Invariant cache hit.
[2024-05-25 08:12:18] [INFO ] State equation strengthened by 834 read => feed constraints.
[2024-05-25 08:12:26] [INFO ] Implicit Places using invariants and state equation in 9160 ms returned [1084]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10071 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1091/1271 places, 2510/2794 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 1091 transition count 2509
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1090 transition count 2509
Applied a total of 2 rules in 86 ms. Remains 1090 /1091 variables (removed 1) and now considering 2509/2510 (removed 1) transitions.
[2024-05-25 08:12:26] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
// Phase 1: matrix 2237 rows 1090 cols
[2024-05-25 08:12:26] [INFO ] Computed 43 invariants in 23 ms
[2024-05-25 08:12:27] [INFO ] Implicit Places using invariants in 1091 ms returned []
[2024-05-25 08:12:27] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2024-05-25 08:12:27] [INFO ] Invariant cache hit.
[2024-05-25 08:12:28] [INFO ] State equation strengthened by 834 read => feed constraints.
[2024-05-25 08:12:36] [INFO ] Implicit Places using invariants and state equation in 9156 ms returned []
Implicit Place search using SMT with State Equation took 10260 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1090/1271 places, 2509/2794 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 22271 ms. Remains : 1090/1271 places, 2509/2794 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 211 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s556 s417)], 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 2722 reset in 728 ms.
Product exploration explored 100000 steps with 2726 reset in 543 ms.
Computed a total of 275 stabilizing places and 893 stable transitions
Computed a total of 275 stabilizing places and 893 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 150 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2593 steps, including 70 resets, run visited all 1 properties in 15 ms. (steps per millisecond=172 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1090 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1090/1090 places, 2509/2509 transitions.
Applied a total of 0 rules in 70 ms. Remains 1090 /1090 variables (removed 0) and now considering 2509/2509 (removed 0) transitions.
[2024-05-25 08:12:38] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2024-05-25 08:12:38] [INFO ] Invariant cache hit.
[2024-05-25 08:12:39] [INFO ] Implicit Places using invariants in 885 ms returned []
[2024-05-25 08:12:39] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2024-05-25 08:12:39] [INFO ] Invariant cache hit.
[2024-05-25 08:12:40] [INFO ] State equation strengthened by 834 read => feed constraints.
[2024-05-25 08:12:49] [INFO ] Implicit Places using invariants and state equation in 9400 ms returned []
Implicit Place search using SMT with State Equation took 10290 ms to find 0 implicit places.
[2024-05-25 08:12:49] [INFO ] Redundant transitions in 126 ms returned []
[2024-05-25 08:12:49] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2024-05-25 08:12:49] [INFO ] Invariant cache hit.
[2024-05-25 08:12:50] [INFO ] Dead Transitions using invariants and state equation in 1045 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11574 ms. Remains : 1090/1090 places, 2509/2509 transitions.
Computed a total of 275 stabilizing places and 893 stable transitions
Computed a total of 275 stabilizing places and 893 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 151 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Finished random walk after 880 steps, including 23 resets, run visited all 1 properties in 8 ms. (steps per millisecond=110 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 180 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2725 reset in 492 ms.
Product exploration explored 100000 steps with 2730 reset in 547 ms.
Built C files in :
/tmp/ltsmin4344063298720130272
[2024-05-25 08:12:52] [INFO ] Too many transitions (2509) to apply POR reductions. Disabling POR matrices.
[2024-05-25 08:12:52] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4344063298720130272
Running compilation step : cd /tmp/ltsmin4344063298720130272;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4344063298720130272;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4344063298720130272;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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 1090 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1090/1090 places, 2509/2509 transitions.
Applied a total of 0 rules in 117 ms. Remains 1090 /1090 variables (removed 0) and now considering 2509/2509 (removed 0) transitions.
[2024-05-25 08:12:55] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2024-05-25 08:12:55] [INFO ] Invariant cache hit.
[2024-05-25 08:12:56] [INFO ] Implicit Places using invariants in 953 ms returned []
[2024-05-25 08:12:56] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2024-05-25 08:12:56] [INFO ] Invariant cache hit.
[2024-05-25 08:12:57] [INFO ] State equation strengthened by 834 read => feed constraints.
[2024-05-25 08:13:05] [INFO ] Implicit Places using invariants and state equation in 9389 ms returned []
Implicit Place search using SMT with State Equation took 10343 ms to find 0 implicit places.
[2024-05-25 08:13:05] [INFO ] Redundant transitions in 112 ms returned []
[2024-05-25 08:13:05] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2024-05-25 08:13:05] [INFO ] Invariant cache hit.
[2024-05-25 08:13:06] [INFO ] Dead Transitions using invariants and state equation in 1064 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11663 ms. Remains : 1090/1090 places, 2509/2509 transitions.
Built C files in :
/tmp/ltsmin18292095435791183297
[2024-05-25 08:13:06] [INFO ] Too many transitions (2509) to apply POR reductions. Disabling POR matrices.
[2024-05-25 08:13:07] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18292095435791183297
Running compilation step : cd /tmp/ltsmin18292095435791183297;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin18292095435791183297;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin18292095435791183297;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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)
[2024-05-25 08:13:10] [INFO ] Flatten gal took : 166 ms
[2024-05-25 08:13:10] [INFO ] Flatten gal took : 101 ms
[2024-05-25 08:13:10] [INFO ] Time to serialize gal into /tmp/LTL16465816189304316707.gal : 47 ms
[2024-05-25 08:13:10] [INFO ] Time to serialize properties into /tmp/LTL11141972705622318836.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16465816189304316707.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12113596856472461969.hoa' '-atoms' '/tmp/LTL11141972705622318836.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL11141972705622318836.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12113596856472461969.hoa
Detected timeout of ITS tools.
[2024-05-25 08:13:25] [INFO ] Flatten gal took : 132 ms
[2024-05-25 08:13:26] [INFO ] Flatten gal took : 116 ms
[2024-05-25 08:13:26] [INFO ] Time to serialize gal into /tmp/LTL6538571873021611696.gal : 33 ms
[2024-05-25 08:13:26] [INFO ] Time to serialize properties into /tmp/LTL9586746254460039686.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6538571873021611696.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9586746254460039686.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("(Node9HasTheLeafSetOfLx2ToReplaceNode1<=Node4ThinksNode11ShouldBeNodeMasterToReplaceNode7)"))))
Formula 0 simplified : FG!"(Node9HasTheLeafSetOfLx2ToReplaceNode1<=Node4ThinksNode11ShouldBeNodeMasterToReplaceNode7)"
Detected timeout of ITS tools.
[2024-05-25 08:13:41] [INFO ] Flatten gal took : 57 ms
[2024-05-25 08:13:41] [INFO ] Applying decomposition
[2024-05-25 08:13:41] [INFO ] Flatten gal took : 60 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3968052263231443146.txt' '-o' '/tmp/graph3968052263231443146.bin' '-w' '/tmp/graph3968052263231443146.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3968052263231443146.bin' '-l' '-1' '-v' '-w' '/tmp/graph3968052263231443146.weights' '-q' '0' '-e' '0.001'
[2024-05-25 08:13:41] [INFO ] Decomposing Gal with order
[2024-05-25 08:13:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 08:13:42] [INFO ] Removed a total of 384 redundant transitions.
[2024-05-25 08:13:42] [INFO ] Flatten gal took : 400 ms
[2024-05-25 08:13:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 33 ms.
[2024-05-25 08:13:42] [INFO ] Time to serialize gal into /tmp/LTL14763239653392749835.gal : 35 ms
[2024-05-25 08:13:42] [INFO ] Time to serialize properties into /tmp/LTL17138697057390843403.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14763239653392749835.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17138697057390843403.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("(gu13.Node9HasTheLeafSetOfLx2ToReplaceNode1<=gu13.Node4ThinksNode11ShouldBeNodeMasterToReplaceNode7)"))))
Formula 0 simplified : FG!"(gu13.Node9HasTheLeafSetOfLx2ToReplaceNode1<=gu13.Node4ThinksNode11ShouldBeNodeMasterToReplaceNode7)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11996250720487959925
[2024-05-25 08:13:57] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11996250720487959925
Running compilation step : cd /tmp/ltsmin11996250720487959925;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin11996250720487959925;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin11996250720487959925;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-01 finished in 106532 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (F(p1) U p2)))'
Support contains 5 out of 1271 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1271/1271 places, 2794/2794 transitions.
Graph (complete) has 8615 edges and 1271 vertex of which 1270 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 1270 transition count 2778
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 1254 transition count 2778
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 33 place count 1254 transition count 2754
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 81 place count 1230 transition count 2754
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 92 place count 1219 transition count 2739
Iterating global reduction 2 with 11 rules applied. Total rules applied 103 place count 1219 transition count 2739
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 103 place count 1219 transition count 2735
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 111 place count 1215 transition count 2735
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 121 place count 1205 transition count 2693
Iterating global reduction 2 with 10 rules applied. Total rules applied 131 place count 1205 transition count 2693
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 133 place count 1203 transition count 2683
Iterating global reduction 2 with 2 rules applied. Total rules applied 135 place count 1203 transition count 2683
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 193 place count 1174 transition count 2654
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 201 place count 1166 transition count 2646
Iterating global reduction 2 with 8 rules applied. Total rules applied 209 place count 1166 transition count 2646
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 216 place count 1159 transition count 2611
Iterating global reduction 2 with 7 rules applied. Total rules applied 223 place count 1159 transition count 2611
Applied a total of 223 rules in 431 ms. Remains 1159 /1271 variables (removed 112) and now considering 2611/2794 (removed 183) transitions.
[2024-05-25 08:14:01] [INFO ] Flow matrix only has 2339 transitions (discarded 272 similar events)
// Phase 1: matrix 2339 rows 1159 cols
[2024-05-25 08:14:01] [INFO ] Computed 62 invariants in 52 ms
[2024-05-25 08:14:02] [INFO ] Implicit Places using invariants in 1200 ms returned [93, 345, 386, 387, 448, 503, 504, 534, 535, 581, 648, 693, 720, 721, 731, 1050, 1051]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 1203 ms to find 17 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1142/1271 places, 2611/2794 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1132 transition count 2601
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1132 transition count 2601
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 29 place count 1123 transition count 2592
Iterating global reduction 0 with 9 rules applied. Total rules applied 38 place count 1123 transition count 2592
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 1120 transition count 2577
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 1120 transition count 2577
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 56 place count 1114 transition count 2571
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 1108 transition count 2565
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 1108 transition count 2565
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 74 place count 1102 transition count 2535
Iterating global reduction 0 with 6 rules applied. Total rules applied 80 place count 1102 transition count 2535
Applied a total of 80 rules in 352 ms. Remains 1102 /1142 variables (removed 40) and now considering 2535/2611 (removed 76) transitions.
[2024-05-25 08:14:02] [INFO ] Flow matrix only has 2263 transitions (discarded 272 similar events)
// Phase 1: matrix 2263 rows 1102 cols
[2024-05-25 08:14:03] [INFO ] Computed 45 invariants in 53 ms
[2024-05-25 08:14:03] [INFO ] Implicit Places using invariants in 991 ms returned []
[2024-05-25 08:14:03] [INFO ] Flow matrix only has 2263 transitions (discarded 272 similar events)
[2024-05-25 08:14:03] [INFO ] Invariant cache hit.
[2024-05-25 08:14:04] [INFO ] State equation strengthened by 850 read => feed constraints.
[2024-05-25 08:14:13] [INFO ] Implicit Places using invariants and state equation in 9927 ms returned []
Implicit Place search using SMT with State Equation took 10951 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1102/1271 places, 2535/2794 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12938 ms. Remains : 1102/1271 places, 2535/2794 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(LEQ 1 s382), p0:(GT s821 s681), p1:(LEQ s680 s816)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 37 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-03 finished in 13142 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(F((p1||G(p2)))))))'
Support contains 5 out of 1271 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1271/1271 places, 2794/2794 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1270 transition count 2794
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 20 place count 1251 transition count 2771
Iterating global reduction 1 with 19 rules applied. Total rules applied 39 place count 1251 transition count 2771
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 57 place count 1233 transition count 2717
Iterating global reduction 1 with 18 rules applied. Total rules applied 75 place count 1233 transition count 2717
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 83 place count 1225 transition count 2677
Iterating global reduction 1 with 8 rules applied. Total rules applied 91 place count 1225 transition count 2677
Applied a total of 91 rules in 207 ms. Remains 1225 /1271 variables (removed 46) and now considering 2677/2794 (removed 117) transitions.
[2024-05-25 08:14:14] [INFO ] Flow matrix only has 2405 transitions (discarded 272 similar events)
// Phase 1: matrix 2405 rows 1225 cols
[2024-05-25 08:14:14] [INFO ] Computed 62 invariants in 29 ms
[2024-05-25 08:14:15] [INFO ] Implicit Places using invariants in 1055 ms returned [101, 370, 413, 414, 478, 536, 537, 570, 571, 621, 691, 767, 781, 884, 1104, 1105]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 1071 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1209/1271 places, 2677/2794 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1194 transition count 2662
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1194 transition count 2662
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 45 place count 1179 transition count 2647
Iterating global reduction 0 with 15 rules applied. Total rules applied 60 place count 1179 transition count 2647
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 74 place count 1165 transition count 2633
Iterating global reduction 0 with 14 rules applied. Total rules applied 88 place count 1165 transition count 2633
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 96 place count 1157 transition count 2593
Iterating global reduction 0 with 8 rules applied. Total rules applied 104 place count 1157 transition count 2593
Applied a total of 104 rules in 215 ms. Remains 1157 /1209 variables (removed 52) and now considering 2593/2677 (removed 84) transitions.
[2024-05-25 08:14:15] [INFO ] Flow matrix only has 2321 transitions (discarded 272 similar events)
// Phase 1: matrix 2321 rows 1157 cols
[2024-05-25 08:14:15] [INFO ] Computed 46 invariants in 34 ms
[2024-05-25 08:14:16] [INFO ] Implicit Places using invariants in 1001 ms returned []
[2024-05-25 08:14:16] [INFO ] Flow matrix only has 2321 transitions (discarded 272 similar events)
[2024-05-25 08:14:16] [INFO ] Invariant cache hit.
[2024-05-25 08:14:17] [INFO ] State equation strengthened by 854 read => feed constraints.
[2024-05-25 08:14:24] [INFO ] Implicit Places using invariants and state equation in 8153 ms returned []
Implicit Place search using SMT with State Equation took 9176 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1157/1271 places, 2593/2794 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10670 ms. Remains : 1157/1271 places, 2593/2794 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s439 s604), p1:(GT 1 s707), p2:(GT s406 s737)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1229 ms.
Product exploration explored 100000 steps with 50000 reset in 1245 ms.
Computed a total of 325 stabilizing places and 960 stable transitions
Computed a total of 325 stabilizing places and 960 stable transitions
Detected a total of 325/1157 stabilizing places and 960/2593 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 219 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-08 finished in 13476 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1271 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1271/1271 places, 2794/2794 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 1271 transition count 2778
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 1255 transition count 2778
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 32 place count 1255 transition count 2754
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 80 place count 1231 transition count 2754
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 93 place count 1218 transition count 2737
Iterating global reduction 2 with 13 rules applied. Total rules applied 106 place count 1218 transition count 2737
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 106 place count 1218 transition count 2733
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 114 place count 1214 transition count 2733
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 126 place count 1202 transition count 2681
Iterating global reduction 2 with 12 rules applied. Total rules applied 138 place count 1202 transition count 2681
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 140 place count 1200 transition count 2671
Iterating global reduction 2 with 2 rules applied. Total rules applied 142 place count 1200 transition count 2671
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 200 place count 1171 transition count 2642
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 208 place count 1163 transition count 2634
Iterating global reduction 2 with 8 rules applied. Total rules applied 216 place count 1163 transition count 2634
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 223 place count 1156 transition count 2599
Iterating global reduction 2 with 7 rules applied. Total rules applied 230 place count 1156 transition count 2599
Applied a total of 230 rules in 403 ms. Remains 1156 /1271 variables (removed 115) and now considering 2599/2794 (removed 195) transitions.
[2024-05-25 08:14:28] [INFO ] Flow matrix only has 2327 transitions (discarded 272 similar events)
// Phase 1: matrix 2327 rows 1156 cols
[2024-05-25 08:14:28] [INFO ] Computed 63 invariants in 21 ms
[2024-05-25 08:14:28] [INFO ] Implicit Places using invariants in 995 ms returned [93, 345, 386, 387, 388, 445, 500, 501, 531, 532, 578, 645, 689, 715, 716, 726, 826, 1044]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 998 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1138/1271 places, 2599/2794 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1127 transition count 2588
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1127 transition count 2588
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 1116 transition count 2577
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 1116 transition count 2577
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 49 place count 1111 transition count 2552
Iterating global reduction 0 with 5 rules applied. Total rules applied 54 place count 1111 transition count 2552
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 66 place count 1105 transition count 2546
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 72 place count 1099 transition count 2540
Iterating global reduction 0 with 6 rules applied. Total rules applied 78 place count 1099 transition count 2540
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 84 place count 1093 transition count 2510
Iterating global reduction 0 with 6 rules applied. Total rules applied 90 place count 1093 transition count 2510
Applied a total of 90 rules in 359 ms. Remains 1093 /1138 variables (removed 45) and now considering 2510/2599 (removed 89) transitions.
[2024-05-25 08:14:29] [INFO ] Flow matrix only has 2238 transitions (discarded 272 similar events)
// Phase 1: matrix 2238 rows 1093 cols
[2024-05-25 08:14:29] [INFO ] Computed 45 invariants in 23 ms
[2024-05-25 08:14:30] [INFO ] Implicit Places using invariants in 907 ms returned []
[2024-05-25 08:14:30] [INFO ] Flow matrix only has 2238 transitions (discarded 272 similar events)
[2024-05-25 08:14:30] [INFO ] Invariant cache hit.
[2024-05-25 08:14:31] [INFO ] State equation strengthened by 834 read => feed constraints.
[2024-05-25 08:14:39] [INFO ] Implicit Places using invariants and state equation in 9143 ms returned [1071]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10057 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1092/1271 places, 2510/2794 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 1092 transition count 2509
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1091 transition count 2509
Applied a total of 2 rules in 76 ms. Remains 1091 /1092 variables (removed 1) and now considering 2509/2510 (removed 1) transitions.
[2024-05-25 08:14:39] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
// Phase 1: matrix 2237 rows 1091 cols
[2024-05-25 08:14:39] [INFO ] Computed 44 invariants in 41 ms
[2024-05-25 08:14:40] [INFO ] Implicit Places using invariants in 947 ms returned []
[2024-05-25 08:14:40] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2024-05-25 08:14:40] [INFO ] Invariant cache hit.
[2024-05-25 08:14:41] [INFO ] State equation strengthened by 834 read => feed constraints.
[2024-05-25 08:14:49] [INFO ] Implicit Places using invariants and state equation in 8592 ms returned []
Implicit Place search using SMT with State Equation took 9545 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1091/1271 places, 2509/2794 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 21439 ms. Remains : 1091/1271 places, 2509/2794 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s1016 s1076)], 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 2729 reset in 492 ms.
Product exploration explored 100000 steps with 2730 reset in 535 ms.
Computed a total of 276 stabilizing places and 893 stable transitions
Graph (complete) has 7974 edges and 1091 vertex of which 1090 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 276 stabilizing places and 893 stable transitions
Detected a total of 276/1091 stabilizing places and 893/2509 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Finished random walk after 4379 steps, including 118 resets, run visited all 1 properties in 26 ms. (steps per millisecond=168 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1091 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1091/1091 places, 2509/2509 transitions.
Applied a total of 0 rules in 78 ms. Remains 1091 /1091 variables (removed 0) and now considering 2509/2509 (removed 0) transitions.
[2024-05-25 08:14:50] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2024-05-25 08:14:50] [INFO ] Invariant cache hit.
[2024-05-25 08:14:51] [INFO ] Implicit Places using invariants in 934 ms returned []
[2024-05-25 08:14:51] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2024-05-25 08:14:51] [INFO ] Invariant cache hit.
[2024-05-25 08:14:52] [INFO ] State equation strengthened by 834 read => feed constraints.
[2024-05-25 08:15:00] [INFO ] Implicit Places using invariants and state equation in 9055 ms returned []
Implicit Place search using SMT with State Equation took 9994 ms to find 0 implicit places.
[2024-05-25 08:15:00] [INFO ] Redundant transitions in 55 ms returned []
[2024-05-25 08:15:00] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2024-05-25 08:15:00] [INFO ] Invariant cache hit.
[2024-05-25 08:15:01] [INFO ] Dead Transitions using invariants and state equation in 1108 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11246 ms. Remains : 1091/1091 places, 2509/2509 transitions.
Computed a total of 276 stabilizing places and 893 stable transitions
Graph (complete) has 7974 edges and 1091 vertex of which 1090 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 276 stabilizing places and 893 stable transitions
Detected a total of 276/1091 stabilizing places and 893/2509 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 271 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 85226 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 85226 steps, saw 35750 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 08:15:05] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2024-05-25 08:15:05] [INFO ] Invariant cache hit.
[2024-05-25 08:15:05] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 08:15:05] [INFO ] [Nat]Absence check using 31 positive place invariants in 17 ms returned sat
[2024-05-25 08:15:05] [INFO ] [Nat]Absence check using 31 positive and 13 generalized place invariants in 3 ms returned sat
[2024-05-25 08:15:06] [INFO ] After 777ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 08:15:06] [INFO ] State equation strengthened by 834 read => feed constraints.
[2024-05-25 08:15:06] [INFO ] After 159ms SMT Verify possible using 834 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 08:15:06] [INFO ] After 268ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 66 ms.
[2024-05-25 08:15:06] [INFO ] After 1289ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2509/2509 transitions.
Free-agglomeration rule (complex) applied 133 times.
Iterating global reduction 0 with 133 rules applied. Total rules applied 133 place count 1091 transition count 3448
Reduce places removed 133 places and 0 transitions.
Iterating post reduction 0 with 133 rules applied. Total rules applied 266 place count 958 transition count 3448
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 267 place count 958 transition count 3448
Applied a total of 267 rules in 269 ms. Remains 958 /1091 variables (removed 133) and now considering 3448/2509 (removed -939) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 270 ms. Remains : 958/1091 places, 3448/2509 transitions.
Finished random walk after 3369 steps, including 114 resets, run visited all 1 properties in 79 ms. (steps per millisecond=42 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 138 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2729 reset in 484 ms.
Product exploration explored 100000 steps with 2728 reset in 554 ms.
Built C files in :
/tmp/ltsmin2899561920771099084
[2024-05-25 08:15:08] [INFO ] Too many transitions (2509) to apply POR reductions. Disabling POR matrices.
[2024-05-25 08:15:08] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2899561920771099084
Running compilation step : cd /tmp/ltsmin2899561920771099084;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin2899561920771099084;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin2899561920771099084;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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 1091 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1091/1091 places, 2509/2509 transitions.
Applied a total of 0 rules in 73 ms. Remains 1091 /1091 variables (removed 0) and now considering 2509/2509 (removed 0) transitions.
[2024-05-25 08:15:11] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2024-05-25 08:15:11] [INFO ] Invariant cache hit.
[2024-05-25 08:15:12] [INFO ] Implicit Places using invariants in 961 ms returned []
[2024-05-25 08:15:12] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2024-05-25 08:15:12] [INFO ] Invariant cache hit.
[2024-05-25 08:15:13] [INFO ] State equation strengthened by 834 read => feed constraints.
[2024-05-25 08:15:21] [INFO ] Implicit Places using invariants and state equation in 8698 ms returned []
Implicit Place search using SMT with State Equation took 9675 ms to find 0 implicit places.
[2024-05-25 08:15:21] [INFO ] Redundant transitions in 54 ms returned []
[2024-05-25 08:15:21] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2024-05-25 08:15:21] [INFO ] Invariant cache hit.
[2024-05-25 08:15:22] [INFO ] Dead Transitions using invariants and state equation in 1140 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10961 ms. Remains : 1091/1091 places, 2509/2509 transitions.
Built C files in :
/tmp/ltsmin2882843042285854800
[2024-05-25 08:15:22] [INFO ] Too many transitions (2509) to apply POR reductions. Disabling POR matrices.
[2024-05-25 08:15:22] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2882843042285854800
Running compilation step : cd /tmp/ltsmin2882843042285854800;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin2882843042285854800;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin2882843042285854800;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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)
[2024-05-25 08:15:25] [INFO ] Flatten gal took : 191 ms
[2024-05-25 08:15:26] [INFO ] Flatten gal took : 137 ms
[2024-05-25 08:15:26] [INFO ] Time to serialize gal into /tmp/LTL12986850190613807093.gal : 42 ms
[2024-05-25 08:15:26] [INFO ] Time to serialize properties into /tmp/LTL14709157478723928856.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12986850190613807093.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12945638960253772793.hoa' '-atoms' '/tmp/LTL14709157478723928856.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL14709157478723928856.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12945638960253772793.hoa
Detected timeout of ITS tools.
[2024-05-25 08:15:41] [INFO ] Flatten gal took : 82 ms
[2024-05-25 08:15:41] [INFO ] Flatten gal took : 80 ms
[2024-05-25 08:15:41] [INFO ] Time to serialize gal into /tmp/LTL3685400258084893191.gal : 38 ms
[2024-05-25 08:15:41] [INFO ] Time to serialize properties into /tmp/LTL9288022985335794896.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3685400258084893191.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9288022985335794896.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("(Node16HasTheLeafSetOfRx0ToReplaceNode9<=Rx1IsActiveInTheLeafSet)"))))
Formula 0 simplified : FG!"(Node16HasTheLeafSetOfRx0ToReplaceNode9<=Rx1IsActiveInTheLeafSet)"
Detected timeout of ITS tools.
[2024-05-25 08:15:56] [INFO ] Flatten gal took : 56 ms
[2024-05-25 08:15:56] [INFO ] Applying decomposition
[2024-05-25 08:15:56] [INFO ] Flatten gal took : 73 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7969744972935909313.txt' '-o' '/tmp/graph7969744972935909313.bin' '-w' '/tmp/graph7969744972935909313.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7969744972935909313.bin' '-l' '-1' '-v' '-w' '/tmp/graph7969744972935909313.weights' '-q' '0' '-e' '0.001'
[2024-05-25 08:15:56] [INFO ] Decomposing Gal with order
[2024-05-25 08:15:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 08:15:57] [INFO ] Removed a total of 421 redundant transitions.
[2024-05-25 08:15:57] [INFO ] Flatten gal took : 158 ms
[2024-05-25 08:15:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-25 08:15:57] [INFO ] Time to serialize gal into /tmp/LTL8364451675266666396.gal : 14 ms
[2024-05-25 08:15:57] [INFO ] Time to serialize properties into /tmp/LTL461666017947713584.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8364451675266666396.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL461666017947713584.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((G(F("(gu24.Node16HasTheLeafSetOfRx0ToReplaceNode9<=gu24.Rx1IsActiveInTheLeafSet)"))))
Formula 0 simplified : FG!"(gu24.Node16HasTheLeafSetOfRx0ToReplaceNode9<=gu24.Rx1IsActiveInTheLeafSet)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12687475122841181421
[2024-05-25 08:16:12] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12687475122841181421
Running compilation step : cd /tmp/ltsmin12687475122841181421;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin12687475122841181421;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin12687475122841181421;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-10 finished in 107858 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 1271 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1271/1271 places, 2794/2794 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1270 transition count 2794
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 22 place count 1249 transition count 2769
Iterating global reduction 1 with 21 rules applied. Total rules applied 43 place count 1249 transition count 2769
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 63 place count 1229 transition count 2713
Iterating global reduction 1 with 20 rules applied. Total rules applied 83 place count 1229 transition count 2713
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 93 place count 1219 transition count 2663
Iterating global reduction 1 with 10 rules applied. Total rules applied 103 place count 1219 transition count 2663
Applied a total of 103 rules in 180 ms. Remains 1219 /1271 variables (removed 52) and now considering 2663/2794 (removed 131) transitions.
[2024-05-25 08:16:15] [INFO ] Flow matrix only has 2391 transitions (discarded 272 similar events)
// Phase 1: matrix 2391 rows 1219 cols
[2024-05-25 08:16:15] [INFO ] Computed 62 invariants in 30 ms
[2024-05-25 08:16:16] [INFO ] Implicit Places using invariants in 1020 ms returned [101, 370, 411, 412, 413, 475, 534, 569, 570, 620, 690, 736, 764, 765, 775, 878, 1098, 1099]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 1022 ms to find 18 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1201/1271 places, 2663/2794 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1185 transition count 2647
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1185 transition count 2647
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 48 place count 1169 transition count 2631
Iterating global reduction 0 with 16 rules applied. Total rules applied 64 place count 1169 transition count 2631
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 80 place count 1153 transition count 2615
Iterating global reduction 0 with 16 rules applied. Total rules applied 96 place count 1153 transition count 2615
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 106 place count 1143 transition count 2565
Iterating global reduction 0 with 10 rules applied. Total rules applied 116 place count 1143 transition count 2565
Applied a total of 116 rules in 212 ms. Remains 1143 /1201 variables (removed 58) and now considering 2565/2663 (removed 98) transitions.
[2024-05-25 08:16:16] [INFO ] Flow matrix only has 2293 transitions (discarded 272 similar events)
// Phase 1: matrix 2293 rows 1143 cols
[2024-05-25 08:16:16] [INFO ] Computed 44 invariants in 26 ms
[2024-05-25 08:16:17] [INFO ] Implicit Places using invariants in 963 ms returned []
[2024-05-25 08:16:17] [INFO ] Flow matrix only has 2293 transitions (discarded 272 similar events)
[2024-05-25 08:16:17] [INFO ] Invariant cache hit.
[2024-05-25 08:16:18] [INFO ] State equation strengthened by 838 read => feed constraints.
[2024-05-25 08:16:27] [INFO ] Implicit Places using invariants and state equation in 9953 ms returned [1130]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10921 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1142/1271 places, 2565/2794 transitions.
Applied a total of 0 rules in 45 ms. Remains 1142 /1142 variables (removed 0) and now considering 2565/2565 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 12380 ms. Remains : 1142/1271 places, 2565/2794 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ s422 s514)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 152 steps with 2 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-14 finished in 12523 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-05-25 08:16:28] [INFO ] Flatten gal took : 71 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12045661807714779021
[2024-05-25 08:16:28] [INFO ] Too many transitions (2794) to apply POR reductions. Disabling POR matrices.
[2024-05-25 08:16:28] [INFO ] Applying decomposition
[2024-05-25 08:16:28] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12045661807714779021
Running compilation step : cd /tmp/ltsmin12045661807714779021;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-25 08:16:28] [INFO ] Flatten gal took : 87 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph300412024026573862.txt' '-o' '/tmp/graph300412024026573862.bin' '-w' '/tmp/graph300412024026573862.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph300412024026573862.bin' '-l' '-1' '-v' '-w' '/tmp/graph300412024026573862.weights' '-q' '0' '-e' '0.001'
[2024-05-25 08:16:28] [INFO ] Decomposing Gal with order
[2024-05-25 08:16:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 08:16:28] [INFO ] Removed a total of 1954 redundant transitions.
[2024-05-25 08:16:28] [INFO ] Flatten gal took : 209 ms
[2024-05-25 08:16:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 119 labels/synchronizations in 31 ms.
[2024-05-25 08:16:29] [INFO ] Time to serialize gal into /tmp/LTLCardinality5278320799876369402.gal : 17 ms
[2024-05-25 08:16:29] [INFO ] Time to serialize properties into /tmp/LTLCardinality18090992151010675266.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality5278320799876369402.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality18090992151010675266.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 LTL properties
Checking formula 0 : !((G(F("(gu84.Node9HasTheLeafSetOfLx2ToReplaceNode1<=gu84.Node4ThinksNode11ShouldBeNodeMasterToReplaceNode7)"))))
Formula 0 simplified : FG!"(gu84.Node9HasTheLeafSetOfLx2ToReplaceNode1<=gu84.Node4ThinksNode11ShouldBeNodeMasterToReplaceNode7)"
Compilation finished in 6201 ms.
Running link step : cd /tmp/ltsmin12045661807714779021;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin12045661807714779021;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
LTSmin run took 1317810 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-01 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin12045661807714779021;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp1==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-25 08:38:36] [INFO ] Flatten gal took : 206 ms
[2024-05-25 08:38:36] [INFO ] Time to serialize gal into /tmp/LTLCardinality5987180704600496663.gal : 48 ms
[2024-05-25 08:38:36] [INFO ] Time to serialize properties into /tmp/LTLCardinality6454915118887614735.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality5987180704600496663.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6454915118887614735.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((G(F("(Node16HasTheLeafSetOfRx0ToReplaceNode9<=Rx1IsActiveInTheLeafSet)"))))
Formula 0 simplified : FG!"(Node16HasTheLeafSetOfRx0ToReplaceNode9<=Rx1IsActiveInTheLeafSet)"
LTSmin run took 1307723 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 3011601 ms.

BK_STOP 1716627623142

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="MultiCrashLeafsetExtension-PT-S16C05"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is MultiCrashLeafsetExtension-PT-S16C05, 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 r263-tall-171654371900017"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C05.tgz
mv MultiCrashLeafsetExtension-PT-S16C05 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 ;