Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r295-tall-167873947700323.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is PhilosophersDyn-PT-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r295-tall-167873947700323
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 39K Feb 26 12:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 195K Feb 26 12:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 288K Feb 26 12:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.5M Feb 26 12:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 138K Feb 25 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 537K Feb 25 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 89K Feb 26 12:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 443K Feb 26 12:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.3M Feb 26 12:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 6.5M Feb 26 12:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 16:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 14K Feb 25 16:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.8M Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678825307101

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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PhilosophersDyn-PT-10
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 20:21:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 20:21:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 20:21:48] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2023-03-14 20:21:48] [INFO ] Transformed 170 places.
[2023-03-14 20:21:48] [INFO ] Transformed 2310 transitions.
[2023-03-14 20:21:48] [INFO ] Parsed PT model containing 170 places and 2310 transitions and 18190 arcs in 233 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
FORMULA PhilosophersDyn-PT-10-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 170 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 2265/2265 transitions.
Applied a total of 0 rules in 42 ms. Remains 170 /170 variables (removed 0) and now considering 2265/2265 (removed 0) transitions.
[2023-03-14 20:21:49] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
// Phase 1: matrix 1905 rows 170 cols
[2023-03-14 20:21:49] [INFO ] Computed 39 place invariants in 83 ms
[2023-03-14 20:21:50] [INFO ] Dead Transitions using invariants and state equation in 1047 ms found 380 transitions.
Found 380 dead transitions using SMT.
Drop transitions removed 380 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 380 transitions.
// Phase 1: matrix 1885 rows 170 cols
[2023-03-14 20:21:50] [INFO ] Computed 39 place invariants in 52 ms
[2023-03-14 20:21:50] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-14 20:21:50] [INFO ] Invariant cache hit.
[2023-03-14 20:21:50] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:21:50] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 633 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/170 places, 1885/2265 transitions.
Applied a total of 0 rules in 16 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1764 ms. Remains : 170/170 places, 1885/2265 transitions.
Support contains 170 out of 170 places after structural reductions.
[2023-03-14 20:21:51] [INFO ] Flatten gal took : 203 ms
[2023-03-14 20:21:51] [INFO ] Flatten gal took : 124 ms
[2023-03-14 20:21:51] [INFO ] Input system was already deterministic with 1885 transitions.
Incomplete random walk after 10000 steps, including 1182 resets, run finished after 462 ms. (steps per millisecond=21 ) properties (out of 32) seen :17
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-14 20:21:52] [INFO ] Invariant cache hit.
[2023-03-14 20:21:54] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-14 20:21:54] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 20 ms returned sat
[2023-03-14 20:21:54] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-14 20:21:54] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-14 20:21:54] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 9 ms returned sat
[2023-03-14 20:21:55] [INFO ] After 896ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :10
[2023-03-14 20:21:55] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:22:09] [INFO ] After 13988ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :5 sat :9
[2023-03-14 20:22:09] [INFO ] Deduced a trap composed of 82 places in 284 ms of which 4 ms to minimize.
[2023-03-14 20:22:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 421 ms
[2023-03-14 20:22:10] [INFO ] Deduced a trap composed of 65 places in 226 ms of which 0 ms to minimize.
[2023-03-14 20:22:11] [INFO ] Deduced a trap composed of 72 places in 393 ms of which 1 ms to minimize.
[2023-03-14 20:22:11] [INFO ] Deduced a trap composed of 68 places in 243 ms of which 1 ms to minimize.
[2023-03-14 20:22:11] [INFO ] Deduced a trap composed of 82 places in 256 ms of which 0 ms to minimize.
[2023-03-14 20:22:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1663 ms
[2023-03-14 20:22:12] [INFO ] After 17188ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :9
Attempting to minimize the solution found.
Minimization took 902 ms.
[2023-03-14 20:22:13] [INFO ] After 19164ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :9
Fused 15 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 72 ms.
Support contains 63 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 208 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:22:13] [INFO ] Invariant cache hit.
[2023-03-14 20:22:14] [INFO ] Dead Transitions using invariants and state equation in 607 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 816 ms. Remains : 170/170 places, 1885/1885 transitions.
Incomplete random walk after 10000 steps, including 1191 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 131164 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 131164 steps, saw 34277 distinct states, run finished after 3002 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 10 properties.
[2023-03-14 20:22:17] [INFO ] Invariant cache hit.
[2023-03-14 20:22:18] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-14 20:22:18] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 10 ms returned sat
[2023-03-14 20:22:18] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-14 20:22:18] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-14 20:22:18] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 10 ms returned sat
[2023-03-14 20:22:19] [INFO ] After 897ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-14 20:22:19] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:22:43] [INFO ] After 24006ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-14 20:22:43] [INFO ] After 24007ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-14 20:22:43] [INFO ] After 25018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 10 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 39 ms.
Support contains 63 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 131 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 145 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:22:43] [INFO ] Invariant cache hit.
[2023-03-14 20:22:43] [INFO ] Implicit Places using invariants in 314 ms returned []
[2023-03-14 20:22:43] [INFO ] Invariant cache hit.
[2023-03-14 20:22:44] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:22:48] [INFO ] Implicit Places using invariants and state equation in 5029 ms returned []
Implicit Place search using SMT with State Equation took 5346 ms to find 0 implicit places.
[2023-03-14 20:22:48] [INFO ] Redundant transitions in 131 ms returned []
[2023-03-14 20:22:48] [INFO ] Invariant cache hit.
[2023-03-14 20:22:49] [INFO ] Dead Transitions using invariants and state equation in 633 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6270 ms. Remains : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 44 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running SMT prover for 10 properties.
[2023-03-14 20:22:49] [INFO ] Invariant cache hit.
[2023-03-14 20:22:49] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-14 20:22:49] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 9 ms returned sat
[2023-03-14 20:22:49] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-14 20:22:49] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-14 20:22:49] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 9 ms returned sat
[2023-03-14 20:22:50] [INFO ] After 882ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-14 20:22:51] [INFO ] After 1689ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 468 ms.
[2023-03-14 20:22:52] [INFO ] After 2248ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Successfully simplified 5 atomic propositions for a total of 15 simplifications.
FORMULA PhilosophersDyn-PT-10-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 204 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:22:54] [INFO ] Invariant cache hit.
[2023-03-14 20:22:54] [INFO ] Dead Transitions using invariants and state equation in 635 ms found 0 transitions.
[2023-03-14 20:22:54] [INFO ] Invariant cache hit.
[2023-03-14 20:22:54] [INFO ] Implicit Places using invariants in 288 ms returned []
[2023-03-14 20:22:54] [INFO ] Invariant cache hit.
[2023-03-14 20:22:55] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:23:01] [INFO ] Implicit Places using invariants and state equation in 6386 ms returned []
Implicit Place search using SMT with State Equation took 6680 ms to find 0 implicit places.
[2023-03-14 20:23:01] [INFO ] Redundant transitions in 60 ms returned []
[2023-03-14 20:23:01] [INFO ] Invariant cache hit.
[2023-03-14 20:23:02] [INFO ] Dead Transitions using invariants and state equation in 588 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8185 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s26 s39 s42 s68 s75 s96 s98 s120 s157 s165) (ADD s3 s13 s31 s35 s47 s97 s108 s127 s140 s146))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 18 steps with 1 reset in 5 ms.
FORMULA PhilosophersDyn-PT-10-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLCardinality-00 finished in 8645 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 151 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:23:02] [INFO ] Invariant cache hit.
[2023-03-14 20:23:02] [INFO ] Dead Transitions using invariants and state equation in 625 ms found 0 transitions.
[2023-03-14 20:23:02] [INFO ] Invariant cache hit.
[2023-03-14 20:23:03] [INFO ] Implicit Places using invariants in 288 ms returned []
[2023-03-14 20:23:03] [INFO ] Invariant cache hit.
[2023-03-14 20:23:03] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:23:09] [INFO ] Implicit Places using invariants and state equation in 6414 ms returned []
Implicit Place search using SMT with State Equation took 6705 ms to find 0 implicit places.
[2023-03-14 20:23:09] [INFO ] Redundant transitions in 119 ms returned []
[2023-03-14 20:23:09] [INFO ] Invariant cache hit.
[2023-03-14 20:23:10] [INFO ] Dead Transitions using invariants and state equation in 600 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8209 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 617 ms :[(NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ (ADD s26 s39 s42 s68 s75 s96 s98 s120 s157 s165) (ADD s0 s19 s43 s63 s83 s107 s115 s152 s153 s155))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 11895 reset in 1194 ms.
Product exploration explored 100000 steps with 11898 reset in 1172 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 929 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1192 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 176110 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 176110 steps, saw 45826 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-14 20:23:17] [INFO ] Invariant cache hit.
[2023-03-14 20:23:17] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 20:23:17] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-14 20:23:17] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 9 ms returned sat
[2023-03-14 20:23:18] [INFO ] After 424ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 20:23:18] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:23:21] [INFO ] After 3009ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 20:23:21] [INFO ] After 3091ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-14 20:23:21] [INFO ] After 3643ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 101 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:23:21] [INFO ] Invariant cache hit.
[2023-03-14 20:23:21] [INFO ] Dead Transitions using invariants and state equation in 575 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 676 ms. Remains : 170/170 places, 1885/1885 transitions.
Incomplete random walk after 10000 steps, including 1191 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 176692 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 176692 steps, saw 45955 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-14 20:23:25] [INFO ] Invariant cache hit.
[2023-03-14 20:23:25] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 20:23:25] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-14 20:23:25] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 8 ms returned sat
[2023-03-14 20:23:25] [INFO ] After 405ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 20:23:25] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:23:28] [INFO ] After 3083ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 20:23:28] [INFO ] After 3154ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-14 20:23:28] [INFO ] After 3664ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 101 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 100 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:23:29] [INFO ] Invariant cache hit.
[2023-03-14 20:23:29] [INFO ] Implicit Places using invariants in 295 ms returned []
[2023-03-14 20:23:29] [INFO ] Invariant cache hit.
[2023-03-14 20:23:29] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:23:35] [INFO ] Implicit Places using invariants and state equation in 6443 ms returned []
Implicit Place search using SMT with State Equation took 6745 ms to find 0 implicit places.
[2023-03-14 20:23:35] [INFO ] Redundant transitions in 58 ms returned []
[2023-03-14 20:23:35] [INFO ] Invariant cache hit.
[2023-03-14 20:23:36] [INFO ] Dead Transitions using invariants and state equation in 577 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7494 ms. Remains : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 2685
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 2685
Applied a total of 20 rules in 138 ms. Remains 160 /170 variables (removed 10) and now considering 2685/1885 (removed -800) transitions.
Running SMT prover for 1 properties.
[2023-03-14 20:23:36] [INFO ] Flow matrix only has 2595 transitions (discarded 90 similar events)
// Phase 1: matrix 2595 rows 160 cols
[2023-03-14 20:23:36] [INFO ] Computed 39 place invariants in 58 ms
[2023-03-14 20:23:36] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 20:23:36] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-14 20:23:36] [INFO ] [Nat]Absence check using 14 positive and 25 generalized place invariants in 8 ms returned sat
[2023-03-14 20:23:37] [INFO ] After 624ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 20:23:37] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-14 20:23:46] [INFO ] After 9053ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-14 20:23:46] [INFO ] After 9758ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 608 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 126 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2023-03-14 20:23:47] [INFO ] Computed 39 place invariants in 46 ms
[2023-03-14 20:23:47] [INFO ] Dead Transitions using invariants and state equation in 650 ms found 0 transitions.
[2023-03-14 20:23:47] [INFO ] Invariant cache hit.
[2023-03-14 20:23:48] [INFO ] Implicit Places using invariants in 296 ms returned []
[2023-03-14 20:23:48] [INFO ] Invariant cache hit.
[2023-03-14 20:23:48] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:23:54] [INFO ] Implicit Places using invariants and state equation in 6410 ms returned []
Implicit Place search using SMT with State Equation took 6709 ms to find 0 implicit places.
[2023-03-14 20:23:54] [INFO ] Redundant transitions in 59 ms returned []
[2023-03-14 20:23:54] [INFO ] Invariant cache hit.
[2023-03-14 20:23:55] [INFO ] Dead Transitions using invariants and state equation in 614 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8181 ms. Remains : 170/170 places, 1885/1885 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 1730 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1184 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 177722 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 177722 steps, saw 46197 distinct states, run finished after 3002 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-14 20:24:00] [INFO ] Invariant cache hit.
[2023-03-14 20:24:00] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 20:24:00] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-14 20:24:00] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 9 ms returned sat
[2023-03-14 20:24:00] [INFO ] After 424ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 20:24:00] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:24:03] [INFO ] After 3060ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 20:24:03] [INFO ] After 3134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-14 20:24:04] [INFO ] After 3669ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 100 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:24:04] [INFO ] Invariant cache hit.
[2023-03-14 20:24:04] [INFO ] Dead Transitions using invariants and state equation in 579 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 696 ms. Remains : 170/170 places, 1885/1885 transitions.
Incomplete random walk after 10000 steps, including 1189 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 176049 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 176049 steps, saw 45811 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-14 20:24:07] [INFO ] Invariant cache hit.
[2023-03-14 20:24:07] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 20:24:07] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-14 20:24:07] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 8 ms returned sat
[2023-03-14 20:24:08] [INFO ] After 396ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 20:24:08] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:24:11] [INFO ] After 3043ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 20:24:11] [INFO ] After 3116ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-14 20:24:11] [INFO ] After 3616ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 103 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 97 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:24:11] [INFO ] Invariant cache hit.
[2023-03-14 20:24:12] [INFO ] Implicit Places using invariants in 301 ms returned []
[2023-03-14 20:24:12] [INFO ] Invariant cache hit.
[2023-03-14 20:24:12] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:24:18] [INFO ] Implicit Places using invariants and state equation in 6404 ms returned []
Implicit Place search using SMT with State Equation took 6706 ms to find 0 implicit places.
[2023-03-14 20:24:18] [INFO ] Redundant transitions in 58 ms returned []
[2023-03-14 20:24:18] [INFO ] Invariant cache hit.
[2023-03-14 20:24:19] [INFO ] Dead Transitions using invariants and state equation in 590 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7463 ms. Remains : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 2685
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 2685
Applied a total of 20 rules in 127 ms. Remains 160 /170 variables (removed 10) and now considering 2685/1885 (removed -800) transitions.
Running SMT prover for 1 properties.
[2023-03-14 20:24:19] [INFO ] Flow matrix only has 2595 transitions (discarded 90 similar events)
// Phase 1: matrix 2595 rows 160 cols
[2023-03-14 20:24:19] [INFO ] Computed 39 place invariants in 38 ms
[2023-03-14 20:24:19] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 20:24:19] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-14 20:24:19] [INFO ] [Nat]Absence check using 14 positive and 25 generalized place invariants in 8 ms returned sat
[2023-03-14 20:24:19] [INFO ] After 490ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 20:24:19] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-14 20:24:28] [INFO ] After 9065ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-14 20:24:28] [INFO ] After 9609ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 452 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Product exploration explored 100000 steps with 11924 reset in 1105 ms.
Product exploration explored 100000 steps with 11925 reset in 1115 ms.
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 118 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2023-03-14 20:24:31] [INFO ] Computed 39 place invariants in 41 ms
[2023-03-14 20:24:32] [INFO ] Dead Transitions using invariants and state equation in 642 ms found 0 transitions.
[2023-03-14 20:24:32] [INFO ] Invariant cache hit.
[2023-03-14 20:24:32] [INFO ] Implicit Places using invariants in 287 ms returned []
[2023-03-14 20:24:32] [INFO ] Invariant cache hit.
[2023-03-14 20:24:33] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:24:39] [INFO ] Implicit Places using invariants and state equation in 6396 ms returned []
Implicit Place search using SMT with State Equation took 6685 ms to find 0 implicit places.
[2023-03-14 20:24:39] [INFO ] Redundant transitions in 63 ms returned []
[2023-03-14 20:24:39] [INFO ] Invariant cache hit.
[2023-03-14 20:24:39] [INFO ] Dead Transitions using invariants and state equation in 592 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8114 ms. Remains : 170/170 places, 1885/1885 transitions.
Treatment of property PhilosophersDyn-PT-10-LTLCardinality-01 finished in 97872 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(p1))))'
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 7 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:24:40] [INFO ] Invariant cache hit.
[2023-03-14 20:24:40] [INFO ] Dead Transitions using invariants and state equation in 663 ms found 0 transitions.
[2023-03-14 20:24:40] [INFO ] Invariant cache hit.
[2023-03-14 20:24:41] [INFO ] Implicit Places using invariants in 302 ms returned []
[2023-03-14 20:24:41] [INFO ] Invariant cache hit.
[2023-03-14 20:24:41] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:24:47] [INFO ] Implicit Places using invariants and state equation in 6410 ms returned []
Implicit Place search using SMT with State Equation took 6714 ms to find 0 implicit places.
[2023-03-14 20:24:47] [INFO ] Invariant cache hit.
[2023-03-14 20:24:48] [INFO ] Dead Transitions using invariants and state equation in 575 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7965 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 1473 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(GT (ADD s0 s19 s43 s63 s83 s107 s115 s152 s153 s155) (ADD s2 s38 s59 s77 s94 s102 s112 s116 s145 s166)), p0:(AND (GT 1 (ADD s2 s38 s59 s77 s94 s102 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 11948 reset in 1131 ms.
Product exploration explored 100000 steps with 11933 reset in 1164 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p1), true, (X (X p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 1058 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 1206 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 175228 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 175228 steps, saw 45627 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-14 20:24:56] [INFO ] Invariant cache hit.
[2023-03-14 20:24:56] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-14 20:24:56] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 9 ms returned sat
[2023-03-14 20:24:56] [INFO ] After 382ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-14 20:24:56] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:24:59] [INFO ] After 3279ms SMT Verify possible using 1010 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 20:24:59] [INFO ] After 3720ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 20:24:59] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2023-03-14 20:24:59] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 12 ms returned sat
[2023-03-14 20:25:00] [INFO ] After 395ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 20:25:03] [INFO ] After 3411ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 20:25:03] [INFO ] After 3481ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-14 20:25:03] [INFO ] After 3976ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 93 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:25:03] [INFO ] Invariant cache hit.
[2023-03-14 20:25:04] [INFO ] Dead Transitions using invariants and state equation in 582 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 676 ms. Remains : 170/170 places, 1885/1885 transitions.
Incomplete random walk after 10000 steps, including 1185 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 175647 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 175647 steps, saw 45722 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-14 20:25:07] [INFO ] Invariant cache hit.
[2023-03-14 20:25:07] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-14 20:25:07] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 8 ms returned sat
[2023-03-14 20:25:08] [INFO ] After 402ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-14 20:25:08] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:25:11] [INFO ] After 3310ms SMT Verify possible using 1010 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 20:25:11] [INFO ] After 3772ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 20:25:11] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-14 20:25:11] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 8 ms returned sat
[2023-03-14 20:25:11] [INFO ] After 401ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 20:25:15] [INFO ] After 3476ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 20:25:15] [INFO ] After 3546ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-14 20:25:15] [INFO ] After 4070ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 95 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 100 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:25:15] [INFO ] Invariant cache hit.
[2023-03-14 20:25:16] [INFO ] Implicit Places using invariants in 297 ms returned []
[2023-03-14 20:25:16] [INFO ] Invariant cache hit.
[2023-03-14 20:25:16] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:25:22] [INFO ] Implicit Places using invariants and state equation in 6425 ms returned []
Implicit Place search using SMT with State Equation took 6724 ms to find 0 implicit places.
[2023-03-14 20:25:22] [INFO ] Redundant transitions in 56 ms returned []
[2023-03-14 20:25:22] [INFO ] Invariant cache hit.
[2023-03-14 20:25:23] [INFO ] Dead Transitions using invariants and state equation in 592 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7480 ms. Remains : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 2685
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 2685
Applied a total of 20 rules in 140 ms. Remains 160 /170 variables (removed 10) and now considering 2685/1885 (removed -800) transitions.
Running SMT prover for 1 properties.
[2023-03-14 20:25:23] [INFO ] Flow matrix only has 2595 transitions (discarded 90 similar events)
// Phase 1: matrix 2595 rows 160 cols
[2023-03-14 20:25:23] [INFO ] Computed 39 place invariants in 37 ms
[2023-03-14 20:25:23] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-14 20:25:23] [INFO ] [Real]Absence check using 14 positive and 25 generalized place invariants in 8 ms returned sat
[2023-03-14 20:25:23] [INFO ] After 498ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-14 20:25:23] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-14 20:25:24] [INFO ] After 656ms SMT Verify possible using 100 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 20:25:24] [INFO ] After 1208ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 20:25:24] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-14 20:25:24] [INFO ] [Nat]Absence check using 14 positive and 25 generalized place invariants in 8 ms returned sat
[2023-03-14 20:25:25] [INFO ] After 489ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 20:25:25] [INFO ] After 418ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 20:25:25] [INFO ] After 496ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 62 ms.
[2023-03-14 20:25:25] [INFO ] After 1095ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p1), true, (X (X p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 6 factoid took 313 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p1), (NOT p1)]
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 15 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2023-03-14 20:25:26] [INFO ] Computed 39 place invariants in 35 ms
[2023-03-14 20:25:26] [INFO ] Dead Transitions using invariants and state equation in 599 ms found 0 transitions.
[2023-03-14 20:25:26] [INFO ] Invariant cache hit.
[2023-03-14 20:25:26] [INFO ] Implicit Places using invariants in 288 ms returned []
[2023-03-14 20:25:26] [INFO ] Invariant cache hit.
[2023-03-14 20:25:27] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:25:33] [INFO ] Implicit Places using invariants and state equation in 6413 ms returned []
Implicit Place search using SMT with State Equation took 6702 ms to find 0 implicit places.
[2023-03-14 20:25:33] [INFO ] Invariant cache hit.
[2023-03-14 20:25:33] [INFO ] Dead Transitions using invariants and state equation in 561 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7879 ms. Remains : 170/170 places, 1885/1885 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 140 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 1200 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 174691 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 174691 steps, saw 45482 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-14 20:25:37] [INFO ] Invariant cache hit.
[2023-03-14 20:25:37] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-14 20:25:37] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 8 ms returned sat
[2023-03-14 20:25:37] [INFO ] After 395ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-14 20:25:37] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:25:41] [INFO ] After 3261ms SMT Verify possible using 1010 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 20:25:41] [INFO ] After 3731ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 20:25:41] [INFO ] [Nat]Absence check using 12 positive place invariants in 1 ms returned sat
[2023-03-14 20:25:41] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 9 ms returned sat
[2023-03-14 20:25:41] [INFO ] After 382ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 20:25:45] [INFO ] After 3458ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 20:25:45] [INFO ] After 3533ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-14 20:25:45] [INFO ] After 4023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 100 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:25:45] [INFO ] Invariant cache hit.
[2023-03-14 20:25:45] [INFO ] Dead Transitions using invariants and state equation in 572 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 673 ms. Remains : 170/170 places, 1885/1885 transitions.
Incomplete random walk after 10000 steps, including 1192 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 176580 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 176580 steps, saw 45926 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-14 20:25:48] [INFO ] Invariant cache hit.
[2023-03-14 20:25:48] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-14 20:25:49] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 10 ms returned sat
[2023-03-14 20:25:49] [INFO ] After 408ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-14 20:25:49] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:25:52] [INFO ] After 3307ms SMT Verify possible using 1010 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 20:25:52] [INFO ] After 3783ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 20:25:52] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-14 20:25:52] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 15 ms returned sat
[2023-03-14 20:25:53] [INFO ] After 391ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 20:25:56] [INFO ] After 3506ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 20:25:56] [INFO ] After 3578ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-03-14 20:25:56] [INFO ] After 4078ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 96 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 100 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:25:57] [INFO ] Invariant cache hit.
[2023-03-14 20:25:57] [INFO ] Implicit Places using invariants in 292 ms returned []
[2023-03-14 20:25:57] [INFO ] Invariant cache hit.
[2023-03-14 20:25:57] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:26:03] [INFO ] Implicit Places using invariants and state equation in 6393 ms returned []
Implicit Place search using SMT with State Equation took 6687 ms to find 0 implicit places.
[2023-03-14 20:26:03] [INFO ] Redundant transitions in 55 ms returned []
[2023-03-14 20:26:03] [INFO ] Invariant cache hit.
[2023-03-14 20:26:04] [INFO ] Dead Transitions using invariants and state equation in 582 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7432 ms. Remains : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 2685
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 2685
Applied a total of 20 rules in 135 ms. Remains 160 /170 variables (removed 10) and now considering 2685/1885 (removed -800) transitions.
Running SMT prover for 1 properties.
[2023-03-14 20:26:04] [INFO ] Flow matrix only has 2595 transitions (discarded 90 similar events)
// Phase 1: matrix 2595 rows 160 cols
[2023-03-14 20:26:04] [INFO ] Computed 39 place invariants in 34 ms
[2023-03-14 20:26:04] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-14 20:26:04] [INFO ] [Real]Absence check using 14 positive and 25 generalized place invariants in 8 ms returned sat
[2023-03-14 20:26:05] [INFO ] After 484ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-14 20:26:05] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-14 20:26:05] [INFO ] After 642ms SMT Verify possible using 100 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 20:26:05] [INFO ] After 1181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 20:26:05] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-14 20:26:05] [INFO ] [Nat]Absence check using 14 positive and 25 generalized place invariants in 8 ms returned sat
[2023-03-14 20:26:06] [INFO ] After 478ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 20:26:06] [INFO ] After 402ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 20:26:06] [INFO ] After 486ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-14 20:26:06] [INFO ] After 1063ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 296 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 11954 reset in 1066 ms.
Product exploration explored 100000 steps with 11929 reset in 1073 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p1), (NOT p1)]
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 145 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2023-03-14 20:26:14] [INFO ] Computed 39 place invariants in 35 ms
[2023-03-14 20:26:14] [INFO ] Dead Transitions using invariants and state equation in 620 ms found 0 transitions.
[2023-03-14 20:26:14] [INFO ] Redundant transitions in 53 ms returned []
[2023-03-14 20:26:14] [INFO ] Invariant cache hit.
[2023-03-14 20:26:15] [INFO ] Dead Transitions using invariants and state equation in 562 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1390 ms. Remains : 170/170 places, 1885/1885 transitions.
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 8 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:26:15] [INFO ] Invariant cache hit.
[2023-03-14 20:26:16] [INFO ] Dead Transitions using invariants and state equation in 583 ms found 0 transitions.
[2023-03-14 20:26:16] [INFO ] Invariant cache hit.
[2023-03-14 20:26:16] [INFO ] Implicit Places using invariants in 284 ms returned []
[2023-03-14 20:26:16] [INFO ] Invariant cache hit.
[2023-03-14 20:26:16] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:26:22] [INFO ] Implicit Places using invariants and state equation in 6432 ms returned []
Implicit Place search using SMT with State Equation took 6718 ms to find 0 implicit places.
[2023-03-14 20:26:22] [INFO ] Invariant cache hit.
[2023-03-14 20:26:23] [INFO ] Dead Transitions using invariants and state equation in 575 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7886 ms. Remains : 170/170 places, 1885/1885 transitions.
Treatment of property PhilosophersDyn-PT-10-LTLCardinality-02 finished in 103391 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U p1)||X(!p1))))'
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 118 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:26:23] [INFO ] Invariant cache hit.
[2023-03-14 20:26:24] [INFO ] Dead Transitions using invariants and state equation in 574 ms found 0 transitions.
[2023-03-14 20:26:24] [INFO ] Invariant cache hit.
[2023-03-14 20:26:24] [INFO ] Implicit Places using invariants in 283 ms returned []
[2023-03-14 20:26:24] [INFO ] Invariant cache hit.
[2023-03-14 20:26:24] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:26:30] [INFO ] Implicit Places using invariants and state equation in 6495 ms returned []
Implicit Place search using SMT with State Equation took 6779 ms to find 0 implicit places.
[2023-03-14 20:26:31] [INFO ] Redundant transitions in 57 ms returned []
[2023-03-14 20:26:31] [INFO ] Invariant cache hit.
[2023-03-14 20:26:31] [INFO ] Dead Transitions using invariants and state equation in 572 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8110 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 431 ms :[true, false, p1]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ 2 (ADD s12 s24 s30 s65 s66 s71 s99 s124 s138 s159)), p0:(LEQ 3 (ADD s0 s19 s43 s63 s83 s107 s115 s152 s153 s155))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 11896 reset in 1132 ms.
Product exploration explored 100000 steps with 11951 reset in 1127 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (OR p1 p0)), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), true, (X (X (OR p1 p0))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 527 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[true, false, p1]
Incomplete random walk after 10000 steps, including 1188 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-14 20:26:35] [INFO ] Invariant cache hit.
[2023-03-14 20:26:35] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-14 20:26:35] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 8 ms returned sat
[2023-03-14 20:26:35] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 20:26:35] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-14 20:26:35] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 9 ms returned sat
[2023-03-14 20:26:35] [INFO ] After 427ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 20:26:35] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:26:47] [INFO ] After 11790ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 20:26:47] [INFO ] After 11864ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-14 20:26:47] [INFO ] After 12403ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 1875
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 1875
Applied a total of 20 rules in 197 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2023-03-14 20:26:47] [INFO ] Computed 39 place invariants in 38 ms
[2023-03-14 20:26:48] [INFO ] Dead Transitions using invariants and state equation in 608 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 806 ms. Remains : 160/170 places, 1875/1885 transitions.
Incomplete random walk after 10000 steps, including 1183 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 162866 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :{}
Probabilistic random walk after 162866 steps, saw 40464 distinct states, run finished after 3001 ms. (steps per millisecond=54 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-14 20:26:51] [INFO ] Invariant cache hit.
[2023-03-14 20:26:51] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-14 20:26:51] [INFO ] [Real]Absence check using 14 positive and 25 generalized place invariants in 8 ms returned sat
[2023-03-14 20:26:51] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 20:26:51] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-14 20:26:51] [INFO ] [Nat]Absence check using 14 positive and 25 generalized place invariants in 7 ms returned sat
[2023-03-14 20:26:52] [INFO ] After 415ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 20:26:52] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:27:10] [INFO ] After 18141ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-14 20:27:10] [INFO ] After 18619ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 20 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 102 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 160/160 places, 1875/1875 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 94 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2023-03-14 20:27:10] [INFO ] Invariant cache hit.
[2023-03-14 20:27:10] [INFO ] Implicit Places using invariants in 321 ms returned [2, 37, 56, 72, 89, 95, 105, 109, 137, 156]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 334 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 150/160 places, 1875/1875 transitions.
Free-agglomeration rule applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 150 transition count 1865
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 140 transition count 1865
Applied a total of 20 rules in 197 ms. Remains 140 /150 variables (removed 10) and now considering 1865/1875 (removed 10) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2023-03-14 20:27:11] [INFO ] Computed 29 place invariants in 26 ms
[2023-03-14 20:27:11] [INFO ] Implicit Places using invariants in 324 ms returned []
[2023-03-14 20:27:11] [INFO ] Invariant cache hit.
[2023-03-14 20:27:11] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:27:17] [INFO ] Implicit Places using invariants and state equation in 5617 ms returned []
Implicit Place search using SMT with State Equation took 5944 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 140/160 places, 1865/1875 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6570 ms. Remains : 140/160 places, 1865/1875 transitions.
Incomplete random walk after 10000 steps, including 1801 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 113 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 113 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Probably explored full state space saw : 14836 states, properties seen :0
Probabilistic random walk after 48551 steps, saw 14836 distinct states, run finished after 1212 ms. (steps per millisecond=40 ) properties seen :0
Explored full state space saw : 14836 states, properties seen :0
Exhaustive walk after 48551 steps, saw 14836 distinct states, run finished after 1119 ms. (steps per millisecond=43 ) properties seen :0
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (OR p1 p0)), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), true, (X (X (OR p1 p0))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (G (OR p0 p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F p1)]
Property proved to be true thanks to knowledge :(G (OR p0 p1))
Knowledge based reduction with 12 factoid took 339 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PhilosophersDyn-PT-10-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-PT-10-LTLCardinality-03 finished in 56507 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 30 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 117 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2023-03-14 20:27:20] [INFO ] Computed 39 place invariants in 42 ms
[2023-03-14 20:27:20] [INFO ] Dead Transitions using invariants and state equation in 633 ms found 0 transitions.
[2023-03-14 20:27:20] [INFO ] Invariant cache hit.
[2023-03-14 20:27:21] [INFO ] Implicit Places using invariants in 286 ms returned []
[2023-03-14 20:27:21] [INFO ] Invariant cache hit.
[2023-03-14 20:27:21] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:27:27] [INFO ] Implicit Places using invariants and state equation in 6425 ms returned []
Implicit Place search using SMT with State Equation took 6714 ms to find 0 implicit places.
[2023-03-14 20:27:27] [INFO ] Redundant transitions in 57 ms returned []
[2023-03-14 20:27:27] [INFO ] Invariant cache hit.
[2023-03-14 20:27:28] [INFO ] Dead Transitions using invariants and state equation in 583 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8115 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GT 1 (ADD s0 s19 s43 s63 s83 s107 s115 s152 s153 s155)) (GT 1 (ADD s4 s11 s21 s22 s41 s46 s58 s72 s86 s136))), p1:(GT (ADD s16 s81 s87 s106 s109 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-PT-10-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLCardinality-04 finished in 8254 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(p0)) U (p1||X(p1)))))'
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 7 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:27:28] [INFO ] Invariant cache hit.
[2023-03-14 20:27:28] [INFO ] Dead Transitions using invariants and state equation in 578 ms found 0 transitions.
[2023-03-14 20:27:28] [INFO ] Invariant cache hit.
[2023-03-14 20:27:29] [INFO ] Implicit Places using invariants in 349 ms returned []
[2023-03-14 20:27:29] [INFO ] Invariant cache hit.
[2023-03-14 20:27:29] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:27:35] [INFO ] Implicit Places using invariants and state equation in 6467 ms returned []
Implicit Place search using SMT with State Equation took 6817 ms to find 0 implicit places.
[2023-03-14 20:27:35] [INFO ] Invariant cache hit.
[2023-03-14 20:27:36] [INFO ] Dead Transitions using invariants and state equation in 575 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7979 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 3 (ADD s16 s81 s87 s106 s109 s125 s141 s144 s160 s161)), p0:(LEQ (ADD s16 s81 s87 s106 s109 s125 s141 s144 s160 s161) (ADD s2 s38 s59 s77 s94 s102...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-PT-10-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLCardinality-05 finished in 8126 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 13 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:27:36] [INFO ] Invariant cache hit.
[2023-03-14 20:27:36] [INFO ] Dead Transitions using invariants and state equation in 572 ms found 0 transitions.
[2023-03-14 20:27:36] [INFO ] Invariant cache hit.
[2023-03-14 20:27:37] [INFO ] Implicit Places using invariants in 295 ms returned []
[2023-03-14 20:27:37] [INFO ] Invariant cache hit.
[2023-03-14 20:27:37] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:27:44] [INFO ] Implicit Places using invariants and state equation in 6843 ms returned []
Implicit Place search using SMT with State Equation took 7152 ms to find 0 implicit places.
[2023-03-14 20:27:44] [INFO ] Invariant cache hit.
[2023-03-14 20:27:44] [INFO ] Dead Transitions using invariants and state equation in 579 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8318 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 (ADD s0 s19 s43 s63 s83 s107 s115 s152 s153 s155))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 11946 reset in 1066 ms.
Product exploration explored 100000 steps with 11960 reset in 1085 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 140 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1200 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 174834 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 174834 steps, saw 45531 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-14 20:27:50] [INFO ] Invariant cache hit.
[2023-03-14 20:27:50] [INFO ] [Real]Absence check using 12 positive place invariants in 1 ms returned sat
[2023-03-14 20:27:50] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 8 ms returned sat
[2023-03-14 20:27:50] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 20:27:50] [INFO ] [Nat]Absence check using 12 positive place invariants in 1 ms returned sat
[2023-03-14 20:27:50] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 10 ms returned sat
[2023-03-14 20:27:50] [INFO ] After 417ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 20:27:50] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:27:53] [INFO ] After 2337ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 20:27:53] [INFO ] After 2415ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-14 20:27:53] [INFO ] After 2958ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 1875
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 1875
Applied a total of 20 rules in 194 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2023-03-14 20:27:53] [INFO ] Computed 39 place invariants in 37 ms
[2023-03-14 20:27:54] [INFO ] Dead Transitions using invariants and state equation in 614 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 808 ms. Remains : 160/170 places, 1875/1885 transitions.
Incomplete random walk after 10000 steps, including 1191 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 185972 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :{}
Probabilistic random walk after 185972 steps, saw 45840 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-14 20:27:57] [INFO ] Invariant cache hit.
[2023-03-14 20:27:57] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-14 20:27:57] [INFO ] [Real]Absence check using 14 positive and 25 generalized place invariants in 8 ms returned sat
[2023-03-14 20:27:57] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 20:27:57] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-14 20:27:57] [INFO ] [Nat]Absence check using 14 positive and 25 generalized place invariants in 7 ms returned sat
[2023-03-14 20:27:57] [INFO ] After 409ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 20:27:57] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:28:02] [INFO ] After 4451ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 20:28:02] [INFO ] Deduced a trap composed of 63 places in 230 ms of which 0 ms to minimize.
[2023-03-14 20:28:02] [INFO ] Deduced a trap composed of 69 places in 219 ms of which 1 ms to minimize.
[2023-03-14 20:28:03] [INFO ] Deduced a trap composed of 74 places in 230 ms of which 0 ms to minimize.
[2023-03-14 20:28:03] [INFO ] Deduced a trap composed of 62 places in 239 ms of which 0 ms to minimize.
[2023-03-14 20:28:03] [INFO ] Deduced a trap composed of 70 places in 228 ms of which 0 ms to minimize.
[2023-03-14 20:28:04] [INFO ] Deduced a trap composed of 62 places in 238 ms of which 1 ms to minimize.
[2023-03-14 20:28:04] [INFO ] Deduced a trap composed of 74 places in 230 ms of which 1 ms to minimize.
[2023-03-14 20:28:04] [INFO ] Deduced a trap composed of 68 places in 225 ms of which 0 ms to minimize.
[2023-03-14 20:28:04] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2622 ms
[2023-03-14 20:28:04] [INFO ] After 7135ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-14 20:28:04] [INFO ] After 7653ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 10 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 96 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 160/160 places, 1875/1875 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 97 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2023-03-14 20:28:05] [INFO ] Invariant cache hit.
[2023-03-14 20:28:05] [INFO ] Implicit Places using invariants in 335 ms returned [2, 37, 56, 72, 89, 95, 105, 109, 137, 156]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 339 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 150/160 places, 1875/1875 transitions.
Free-agglomeration rule applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 150 transition count 1865
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 140 transition count 1865
Applied a total of 20 rules in 214 ms. Remains 140 /150 variables (removed 10) and now considering 1865/1875 (removed 10) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2023-03-14 20:28:05] [INFO ] Computed 29 place invariants in 27 ms
[2023-03-14 20:28:06] [INFO ] Implicit Places using invariants in 337 ms returned []
[2023-03-14 20:28:06] [INFO ] Invariant cache hit.
[2023-03-14 20:28:06] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:28:12] [INFO ] Implicit Places using invariants and state equation in 6052 ms returned []
Implicit Place search using SMT with State Equation took 6390 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 140/160 places, 1865/1875 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7042 ms. Remains : 140/160 places, 1865/1875 transitions.
Incomplete random walk after 10000 steps, including 1790 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 113 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Probably explored full state space saw : 14836 states, properties seen :0
Probabilistic random walk after 48551 steps, saw 14836 distinct states, run finished after 984 ms. (steps per millisecond=49 ) properties seen :0
Explored full state space saw : 14836 states, properties seen :0
Exhaustive walk after 48551 steps, saw 14836 distinct states, run finished after 979 ms. (steps per millisecond=49 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (G p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(G p0)
Knowledge based reduction with 5 factoid took 139 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PhilosophersDyn-PT-10-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-PT-10-LTLCardinality-06 finished in 38058 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 103 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2023-03-14 20:28:14] [INFO ] Computed 39 place invariants in 37 ms
[2023-03-14 20:28:15] [INFO ] Dead Transitions using invariants and state equation in 616 ms found 0 transitions.
[2023-03-14 20:28:15] [INFO ] Invariant cache hit.
[2023-03-14 20:28:15] [INFO ] Implicit Places using invariants in 348 ms returned []
[2023-03-14 20:28:15] [INFO ] Invariant cache hit.
[2023-03-14 20:28:15] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:28:22] [INFO ] Implicit Places using invariants and state equation in 7307 ms returned []
Implicit Place search using SMT with State Equation took 7656 ms to find 0 implicit places.
[2023-03-14 20:28:22] [INFO ] Redundant transitions in 56 ms returned []
[2023-03-14 20:28:22] [INFO ] Invariant cache hit.
[2023-03-14 20:28:23] [INFO ] Dead Transitions using invariants and state equation in 581 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9023 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s41)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-PT-10-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLCardinality-09 finished in 9070 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 99 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:28:23] [INFO ] Invariant cache hit.
[2023-03-14 20:28:24] [INFO ] Dead Transitions using invariants and state equation in 574 ms found 0 transitions.
[2023-03-14 20:28:24] [INFO ] Invariant cache hit.
[2023-03-14 20:28:24] [INFO ] Implicit Places using invariants in 347 ms returned []
[2023-03-14 20:28:24] [INFO ] Invariant cache hit.
[2023-03-14 20:28:24] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:28:31] [INFO ] Implicit Places using invariants and state equation in 7207 ms returned []
Implicit Place search using SMT with State Equation took 7554 ms to find 0 implicit places.
[2023-03-14 20:28:31] [INFO ] Redundant transitions in 58 ms returned []
[2023-03-14 20:28:31] [INFO ] Invariant cache hit.
[2023-03-14 20:28:32] [INFO ] Dead Transitions using invariants and state equation in 597 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8907 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s27 s108)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 534 steps with 63 reset in 11 ms.
FORMULA PhilosophersDyn-PT-10-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLCardinality-10 finished in 8974 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0) U (G(p1) U p2))))'
Support contains 4 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 103 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:28:32] [INFO ] Invariant cache hit.
[2023-03-14 20:28:33] [INFO ] Dead Transitions using invariants and state equation in 584 ms found 0 transitions.
[2023-03-14 20:28:33] [INFO ] Invariant cache hit.
[2023-03-14 20:28:33] [INFO ] Implicit Places using invariants in 340 ms returned []
[2023-03-14 20:28:33] [INFO ] Invariant cache hit.
[2023-03-14 20:28:33] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:28:40] [INFO ] Implicit Places using invariants and state equation in 7103 ms returned []
Implicit Place search using SMT with State Equation took 7444 ms to find 0 implicit places.
[2023-03-14 20:28:40] [INFO ] Redundant transitions in 61 ms returned []
[2023-03-14 20:28:40] [INFO ] Invariant cache hit.
[2023-03-14 20:28:41] [INFO ] Dead Transitions using invariants and state equation in 595 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8795 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p2), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(LEQ s65 s165), p1:(LEQ 1 s12), p0:(LEQ 1 s161)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 43 steps with 4 reset in 2 ms.
FORMULA PhilosophersDyn-PT-10-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLCardinality-11 finished in 8983 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0)||X(p1)))))'
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 106 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:28:41] [INFO ] Invariant cache hit.
[2023-03-14 20:28:42] [INFO ] Dead Transitions using invariants and state equation in 575 ms found 0 transitions.
[2023-03-14 20:28:42] [INFO ] Invariant cache hit.
[2023-03-14 20:28:42] [INFO ] Implicit Places using invariants in 341 ms returned []
[2023-03-14 20:28:42] [INFO ] Invariant cache hit.
[2023-03-14 20:28:42] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:28:49] [INFO ] Implicit Places using invariants and state equation in 7232 ms returned []
Implicit Place search using SMT with State Equation took 7574 ms to find 0 implicit places.
[2023-03-14 20:28:49] [INFO ] Redundant transitions in 58 ms returned []
[2023-03-14 20:28:49] [INFO ] Invariant cache hit.
[2023-03-14 20:28:50] [INFO ] Dead Transitions using invariants and state equation in 573 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8901 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 355 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 3 s13), p0:(LEQ s111 s136)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 96 steps with 12 reset in 1 ms.
FORMULA PhilosophersDyn-PT-10-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLCardinality-12 finished in 9278 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p0||X(F(p1))))||F(p2))))'
Support contains 4 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 8 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:28:50] [INFO ] Invariant cache hit.
[2023-03-14 20:28:51] [INFO ] Dead Transitions using invariants and state equation in 577 ms found 0 transitions.
[2023-03-14 20:28:51] [INFO ] Invariant cache hit.
[2023-03-14 20:28:51] [INFO ] Implicit Places using invariants in 329 ms returned []
[2023-03-14 20:28:51] [INFO ] Invariant cache hit.
[2023-03-14 20:28:51] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:28:58] [INFO ] Implicit Places using invariants and state equation in 7088 ms returned []
Implicit Place search using SMT with State Equation took 7418 ms to find 0 implicit places.
[2023-03-14 20:28:58] [INFO ] Invariant cache hit.
[2023-03-14 20:28:59] [INFO ] Dead Transitions using invariants and state equation in 582 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8587 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(LEQ s0 s157), p0:(GT 1 s146), p1:(LEQ 1 s30)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 52 steps with 14 reset in 1 ms.
FORMULA PhilosophersDyn-PT-10-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLCardinality-13 finished in 8766 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 7 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:28:59] [INFO ] Invariant cache hit.
[2023-03-14 20:29:00] [INFO ] Dead Transitions using invariants and state equation in 581 ms found 0 transitions.
[2023-03-14 20:29:00] [INFO ] Invariant cache hit.
[2023-03-14 20:29:00] [INFO ] Implicit Places using invariants in 343 ms returned []
[2023-03-14 20:29:00] [INFO ] Invariant cache hit.
[2023-03-14 20:29:00] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:29:07] [INFO ] Implicit Places using invariants and state equation in 7220 ms returned []
Implicit Place search using SMT with State Equation took 7565 ms to find 0 implicit places.
[2023-03-14 20:29:07] [INFO ] Invariant cache hit.
[2023-03-14 20:29:08] [INFO ] Dead Transitions using invariants and state equation in 588 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8743 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 2 s127)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 2469 ms.
Product exploration explored 100000 steps with 50000 reset in 2423 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PhilosophersDyn-PT-10-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-PT-10-LTLCardinality-14 finished in 13810 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(p0))))'
Support contains 1 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 7 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:29:13] [INFO ] Invariant cache hit.
[2023-03-14 20:29:13] [INFO ] Dead Transitions using invariants and state equation in 592 ms found 0 transitions.
[2023-03-14 20:29:13] [INFO ] Invariant cache hit.
[2023-03-14 20:29:14] [INFO ] Implicit Places using invariants in 348 ms returned []
[2023-03-14 20:29:14] [INFO ] Invariant cache hit.
[2023-03-14 20:29:14] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:29:21] [INFO ] Implicit Places using invariants and state equation in 7231 ms returned []
Implicit Place search using SMT with State Equation took 7581 ms to find 0 implicit places.
[2023-03-14 20:29:21] [INFO ] Invariant cache hit.
[2023-03-14 20:29:22] [INFO ] Dead Transitions using invariants and state equation in 579 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8761 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 228 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(LEQ 2 s146)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-PT-10-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLCardinality-15 finished in 9005 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(p1))))'
[2023-03-14 20:29:22] [INFO ] Flatten gal took : 94 ms
[2023-03-14 20:29:22] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-14 20:29:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 170 places, 1885 transitions and 14300 arcs took 17 ms.
Total runtime 454083 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT PhilosophersDyn-PT-10
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/382
LTLCardinality

FORMULA PhilosophersDyn-PT-10-LTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-10-LTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678825803111

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/382/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/382/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/382/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:550
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 10 (type SKEL/SRCH) for 3 PhilosophersDyn-PT-10-LTLCardinality-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 10 (type SKEL/SRCH) for PhilosophersDyn-PT-10-LTLCardinality-02
lola: result : false
lola: markings : 163
lola: fired transitions : 308
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 6 (type EXCL) for 3 PhilosophersDyn-PT-10-LTLCardinality-02
lola: time limit : 1199 sec
lola: memory limit: 32 pages
lola: FINISHED task # 6 (type EXCL) for PhilosophersDyn-PT-10-LTLCardinality-02
lola: result : true
lola: markings : 46
lola: fired transitions : 45
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 PhilosophersDyn-PT-10-LTLCardinality-01
lola: time limit : 1799 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
PhilosophersDyn-PT-10-LTLCardinality-02: CONJ 0 1 0 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 4/1799 1/32 PhilosophersDyn-PT-10-LTLCardinality-01 32783 m, 6556 m/sec, 91618 t fired, .

Time elapsed: 5 secs. Pages in use: 1
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
PhilosophersDyn-PT-10-LTLCardinality-02: CONJ 0 1 0 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 9/1799 1/32 PhilosophersDyn-PT-10-LTLCardinality-01 64437 m, 6330 m/sec, 182900 t fired, .

Time elapsed: 10 secs. Pages in use: 1
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
PhilosophersDyn-PT-10-LTLCardinality-02: CONJ 0 1 0 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 14/1799 1/32 PhilosophersDyn-PT-10-LTLCardinality-01 96901 m, 6492 m/sec, 281259 t fired, .

Time elapsed: 15 secs. Pages in use: 1
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
PhilosophersDyn-PT-10-LTLCardinality-02: CONJ 0 1 0 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 19/1799 2/32 PhilosophersDyn-PT-10-LTLCardinality-01 132625 m, 7144 m/sec, 391297 t fired, .

Time elapsed: 20 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
PhilosophersDyn-PT-10-LTLCardinality-02: CONJ 0 1 0 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 24/1799 2/32 PhilosophersDyn-PT-10-LTLCardinality-01 164684 m, 6411 m/sec, 488991 t fired, .

Time elapsed: 25 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 2
lola: FINISHED task # 1 (type EXCL) for PhilosophersDyn-PT-10-LTLCardinality-01
lola: result : true
lola: markings : 196542
lola: fired transitions : 587574
lola: time used : 29.000000
lola: memory pages used : 2
lola: LAUNCH task # 8 (type EXCL) for 3 PhilosophersDyn-PT-10-LTLCardinality-02
lola: time limit : 3570 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-PT-10-LTLCardinality-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-PT-10-LTLCardinality-02: CONJ 0 0 1 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 0/3570 1/32 PhilosophersDyn-PT-10-LTLCardinality-02 61345 m, 12269 m/sec, 185543 t fired, .

Time elapsed: 30 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 2
lola: FINISHED task # 8 (type EXCL) for PhilosophersDyn-PT-10-LTLCardinality-02
lola: result : true
lola: markings : 199051
lola: fired transitions : 631330
lola: time used : 2.000000
lola: memory pages used : 2
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-PT-10-LTLCardinality-01: LTL true LTL model checker
PhilosophersDyn-PT-10-LTLCardinality-02: CONJ true CONJ


Time elapsed: 32 secs. Pages in use: 2

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="PhilosophersDyn-PT-10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is PhilosophersDyn-PT-10, 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 r295-tall-167873947700323"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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