About the Execution of ITS-Tools for Echo-PT-d02r11
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 14028.392 | 3600000.00 | 6989494.00 | 29378.10 | F?TTFTTF??FFFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r078-tall-165260110200379.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Echo-PT-d02r11, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110200379
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 7.4K Apr 29 11:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 29 11:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 29 11:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 29 11:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 469K May 10 09:33 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 Echo-PT-d02r11-LTLCardinality-00
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-01
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-02
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-03
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-04
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-05
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-06
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-07
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-08
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-09
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-10
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-11
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-12
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-13
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-14
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1652667148079
Running Version 202205111006
[2022-05-16 02:12:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 02:12:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 02:12:30] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2022-05-16 02:12:30] [INFO ] Transformed 1119 places.
[2022-05-16 02:12:30] [INFO ] Transformed 874 transitions.
[2022-05-16 02:12:30] [INFO ] Found NUPN structural information;
[2022-05-16 02:12:30] [INFO ] Parsed PT model containing 1119 places and 874 transitions in 263 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Echo-PT-d02r11-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r11-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r11-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r11-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r11-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r11-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r11-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r11-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 1119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1119/1119 places, 874/874 transitions.
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 0 with 118 rules applied. Total rules applied 118 place count 1001 transition count 874
Applied a total of 118 rules in 98 ms. Remains 1001 /1119 variables (removed 118) and now considering 874/874 (removed 0) transitions.
// Phase 1: matrix 874 rows 1001 cols
[2022-05-16 02:12:30] [INFO ] Computed 443 place invariants in 417 ms
[2022-05-16 02:12:34] [INFO ] Implicit Places using invariants in 4071 ms returned []
// Phase 1: matrix 874 rows 1001 cols
[2022-05-16 02:12:34] [INFO ] Computed 443 place invariants in 330 ms
[2022-05-16 02:15:14] [INFO ] Performed 420/1001 implicitness test of which 0 returned IMPLICIT in 158 seconds.
[2022-05-16 02:15:14] [INFO ] Timeout of Implicit test with SMT after 158 seconds.
[2022-05-16 02:15:15] [INFO ] Implicit Places using invariants and state equation in 160351 ms returned []
Implicit Place search using SMT with State Equation took 164450 ms to find 0 implicit places.
// Phase 1: matrix 874 rows 1001 cols
[2022-05-16 02:15:15] [INFO ] Computed 443 place invariants in 352 ms
[2022-05-16 02:15:17] [INFO ] Dead Transitions using invariants and state equation in 2283 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1001/1119 places, 874/874 transitions.
Finished structural reductions, in 1 iterations. Remains : 1001/1119 places, 874/874 transitions.
Support contains 29 out of 1001 places after structural reductions.
[2022-05-16 02:15:17] [INFO ] Flatten gal took : 137 ms
[2022-05-16 02:15:17] [INFO ] Flatten gal took : 88 ms
[2022-05-16 02:15:17] [INFO ] Input system was already deterministic with 874 transitions.
Finished random walk after 8357 steps, including 34 resets, run visited all 18 properties in 237 ms. (steps per millisecond=35 )
Computed a total of 1001 stabilizing places and 874 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1001 transition count 874
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0) U (X(X(!X(F(G(p0)))))||p1))))'
Support contains 4 out of 1001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1001/1001 places, 874/874 transitions.
Graph (complete) has 2957 edges and 1001 vertex of which 995 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.12 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 85 ms. Remains 994 /1001 variables (removed 7) and now considering 872/874 (removed 2) transitions.
// Phase 1: matrix 872 rows 994 cols
[2022-05-16 02:15:18] [INFO ] Computed 438 place invariants in 392 ms
[2022-05-16 02:15:22] [INFO ] Implicit Places using invariants in 4143 ms returned [380, 417, 420, 457]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 4156 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 990/1001 places, 872/874 transitions.
Applied a total of 0 rules in 48 ms. Remains 990 /990 variables (removed 0) and now considering 872/872 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 990/1001 places, 872/874 transitions.
Stuttering acceptance computed with spot in 188 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : Echo-PT-d02r11-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s971 0) (EQ s283 1)), p1:(OR (EQ s541 0) (EQ s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 534 reset in 1079 ms.
Product exploration explored 100000 steps with 530 reset in 1011 ms.
Computed a total of 990 stabilizing places and 872 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 990 transition count 872
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 268 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 72 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 518 steps, including 2 resets, run visited all 1 properties in 9 ms. (steps per millisecond=57 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 197 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 68 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 990 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 990/990 places, 872/872 transitions.
Applied a total of 0 rules in 41 ms. Remains 990 /990 variables (removed 0) and now considering 872/872 (removed 0) transitions.
// Phase 1: matrix 872 rows 990 cols
[2022-05-16 02:15:26] [INFO ] Computed 434 place invariants in 293 ms
[2022-05-16 02:15:29] [INFO ] Implicit Places using invariants in 3329 ms returned []
// Phase 1: matrix 872 rows 990 cols
[2022-05-16 02:15:29] [INFO ] Computed 434 place invariants in 297 ms
[2022-05-16 02:15:40] [INFO ] Implicit Places using invariants and state equation in 11585 ms returned []
Implicit Place search using SMT with State Equation took 14930 ms to find 0 implicit places.
[2022-05-16 02:15:41] [INFO ] Redundant transitions in 57 ms returned []
// Phase 1: matrix 872 rows 990 cols
[2022-05-16 02:15:41] [INFO ] Computed 434 place invariants in 328 ms
[2022-05-16 02:15:42] [INFO ] Dead Transitions using invariants and state equation in 1938 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 990/990 places, 872/872 transitions.
Computed a total of 990 stabilizing places and 872 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 990 transition count 872
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 215 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 61 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 80 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=40 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 179 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 58 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 54 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 61 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 531 reset in 872 ms.
Product exploration explored 100000 steps with 508 reset in 984 ms.
Built C files in :
/tmp/ltsmin7857165198128214337
[2022-05-16 02:15:45] [INFO ] Computing symmetric may disable matrix : 872 transitions.
[2022-05-16 02:15:45] [INFO ] Computation of Complete disable matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:15:45] [INFO ] Computing symmetric may enable matrix : 872 transitions.
[2022-05-16 02:15:45] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:15:46] [INFO ] Computing Do-Not-Accords matrix : 872 transitions.
[2022-05-16 02:15:46] [INFO ] Computation of Completed DNA matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:15:46] [INFO ] Built C files in 223ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7857165198128214337
Running compilation step : cd /tmp/ltsmin7857165198128214337;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2660 ms.
Running link step : cd /tmp/ltsmin7857165198128214337;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 251 ms.
Running LTSmin : cd /tmp/ltsmin7857165198128214337;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11012740651252621915.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 990 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 990/990 places, 872/872 transitions.
Applied a total of 0 rules in 45 ms. Remains 990 /990 variables (removed 0) and now considering 872/872 (removed 0) transitions.
// Phase 1: matrix 872 rows 990 cols
[2022-05-16 02:16:01] [INFO ] Computed 434 place invariants in 328 ms
[2022-05-16 02:16:04] [INFO ] Implicit Places using invariants in 3245 ms returned []
// Phase 1: matrix 872 rows 990 cols
[2022-05-16 02:16:04] [INFO ] Computed 434 place invariants in 310 ms
[2022-05-16 02:16:16] [INFO ] Implicit Places using invariants and state equation in 11896 ms returned []
Implicit Place search using SMT with State Equation took 15147 ms to find 0 implicit places.
[2022-05-16 02:16:16] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 872 rows 990 cols
[2022-05-16 02:16:16] [INFO ] Computed 434 place invariants in 307 ms
[2022-05-16 02:16:18] [INFO ] Dead Transitions using invariants and state equation in 1886 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 990/990 places, 872/872 transitions.
Built C files in :
/tmp/ltsmin3088919002161291501
[2022-05-16 02:16:18] [INFO ] Computing symmetric may disable matrix : 872 transitions.
[2022-05-16 02:16:18] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:16:18] [INFO ] Computing symmetric may enable matrix : 872 transitions.
[2022-05-16 02:16:18] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:16:18] [INFO ] Computing Do-Not-Accords matrix : 872 transitions.
[2022-05-16 02:16:18] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:16:18] [INFO ] Built C files in 102ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3088919002161291501
Running compilation step : cd /tmp/ltsmin3088919002161291501;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2535 ms.
Running link step : cd /tmp/ltsmin3088919002161291501;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin3088919002161291501;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15431765443532962533.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 02:16:33] [INFO ] Flatten gal took : 57 ms
[2022-05-16 02:16:33] [INFO ] Flatten gal took : 84 ms
[2022-05-16 02:16:33] [INFO ] Time to serialize gal into /tmp/LTL4830595803725476215.gal : 10 ms
[2022-05-16 02:16:33] [INFO ] Time to serialize properties into /tmp/LTL8573904047008979645.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4830595803725476215.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8573904047008979645.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4830595...266
Read 1 LTL properties
Checking formula 0 : !((G((F("((p98==0)||(p284==1))"))U(((X(X(!(X(F(G("((p98==0)||(p284==1))")))))))||("(p550==0)"))||("(p10==1)")))))
Formula 0 simplified : !G(F"((p98==0)||(p284==1))" U ("(p10==1)" | "(p550==0)" | XX!XFG"((p98==0)||(p284==1))"))
Detected timeout of ITS tools.
[2022-05-16 02:16:49] [INFO ] Flatten gal took : 54 ms
[2022-05-16 02:16:49] [INFO ] Applying decomposition
[2022-05-16 02:16:49] [INFO ] Flatten gal took : 53 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14079216827659861064.txt' '-o' '/tmp/graph14079216827659861064.bin' '-w' '/tmp/graph14079216827659861064.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14079216827659861064.bin' '-l' '-1' '-v' '-w' '/tmp/graph14079216827659861064.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:16:49] [INFO ] Decomposing Gal with order
[2022-05-16 02:16:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:16:49] [INFO ] Removed a total of 1037 redundant transitions.
[2022-05-16 02:16:49] [INFO ] Flatten gal took : 160 ms
[2022-05-16 02:16:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 68 labels/synchronizations in 55 ms.
[2022-05-16 02:16:49] [INFO ] Time to serialize gal into /tmp/LTL6050011692325140083.gal : 19 ms
[2022-05-16 02:16:49] [INFO ] Time to serialize properties into /tmp/LTL16810439301430281783.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6050011692325140083.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16810439301430281783.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6050011...246
Read 1 LTL properties
Checking formula 0 : !((G((F("((i10.i1.u32.p98==0)||(i0.i0.u10.p284==1))"))U(((X(X(!(X(F(G("((i10.i1.u32.p98==0)||(i0.i0.u10.p284==1))")))))))||("(i4.i2.u4...195
Formula 0 simplified : !G(F"((i10.i1.u32.p98==0)||(i0.i0.u10.p284==1))" U ("(i4.i2.u0.p10==1)" | "(i4.i2.u40.p550==0)" | XX!XFG"((i10.i1.u32.p98==0)||(i0.i...173
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4224809430719395841
[2022-05-16 02:17:04] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4224809430719395841
Running compilation step : cd /tmp/ltsmin4224809430719395841;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2073 ms.
Running link step : cd /tmp/ltsmin4224809430719395841;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin4224809430719395841;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true)) U (X(X(!X(<>([]((LTLAPp0==true))))))||(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Echo-PT-d02r11-LTLCardinality-01 finished in 121487 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!X(X(p0)) U (F(p2)||p1))))'
Support contains 4 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 874/874 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 998 transition count 874
Applied a total of 3 rules in 22 ms. Remains 998 /1001 variables (removed 3) and now considering 874/874 (removed 0) transitions.
// Phase 1: matrix 874 rows 998 cols
[2022-05-16 02:17:20] [INFO ] Computed 440 place invariants in 207 ms
[2022-05-16 02:17:23] [INFO ] Implicit Places using invariants in 3681 ms returned []
// Phase 1: matrix 874 rows 998 cols
[2022-05-16 02:17:23] [INFO ] Computed 440 place invariants in 212 ms
[2022-05-16 02:17:34] [INFO ] Implicit Places using invariants and state equation in 10922 ms returned []
Implicit Place search using SMT with State Equation took 14612 ms to find 0 implicit places.
// Phase 1: matrix 874 rows 998 cols
[2022-05-16 02:17:34] [INFO ] Computed 440 place invariants in 212 ms
[2022-05-16 02:17:36] [INFO ] Dead Transitions using invariants and state equation in 1922 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 998/1001 places, 874/874 transitions.
Finished structural reductions, in 1 iterations. Remains : 998/1001 places, 874/874 transitions.
Stuttering acceptance computed with spot in 241 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) p0), (AND (NOT p2) p0), (NOT p2)]
Running random walk in product with property : Echo-PT-d02r11-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s216 0) (EQ s430 1)), p2:(OR (EQ s106 0) (EQ s869 1)), p0:(OR (EQ s216 0) (EQ s430 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 721 ms.
Product exploration explored 100000 steps with 50000 reset in 762 ms.
Computed a total of 998 stabilizing places and 874 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 998 transition count 874
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p2))))
Knowledge based reduction with 7 factoid took 538 ms. Reduced automaton from 5 states, 6 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA Echo-PT-d02r11-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d02r11-LTLCardinality-02 finished in 19179 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(!(X(!G(X(X(p1))))||p0) U p2)))'
Support contains 4 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 874/874 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 998 transition count 874
Applied a total of 3 rules in 20 ms. Remains 998 /1001 variables (removed 3) and now considering 874/874 (removed 0) transitions.
// Phase 1: matrix 874 rows 998 cols
[2022-05-16 02:17:39] [INFO ] Computed 440 place invariants in 209 ms
[2022-05-16 02:17:43] [INFO ] Implicit Places using invariants in 4150 ms returned []
// Phase 1: matrix 874 rows 998 cols
[2022-05-16 02:17:43] [INFO ] Computed 440 place invariants in 218 ms
[2022-05-16 02:17:56] [INFO ] Implicit Places using invariants and state equation in 13289 ms returned []
Implicit Place search using SMT with State Equation took 17442 ms to find 0 implicit places.
// Phase 1: matrix 874 rows 998 cols
[2022-05-16 02:17:56] [INFO ] Computed 440 place invariants in 206 ms
[2022-05-16 02:17:58] [INFO ] Dead Transitions using invariants and state equation in 1846 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 998/1001 places, 874/874 transitions.
Finished structural reductions, in 1 iterations. Remains : 998/1001 places, 874/874 transitions.
Stuttering acceptance computed with spot in 303 ms :[p1, p2, (AND p1 p2), (AND p1 p2), p1, true, p2, (AND p1 p2)]
Running random walk in product with property : Echo-PT-d02r11-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=p2, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND p2 p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p2, acceptance={} source=6 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 2}, { cond=p2, acceptance={} source=7 dest: 4}]], initial=1, aps=[p1:(OR (EQ s543 0) (EQ s594 1)), p2:(OR (EQ s550 0) (EQ s89 1)), p0:(OR (EQ s550 0) (EQ s89 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Echo-PT-d02r11-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r11-LTLCardinality-04 finished in 19644 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 874/874 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 998 transition count 874
Applied a total of 3 rules in 20 ms. Remains 998 /1001 variables (removed 3) and now considering 874/874 (removed 0) transitions.
// Phase 1: matrix 874 rows 998 cols
[2022-05-16 02:17:58] [INFO ] Computed 440 place invariants in 205 ms
[2022-05-16 02:18:02] [INFO ] Implicit Places using invariants in 3822 ms returned []
// Phase 1: matrix 874 rows 998 cols
[2022-05-16 02:18:02] [INFO ] Computed 440 place invariants in 212 ms
[2022-05-16 02:19:47] [INFO ] Performed 656/998 implicitness test of which 0 returned IMPLICIT in 104 seconds.
[2022-05-16 02:19:48] [INFO ] Implicit Places using invariants and state equation in 105762 ms returned []
Implicit Place search using SMT with State Equation took 109587 ms to find 0 implicit places.
// Phase 1: matrix 874 rows 998 cols
[2022-05-16 02:19:48] [INFO ] Computed 440 place invariants in 219 ms
[2022-05-16 02:19:50] [INFO ] Dead Transitions using invariants and state equation in 1859 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 998/1001 places, 874/874 transitions.
Finished structural reductions, in 1 iterations. Remains : 998/1001 places, 874/874 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d02r11-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s93 0) (EQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 598 ms.
Product exploration explored 100000 steps with 33333 reset in 646 ms.
Computed a total of 998 stabilizing places and 874 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 998 transition count 874
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Echo-PT-d02r11-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d02r11-LTLCardinality-06 finished in 113214 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((G(X(p0)) U p1)||(X(p2)&&p0)))))'
Support contains 5 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 874/874 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 999 transition count 874
Applied a total of 2 rules in 18 ms. Remains 999 /1001 variables (removed 2) and now considering 874/874 (removed 0) transitions.
// Phase 1: matrix 874 rows 999 cols
[2022-05-16 02:19:52] [INFO ] Computed 441 place invariants in 285 ms
[2022-05-16 02:19:55] [INFO ] Implicit Places using invariants in 3874 ms returned []
// Phase 1: matrix 874 rows 999 cols
[2022-05-16 02:19:56] [INFO ] Computed 441 place invariants in 291 ms
[2022-05-16 02:22:36] [INFO ] Performed 166/999 implicitness test of which 0 returned IMPLICIT in 158 seconds.
[2022-05-16 02:22:36] [INFO ] Timeout of Implicit test with SMT after 158 seconds.
[2022-05-16 02:22:36] [INFO ] Implicit Places using invariants and state equation in 160321 ms returned []
Implicit Place search using SMT with State Equation took 164199 ms to find 0 implicit places.
// Phase 1: matrix 874 rows 999 cols
[2022-05-16 02:22:36] [INFO ] Computed 441 place invariants in 302 ms
[2022-05-16 02:22:38] [INFO ] Dead Transitions using invariants and state equation in 2112 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 999/1001 places, 874/874 transitions.
Finished structural reductions, in 1 iterations. Remains : 999/1001 places, 874/874 transitions.
Stuttering acceptance computed with spot in 274 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : Echo-PT-d02r11-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={1} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={1} source=2 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={1} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={1} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s149 0) (EQ s66 1)), p0:(EQ s65 1), p2:(OR (EQ s211 0) (EQ s799 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 414 reset in 822 ms.
Product exploration explored 100000 steps with 415 reset in 904 ms.
Computed a total of 999 stabilizing places and 874 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 999 transition count 874
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) (NOT p2)))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 21 factoid took 1281 ms. Reduced automaton from 5 states, 21 edges and 3 AP to 5 states, 23 edges and 3 AP.
Stuttering acceptance computed with spot in 197 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2))]
Finished random walk after 2992 steps, including 12 resets, run visited all 10 properties in 79 ms. (steps per millisecond=37 )
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) (NOT p2)))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (AND (NOT p1) p2 p0)), (F (AND p1 (NOT p2) (NOT p0))), (F (NOT (AND p1 p0))), (F (NOT (OR p1 p0))), (F (AND (NOT p1) (NOT p2) p0)), (F (AND (NOT p1) (NOT p0))), (F (AND p1 (NOT p2) p0)), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (NOT (OR (AND p1 p0) (AND p2 p0))))]
Knowledge based reduction with 21 factoid took 1686 ms. Reduced automaton from 5 states, 23 edges and 3 AP to 5 states, 23 edges and 3 AP.
Stuttering acceptance computed with spot in 207 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 225 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 5 out of 999 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 999/999 places, 874/874 transitions.
Graph (complete) has 2941 edges and 999 vertex of which 994 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.7 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 39 ms. Remains 993 /999 variables (removed 6) and now considering 872/874 (removed 2) transitions.
// Phase 1: matrix 872 rows 993 cols
[2022-05-16 02:22:44] [INFO ] Computed 437 place invariants in 338 ms
[2022-05-16 02:22:48] [INFO ] Implicit Places using invariants in 3820 ms returned [379, 416, 419, 456]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 3825 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 989/999 places, 872/874 transitions.
Applied a total of 0 rules in 32 ms. Remains 989 /989 variables (removed 0) and now considering 872/872 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 989/999 places, 872/874 transitions.
Computed a total of 989 stabilizing places and 872 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 989 transition count 872
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (OR (AND p1 p0) (AND p2 p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 1197 ms. Reduced automaton from 5 states, 23 edges and 3 AP to 5 states, 23 edges and 3 AP.
Stuttering acceptance computed with spot in 187 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 41 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 10) seen :8
Finished Best-First random walk after 7235 steps, including 2 resets, run visited all 2 properties in 38 ms. (steps per millisecond=190 )
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (OR (AND p1 p0) (AND p2 p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (AND (NOT p1) p2 p0)), (F (AND p1 (NOT p2) (NOT p0))), (F (NOT (AND p1 p0))), (F (NOT (OR p1 p0))), (F (AND (NOT p1) (NOT p2) p0)), (F (AND (NOT p1) (NOT p0))), (F (AND p1 (NOT p2) p0)), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (NOT (OR (AND p1 p0) (AND p2 p0))))]
Knowledge based reduction with 23 factoid took 1338 ms. Reduced automaton from 5 states, 23 edges and 3 AP to 5 states, 23 edges and 3 AP.
Stuttering acceptance computed with spot in 195 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 212 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 687 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 421 reset in 869 ms.
Product exploration explored 100000 steps with 419 reset in 934 ms.
Built C files in :
/tmp/ltsmin2364962579717802573
[2022-05-16 02:22:54] [INFO ] Computing symmetric may disable matrix : 872 transitions.
[2022-05-16 02:22:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:22:54] [INFO ] Computing symmetric may enable matrix : 872 transitions.
[2022-05-16 02:22:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:22:54] [INFO ] Computing Do-Not-Accords matrix : 872 transitions.
[2022-05-16 02:22:54] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:22:54] [INFO ] Built C files in 90ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2364962579717802573
Running compilation step : cd /tmp/ltsmin2364962579717802573;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2649 ms.
Running link step : cd /tmp/ltsmin2364962579717802573;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin2364962579717802573;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14969364123449523796.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 989 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 989/989 places, 872/872 transitions.
Applied a total of 0 rules in 36 ms. Remains 989 /989 variables (removed 0) and now considering 872/872 (removed 0) transitions.
// Phase 1: matrix 872 rows 989 cols
[2022-05-16 02:23:09] [INFO ] Computed 433 place invariants in 252 ms
[2022-05-16 02:23:13] [INFO ] Implicit Places using invariants in 3617 ms returned []
// Phase 1: matrix 872 rows 989 cols
[2022-05-16 02:23:13] [INFO ] Computed 433 place invariants in 255 ms
[2022-05-16 02:25:53] [INFO ] Performed 24/989 implicitness test of which 0 returned IMPLICIT in 158 seconds.
[2022-05-16 02:25:53] [INFO ] Timeout of Implicit test with SMT after 158 seconds.
[2022-05-16 02:25:53] [INFO ] Implicit Places using invariants and state equation in 160284 ms returned []
Implicit Place search using SMT with State Equation took 163906 ms to find 0 implicit places.
[2022-05-16 02:25:53] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 872 rows 989 cols
[2022-05-16 02:25:53] [INFO ] Computed 433 place invariants in 281 ms
[2022-05-16 02:25:55] [INFO ] Dead Transitions using invariants and state equation in 2209 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 989/989 places, 872/872 transitions.
Built C files in :
/tmp/ltsmin14915428394590373607
[2022-05-16 02:25:55] [INFO ] Computing symmetric may disable matrix : 872 transitions.
[2022-05-16 02:25:55] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:25:55] [INFO ] Computing symmetric may enable matrix : 872 transitions.
[2022-05-16 02:25:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:25:55] [INFO ] Computing Do-Not-Accords matrix : 872 transitions.
[2022-05-16 02:25:55] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:25:55] [INFO ] Built C files in 84ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14915428394590373607
Running compilation step : cd /tmp/ltsmin14915428394590373607;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2560 ms.
Running link step : cd /tmp/ltsmin14915428394590373607;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin14915428394590373607;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10868149903220339440.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 02:26:10] [INFO ] Flatten gal took : 50 ms
[2022-05-16 02:26:10] [INFO ] Flatten gal took : 48 ms
[2022-05-16 02:26:10] [INFO ] Time to serialize gal into /tmp/LTL3432977233605065719.gal : 7 ms
[2022-05-16 02:26:10] [INFO ] Time to serialize properties into /tmp/LTL2606808815278734948.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3432977233605065719.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2606808815278734948.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3432977...266
Read 1 LTL properties
Checking formula 0 : !((F(G(((G(X("(p1064==1)")))U("((p150==0)||(p1065==1))"))||((X("((p212==0)||(p8==1))"))&&("(p1064==1)"))))))
Formula 0 simplified : !FG((GX"(p1064==1)" U "((p150==0)||(p1065==1))") | ("(p1064==1)" & X"((p212==0)||(p8==1))"))
Detected timeout of ITS tools.
[2022-05-16 02:26:25] [INFO ] Flatten gal took : 74 ms
[2022-05-16 02:26:25] [INFO ] Applying decomposition
[2022-05-16 02:26:26] [INFO ] Flatten gal took : 73 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph18430997951304521799.txt' '-o' '/tmp/graph18430997951304521799.bin' '-w' '/tmp/graph18430997951304521799.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18430997951304521799.bin' '-l' '-1' '-v' '-w' '/tmp/graph18430997951304521799.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:26:26] [INFO ] Decomposing Gal with order
[2022-05-16 02:26:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:26:26] [INFO ] Removed a total of 982 redundant transitions.
[2022-05-16 02:26:26] [INFO ] Flatten gal took : 122 ms
[2022-05-16 02:26:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 114 labels/synchronizations in 25 ms.
[2022-05-16 02:26:26] [INFO ] Time to serialize gal into /tmp/LTL13207565618789186286.gal : 9 ms
[2022-05-16 02:26:26] [INFO ] Time to serialize properties into /tmp/LTL17737778726240292490.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13207565618789186286.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17737778726240292490.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1320756...247
Read 1 LTL properties
Checking formula 0 : !((F(G(((G(X("(i5.u85.p1064==1)")))U("((i1.u36.p150==0)||(i5.u97.p1065==1))"))||((X("((i4.i0.u67.p212==0)||(i1.u1.p8==1))"))&&("(i5.u8...173
Formula 0 simplified : !FG((GX"(i5.u85.p1064==1)" U "((i1.u36.p150==0)||(i5.u97.p1065==1))") | ("(i5.u85.p1064==1)" & X"((i4.i0.u67.p212==0)||(i1.u1.p8==1)...159
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15346010724659467242
[2022-05-16 02:26:41] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15346010724659467242
Running compilation step : cd /tmp/ltsmin15346010724659467242;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1623 ms.
Running link step : cd /tmp/ltsmin15346010724659467242;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin15346010724659467242;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((([](X((LTLAPp0==true))) U (LTLAPp1==true))||(X((LTLAPp2==true))&&(LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Echo-PT-d02r11-LTLCardinality-08 finished in 424771 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(X((p0 U X(p1)))))))'
Support contains 4 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 874/874 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 998 transition count 874
Applied a total of 3 rules in 22 ms. Remains 998 /1001 variables (removed 3) and now considering 874/874 (removed 0) transitions.
// Phase 1: matrix 874 rows 998 cols
[2022-05-16 02:26:56] [INFO ] Computed 440 place invariants in 191 ms
[2022-05-16 02:27:00] [INFO ] Implicit Places using invariants in 3730 ms returned []
// Phase 1: matrix 874 rows 998 cols
[2022-05-16 02:27:00] [INFO ] Computed 440 place invariants in 203 ms
[2022-05-16 02:29:40] [INFO ] Performed 197/998 implicitness test of which 0 returned IMPLICIT in 159 seconds.
[2022-05-16 02:29:40] [INFO ] Timeout of Implicit test with SMT after 159 seconds.
[2022-05-16 02:29:40] [INFO ] Implicit Places using invariants and state equation in 160239 ms returned []
Implicit Place search using SMT with State Equation took 163986 ms to find 0 implicit places.
// Phase 1: matrix 874 rows 998 cols
[2022-05-16 02:29:40] [INFO ] Computed 440 place invariants in 192 ms
[2022-05-16 02:29:42] [INFO ] Dead Transitions using invariants and state equation in 1810 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 998/1001 places, 874/874 transitions.
Finished structural reductions, in 1 iterations. Remains : 998/1001 places, 874/874 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : Echo-PT-d02r11-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s649 0) (EQ s901 1)), p1:(OR (EQ s990 0) (EQ s502 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33387 reset in 607 ms.
Product exploration explored 100000 steps with 33275 reset in 691 ms.
Computed a total of 998 stabilizing places and 874 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 998 transition count 874
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 389 ms. Reduced automaton from 3 states, 8 edges and 2 AP to 3 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 1099 steps, including 4 resets, run visited all 5 properties in 17 ms. (steps per millisecond=64 )
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 11 factoid took 669 ms. Reduced automaton from 3 states, 9 edges and 2 AP to 3 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 4 out of 998 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 998/998 places, 874/874 transitions.
Graph (complete) has 2933 edges and 998 vertex of which 993 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 29 ms. Remains 992 /998 variables (removed 6) and now considering 872/874 (removed 2) transitions.
// Phase 1: matrix 872 rows 992 cols
[2022-05-16 02:29:45] [INFO ] Computed 436 place invariants in 256 ms
[2022-05-16 02:29:49] [INFO ] Implicit Places using invariants in 3851 ms returned [379, 416, 419, 456]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 3860 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 988/998 places, 872/874 transitions.
Applied a total of 0 rules in 24 ms. Remains 988 /988 variables (removed 0) and now considering 872/872 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 988/998 places, 872/874 transitions.
Computed a total of 988 stabilizing places and 872 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 988 transition count 872
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (OR p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 431 ms. Reduced automaton from 3 states, 9 edges and 2 AP to 3 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 4933 steps, including 20 resets, run visited all 5 properties in 70 ms. (steps per millisecond=70 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (OR p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 13 factoid took 478 ms. Reduced automaton from 3 states, 9 edges and 2 AP to 3 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 33077 reset in 661 ms.
Product exploration explored 100000 steps with 33270 reset in 707 ms.
Built C files in :
/tmp/ltsmin221761157935810144
[2022-05-16 02:29:52] [INFO ] Computing symmetric may disable matrix : 872 transitions.
[2022-05-16 02:29:52] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:29:52] [INFO ] Computing symmetric may enable matrix : 872 transitions.
[2022-05-16 02:29:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:29:52] [INFO ] Computing Do-Not-Accords matrix : 872 transitions.
[2022-05-16 02:29:52] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:29:52] [INFO ] Built C files in 84ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin221761157935810144
Running compilation step : cd /tmp/ltsmin221761157935810144;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2582 ms.
Running link step : cd /tmp/ltsmin221761157935810144;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin221761157935810144;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15849095037490451455.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 988 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 988/988 places, 872/872 transitions.
Applied a total of 0 rules in 22 ms. Remains 988 /988 variables (removed 0) and now considering 872/872 (removed 0) transitions.
// Phase 1: matrix 872 rows 988 cols
[2022-05-16 02:30:08] [INFO ] Computed 432 place invariants in 255 ms
[2022-05-16 02:30:11] [INFO ] Implicit Places using invariants in 3760 ms returned []
// Phase 1: matrix 872 rows 988 cols
[2022-05-16 02:30:11] [INFO ] Computed 432 place invariants in 232 ms
[2022-05-16 02:32:51] [INFO ] Performed 165/988 implicitness test of which 0 returned IMPLICIT in 158 seconds.
[2022-05-16 02:32:51] [INFO ] Timeout of Implicit test with SMT after 158 seconds.
[2022-05-16 02:32:51] [INFO ] Implicit Places using invariants and state equation in 160258 ms returned []
Implicit Place search using SMT with State Equation took 164048 ms to find 0 implicit places.
[2022-05-16 02:32:51] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 872 rows 988 cols
[2022-05-16 02:32:52] [INFO ] Computed 432 place invariants in 248 ms
[2022-05-16 02:32:54] [INFO ] Dead Transitions using invariants and state equation in 2261 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 988/988 places, 872/872 transitions.
Built C files in :
/tmp/ltsmin8391874612194443041
[2022-05-16 02:32:54] [INFO ] Computing symmetric may disable matrix : 872 transitions.
[2022-05-16 02:32:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:32:54] [INFO ] Computing symmetric may enable matrix : 872 transitions.
[2022-05-16 02:32:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:32:54] [INFO ] Computing Do-Not-Accords matrix : 872 transitions.
[2022-05-16 02:32:54] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:32:54] [INFO ] Built C files in 99ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8391874612194443041
Running compilation step : cd /tmp/ltsmin8391874612194443041;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2530 ms.
Running link step : cd /tmp/ltsmin8391874612194443041;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin8391874612194443041;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17908524681772185403.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 02:33:09] [INFO ] Flatten gal took : 39 ms
[2022-05-16 02:33:09] [INFO ] Flatten gal took : 45 ms
[2022-05-16 02:33:09] [INFO ] Time to serialize gal into /tmp/LTL4557742949073031049.gal : 4 ms
[2022-05-16 02:33:09] [INFO ] Time to serialize properties into /tmp/LTL7486192688259647523.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4557742949073031049.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7486192688259647523.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4557742...266
Read 1 LTL properties
Checking formula 0 : !((F(X(G(X(("((p650==0)||(p902==1))")U(X("((p991==0)||(p503==1))"))))))))
Formula 0 simplified : !FXGX("((p650==0)||(p902==1))" U X"((p991==0)||(p503==1))")
Detected timeout of ITS tools.
[2022-05-16 02:33:24] [INFO ] Flatten gal took : 39 ms
[2022-05-16 02:33:24] [INFO ] Applying decomposition
[2022-05-16 02:33:24] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10111533011232233336.txt' '-o' '/tmp/graph10111533011232233336.bin' '-w' '/tmp/graph10111533011232233336.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10111533011232233336.bin' '-l' '-1' '-v' '-w' '/tmp/graph10111533011232233336.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:33:24] [INFO ] Decomposing Gal with order
[2022-05-16 02:33:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:33:24] [INFO ] Removed a total of 1014 redundant transitions.
[2022-05-16 02:33:24] [INFO ] Flatten gal took : 71 ms
[2022-05-16 02:33:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 116 labels/synchronizations in 19 ms.
[2022-05-16 02:33:24] [INFO ] Time to serialize gal into /tmp/LTL7086961100405786980.gal : 10 ms
[2022-05-16 02:33:24] [INFO ] Time to serialize properties into /tmp/LTL459820502663101099.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7086961100405786980.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL459820502663101099.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7086961...244
Read 1 LTL properties
Checking formula 0 : !((F(X(G(X(("((i3.i2.u57.p650==0)||(i9.i2.u120.p902==1))")U(X("((i9.i2.u131.p991==0)||(i2.i0.u35.p503==1))"))))))))
Formula 0 simplified : !FXGX("((i3.i2.u57.p650==0)||(i9.i2.u120.p902==1))" U X"((i9.i2.u131.p991==0)||(i2.i0.u35.p503==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16621378505319443365
[2022-05-16 02:33:39] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16621378505319443365
Running compilation step : cd /tmp/ltsmin16621378505319443365;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1644 ms.
Running link step : cd /tmp/ltsmin16621378505319443365;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin16621378505319443365;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X([](X(((LTLAPp0==true) U X((LTLAPp1==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Echo-PT-d02r11-LTLCardinality-09 finished in 418307 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(G(X((F(!p0) U F(p1)))))) U !p2))'
Support contains 6 out of 1001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1001/1001 places, 874/874 transitions.
Graph (complete) has 2957 edges and 1001 vertex of which 993 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 27 ms. Remains 992 /1001 variables (removed 9) and now considering 872/874 (removed 2) transitions.
// Phase 1: matrix 872 rows 992 cols
[2022-05-16 02:33:55] [INFO ] Computed 436 place invariants in 271 ms
[2022-05-16 02:33:58] [INFO ] Implicit Places using invariants in 3465 ms returned [379, 416, 419, 456]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 3468 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 988/1001 places, 872/874 transitions.
Applied a total of 0 rules in 35 ms. Remains 988 /988 variables (removed 0) and now considering 872/872 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 988/1001 places, 872/874 transitions.
Stuttering acceptance computed with spot in 108 ms :[p2, (NOT p1), (NOT p1)]
Running random walk in product with property : Echo-PT-d02r11-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=p2, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(OR (EQ s585 0) (EQ s683 1)), p1:(AND (OR (EQ s244 0) (EQ s536 1)) (OR (EQ s968 0) (EQ s635 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 696 reset in 1002 ms.
Product exploration explored 100000 steps with 700 reset in 994 ms.
Computed a total of 988 stabilizing places and 872 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 988 transition count 872
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 p1), (X p2), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND p2 (NOT p1))))), true, (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 281 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 125 ms :[p2, (NOT p1), (NOT p1)]
Finished random walk after 254 steps, including 1 resets, run visited all 3 properties in 11 ms. (steps per millisecond=23 )
Knowledge obtained : [(AND p2 p1), (X p2), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND p2 (NOT p1))))), true, (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p1)), (F (AND p2 (NOT p1)))]
Knowledge based reduction with 10 factoid took 429 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 116 ms :[p2, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 84 ms :[p2, (NOT p1), (NOT p1)]
// Phase 1: matrix 872 rows 988 cols
[2022-05-16 02:34:02] [INFO ] Computed 432 place invariants in 249 ms
[2022-05-16 02:34:17] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 02:34:17] [INFO ] [Real]Absence check using 0 positive and 432 generalized place invariants in 14269 ms returned unknown
Could not prove EG p2
Support contains 6 out of 988 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 988/988 places, 872/872 transitions.
Applied a total of 0 rules in 22 ms. Remains 988 /988 variables (removed 0) and now considering 872/872 (removed 0) transitions.
// Phase 1: matrix 872 rows 988 cols
[2022-05-16 02:34:17] [INFO ] Computed 432 place invariants in 267 ms
[2022-05-16 02:34:20] [INFO ] Implicit Places using invariants in 3675 ms returned []
// Phase 1: matrix 872 rows 988 cols
[2022-05-16 02:34:21] [INFO ] Computed 432 place invariants in 247 ms
[2022-05-16 02:37:01] [INFO ] Performed 165/988 implicitness test of which 0 returned IMPLICIT in 158 seconds.
[2022-05-16 02:37:01] [INFO ] Timeout of Implicit test with SMT after 158 seconds.
[2022-05-16 02:37:01] [INFO ] Implicit Places using invariants and state equation in 160287 ms returned []
Implicit Place search using SMT with State Equation took 163964 ms to find 0 implicit places.
[2022-05-16 02:37:01] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 872 rows 988 cols
[2022-05-16 02:37:01] [INFO ] Computed 432 place invariants in 236 ms
[2022-05-16 02:37:03] [INFO ] Dead Transitions using invariants and state equation in 2221 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 988/988 places, 872/872 transitions.
Computed a total of 988 stabilizing places and 872 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 988 transition count 872
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 p1), (X p2), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND p2 (NOT p1))))), true, (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 329 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 84 ms :[p2, (NOT p1), (NOT p1)]
Finished random walk after 98 steps, including 0 resets, run visited all 3 properties in 6 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND p2 p1), (X p2), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND p2 (NOT p1))))), true, (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p1)), (F (AND p2 (NOT p1)))]
Knowledge based reduction with 10 factoid took 360 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 82 ms :[p2, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 92 ms :[p2, (NOT p1), (NOT p1)]
// Phase 1: matrix 872 rows 988 cols
[2022-05-16 02:37:04] [INFO ] Computed 432 place invariants in 239 ms
[2022-05-16 02:37:19] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 02:37:19] [INFO ] [Real]Absence check using 0 positive and 432 generalized place invariants in 14260 ms returned unknown
Could not prove EG p2
Stuttering acceptance computed with spot in 96 ms :[p2, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 727 reset in 953 ms.
Product exploration explored 100000 steps with 707 reset in 984 ms.
Built C files in :
/tmp/ltsmin13598781897527709980
[2022-05-16 02:37:22] [INFO ] Computing symmetric may disable matrix : 872 transitions.
[2022-05-16 02:37:22] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:37:22] [INFO ] Computing symmetric may enable matrix : 872 transitions.
[2022-05-16 02:37:22] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:37:22] [INFO ] Computing Do-Not-Accords matrix : 872 transitions.
[2022-05-16 02:37:22] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:37:22] [INFO ] Built C files in 82ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13598781897527709980
Running compilation step : cd /tmp/ltsmin13598781897527709980;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2543 ms.
Running link step : cd /tmp/ltsmin13598781897527709980;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin13598781897527709980;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8821169053816135853.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 988 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 988/988 places, 872/872 transitions.
Applied a total of 0 rules in 24 ms. Remains 988 /988 variables (removed 0) and now considering 872/872 (removed 0) transitions.
// Phase 1: matrix 872 rows 988 cols
[2022-05-16 02:37:37] [INFO ] Computed 432 place invariants in 228 ms
[2022-05-16 02:37:40] [INFO ] Implicit Places using invariants in 3769 ms returned []
// Phase 1: matrix 872 rows 988 cols
[2022-05-16 02:37:41] [INFO ] Computed 432 place invariants in 220 ms
[2022-05-16 02:40:21] [INFO ] Performed 165/988 implicitness test of which 0 returned IMPLICIT in 158 seconds.
[2022-05-16 02:40:21] [INFO ] Timeout of Implicit test with SMT after 158 seconds.
[2022-05-16 02:40:21] [INFO ] Implicit Places using invariants and state equation in 160242 ms returned []
Implicit Place search using SMT with State Equation took 164014 ms to find 0 implicit places.
[2022-05-16 02:40:21] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 872 rows 988 cols
[2022-05-16 02:40:21] [INFO ] Computed 432 place invariants in 232 ms
[2022-05-16 02:40:23] [INFO ] Dead Transitions using invariants and state equation in 2230 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 988/988 places, 872/872 transitions.
Built C files in :
/tmp/ltsmin8698756693196704597
[2022-05-16 02:40:23] [INFO ] Computing symmetric may disable matrix : 872 transitions.
[2022-05-16 02:40:23] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:40:23] [INFO ] Computing symmetric may enable matrix : 872 transitions.
[2022-05-16 02:40:23] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:40:23] [INFO ] Computing Do-Not-Accords matrix : 872 transitions.
[2022-05-16 02:40:23] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:40:23] [INFO ] Built C files in 113ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8698756693196704597
Running compilation step : cd /tmp/ltsmin8698756693196704597;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2525 ms.
Running link step : cd /tmp/ltsmin8698756693196704597;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin8698756693196704597;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6637051284388956646.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 02:40:38] [INFO ] Flatten gal took : 39 ms
[2022-05-16 02:40:38] [INFO ] Flatten gal took : 37 ms
[2022-05-16 02:40:38] [INFO ] Time to serialize gal into /tmp/LTL13116950834633471499.gal : 4 ms
[2022-05-16 02:40:38] [INFO ] Time to serialize properties into /tmp/LTL7997400334822759177.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13116950834633471499.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7997400334822759177.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1311695...267
Read 1 LTL properties
Checking formula 0 : !(((G(F(G(X((F(!("((p978==0)||(p645==1))")))U(F("(((p246==0)||(p546==1))&&((p978==0)||(p645==1)))")))))))U(!("((p595==0)||(p693==1))")...158
Formula 0 simplified : !(GFGX(F!"((p978==0)||(p645==1))" U F"(((p246==0)||(p546==1))&&((p978==0)||(p645==1)))") U !"((p595==0)||(p693==1))")
Detected timeout of ITS tools.
[2022-05-16 02:40:53] [INFO ] Flatten gal took : 36 ms
[2022-05-16 02:40:53] [INFO ] Applying decomposition
[2022-05-16 02:40:53] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17134916267639944514.txt' '-o' '/tmp/graph17134916267639944514.bin' '-w' '/tmp/graph17134916267639944514.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17134916267639944514.bin' '-l' '-1' '-v' '-w' '/tmp/graph17134916267639944514.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:40:53] [INFO ] Decomposing Gal with order
[2022-05-16 02:40:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:40:53] [INFO ] Removed a total of 1042 redundant transitions.
[2022-05-16 02:40:53] [INFO ] Flatten gal took : 69 ms
[2022-05-16 02:40:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 71 labels/synchronizations in 13 ms.
[2022-05-16 02:40:53] [INFO ] Time to serialize gal into /tmp/LTL2542380450841069643.gal : 10 ms
[2022-05-16 02:40:53] [INFO ] Time to serialize properties into /tmp/LTL4959475096652595084.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2542380450841069643.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4959475096652595084.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2542380...245
Read 1 LTL properties
Checking formula 0 : !(((G(F(G(X((F(!("((i3.u154.p978==0)||(i5.u63.p645==1))")))U(F("(((i6.u69.p246==0)||(i3.u31.p546==1))&&((i3.u154.p978==0)||(i5.u63.p64...216
Formula 0 simplified : !(GFGX(F!"((i3.u154.p978==0)||(i5.u63.p645==1))" U F"(((i6.u69.p246==0)||(i3.u31.p546==1))&&((i3.u154.p978==0)||(i5.u63.p645==1)))")...198
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15913518501697797797
[2022-05-16 02:41:09] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15913518501697797797
Running compilation step : cd /tmp/ltsmin15913518501697797797;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1764 ms.
Running link step : cd /tmp/ltsmin15913518501697797797;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin15913518501697797797;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](<>([](X((<>(!(LTLAPp0==true)) U <>((LTLAPp1==true))))))) U !(LTLAPp2==true))' '--buchi-type=spotba'
LTSmin run took 1110 ms.
FORMULA Echo-PT-d02r11-LTLCardinality-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Echo-PT-d02r11-LTLCardinality-10 finished in 436992 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||p0)))'
Support contains 1 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 874/874 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 998 transition count 874
Applied a total of 3 rules in 21 ms. Remains 998 /1001 variables (removed 3) and now considering 874/874 (removed 0) transitions.
// Phase 1: matrix 874 rows 998 cols
[2022-05-16 02:41:12] [INFO ] Computed 440 place invariants in 238 ms
[2022-05-16 02:41:15] [INFO ] Implicit Places using invariants in 3536 ms returned []
// Phase 1: matrix 874 rows 998 cols
[2022-05-16 02:41:15] [INFO ] Computed 440 place invariants in 218 ms
[2022-05-16 02:41:26] [INFO ] Implicit Places using invariants and state equation in 11068 ms returned []
Implicit Place search using SMT with State Equation took 14607 ms to find 0 implicit places.
// Phase 1: matrix 874 rows 998 cols
[2022-05-16 02:41:26] [INFO ] Computed 440 place invariants in 218 ms
[2022-05-16 02:41:28] [INFO ] Dead Transitions using invariants and state equation in 1855 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 998/1001 places, 874/874 transitions.
Finished structural reductions, in 1 iterations. Remains : 998/1001 places, 874/874 transitions.
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d02r11-LTLCardinality-13 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: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s162 0)], 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][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 717 ms.
Product exploration explored 100000 steps with 50000 reset in 753 ms.
Computed a total of 998 stabilizing places and 874 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 998 transition count 874
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 76 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Echo-PT-d02r11-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d02r11-LTLCardinality-13 finished in 18488 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0) U (X(X(!X(F(G(p0)))))||p1))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((G(X(p0)) U p1)||(X(p2)&&p0)))))'
Found a SL insensitive property : Echo-PT-d02r11-LTLCardinality-08
Stuttering acceptance computed with spot in 183 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 5 out of 1001 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1001/1001 places, 874/874 transitions.
Graph (complete) has 2957 edges and 1001 vertex of which 994 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.7 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 28 ms. Remains 993 /1001 variables (removed 8) and now considering 872/874 (removed 2) transitions.
// Phase 1: matrix 872 rows 993 cols
[2022-05-16 02:41:31] [INFO ] Computed 437 place invariants in 359 ms
[2022-05-16 02:41:34] [INFO ] Implicit Places using invariants in 3889 ms returned [379, 416, 419, 456]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 3902 ms to find 4 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 989/1001 places, 872/874 transitions.
Applied a total of 0 rules in 20 ms. Remains 989 /989 variables (removed 0) and now considering 872/872 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 989/1001 places, 872/874 transitions.
Running random walk in product with property : Echo-PT-d02r11-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={1} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={1} source=2 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={1} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={1} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s148 0) (EQ s65 1)), p0:(EQ s64 1), p2:(OR (EQ s210 0) (EQ s790 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 422 reset in 802 ms.
Product exploration explored 100000 steps with 418 reset in 928 ms.
Computed a total of 989 stabilizing places and 872 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 989 transition count 872
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) (NOT p2)))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 21 factoid took 1431 ms. Reduced automaton from 5 states, 21 edges and 3 AP to 5 states, 23 edges and 3 AP.
Stuttering acceptance computed with spot in 2325 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 41 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 10) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :1
Finished Best-First random walk after 3263 steps, including 0 resets, run visited all 1 properties in 18 ms. (steps per millisecond=181 )
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) (NOT p2)))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (AND (NOT p1) p2 p0)), (F (AND p1 (NOT p2) (NOT p0))), (F (NOT (AND p1 p0))), (F (NOT (OR p1 p0))), (F (AND (NOT p1) (NOT p2) p0)), (F (AND (NOT p1) (NOT p0))), (F (AND p1 (NOT p2) p0)), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (NOT (OR (AND p1 p0) (AND p2 p0))))]
Knowledge based reduction with 21 factoid took 1235 ms. Reduced automaton from 5 states, 23 edges and 3 AP to 5 states, 23 edges and 3 AP.
Stuttering acceptance computed with spot in 195 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 224 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 5 out of 989 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 989/989 places, 872/872 transitions.
Applied a total of 0 rules in 28 ms. Remains 989 /989 variables (removed 0) and now considering 872/872 (removed 0) transitions.
// Phase 1: matrix 872 rows 989 cols
[2022-05-16 02:41:42] [INFO ] Computed 433 place invariants in 259 ms
[2022-05-16 02:41:46] [INFO ] Implicit Places using invariants in 3752 ms returned []
// Phase 1: matrix 872 rows 989 cols
[2022-05-16 02:41:46] [INFO ] Computed 433 place invariants in 257 ms
[2022-05-16 02:44:26] [INFO ] Performed 24/989 implicitness test of which 0 returned IMPLICIT in 158 seconds.
[2022-05-16 02:44:26] [INFO ] Timeout of Implicit test with SMT after 158 seconds.
[2022-05-16 02:44:26] [INFO ] Implicit Places using invariants and state equation in 160293 ms returned []
Implicit Place search using SMT with State Equation took 164050 ms to find 0 implicit places.
[2022-05-16 02:44:26] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 872 rows 989 cols
[2022-05-16 02:44:27] [INFO ] Computed 433 place invariants in 274 ms
[2022-05-16 02:44:29] [INFO ] Dead Transitions using invariants and state equation in 2337 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 989/989 places, 872/872 transitions.
Computed a total of 989 stabilizing places and 872 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 989 transition count 872
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (OR (AND p1 p0) (AND p2 p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 2811 ms. Reduced automaton from 5 states, 23 edges and 3 AP to 5 states, 23 edges and 3 AP.
Stuttering acceptance computed with spot in 238 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 41 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 10) seen :8
Finished Best-First random walk after 9770 steps, including 2 resets, run visited all 2 properties in 43 ms. (steps per millisecond=227 )
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (OR (AND p1 p0) (AND p2 p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (AND (NOT p1) p2 p0)), (F (AND p1 (NOT p2) (NOT p0))), (F (NOT (AND p1 p0))), (F (NOT (OR p1 p0))), (F (AND (NOT p1) (NOT p2) p0)), (F (AND (NOT p1) (NOT p0))), (F (AND p1 (NOT p2) p0)), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (NOT (OR (AND p1 p0) (AND p2 p0))))]
Knowledge based reduction with 23 factoid took 1333 ms. Reduced automaton from 5 states, 23 edges and 3 AP to 5 states, 23 edges and 3 AP.
Stuttering acceptance computed with spot in 227 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 191 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 939 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 418 reset in 853 ms.
Product exploration explored 100000 steps with 416 reset in 911 ms.
Built C files in :
/tmp/ltsmin10258219196816503822
[2022-05-16 02:44:37] [INFO ] Computing symmetric may disable matrix : 872 transitions.
[2022-05-16 02:44:37] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:44:37] [INFO ] Computing symmetric may enable matrix : 872 transitions.
[2022-05-16 02:44:37] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:44:37] [INFO ] Computing Do-Not-Accords matrix : 872 transitions.
[2022-05-16 02:44:37] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:44:37] [INFO ] Built C files in 91ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10258219196816503822
Running compilation step : cd /tmp/ltsmin10258219196816503822;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10258219196816503822;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10258219196816503822;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 5 out of 989 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 989/989 places, 872/872 transitions.
Applied a total of 0 rules in 37 ms. Remains 989 /989 variables (removed 0) and now considering 872/872 (removed 0) transitions.
// Phase 1: matrix 872 rows 989 cols
[2022-05-16 02:44:40] [INFO ] Computed 433 place invariants in 252 ms
[2022-05-16 02:44:44] [INFO ] Implicit Places using invariants in 3671 ms returned []
// Phase 1: matrix 872 rows 989 cols
[2022-05-16 02:44:44] [INFO ] Computed 433 place invariants in 252 ms
[2022-05-16 02:47:24] [INFO ] Performed 24/989 implicitness test of which 0 returned IMPLICIT in 158 seconds.
[2022-05-16 02:47:24] [INFO ] Timeout of Implicit test with SMT after 158 seconds.
[2022-05-16 02:47:24] [INFO ] Implicit Places using invariants and state equation in 160286 ms returned []
Implicit Place search using SMT with State Equation took 163973 ms to find 0 implicit places.
[2022-05-16 02:47:24] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 872 rows 989 cols
[2022-05-16 02:47:24] [INFO ] Computed 433 place invariants in 251 ms
[2022-05-16 02:47:26] [INFO ] Dead Transitions using invariants and state equation in 2246 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 989/989 places, 872/872 transitions.
Built C files in :
/tmp/ltsmin5194072234750396279
[2022-05-16 02:47:26] [INFO ] Computing symmetric may disable matrix : 872 transitions.
[2022-05-16 02:47:26] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:47:26] [INFO ] Computing symmetric may enable matrix : 872 transitions.
[2022-05-16 02:47:26] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:47:26] [INFO ] Computing Do-Not-Accords matrix : 872 transitions.
[2022-05-16 02:47:26] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:47:26] [INFO ] Built C files in 95ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5194072234750396279
Running compilation step : cd /tmp/ltsmin5194072234750396279;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2541 ms.
Running link step : cd /tmp/ltsmin5194072234750396279;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin5194072234750396279;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased131906617632455532.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 02:47:41] [INFO ] Flatten gal took : 37 ms
[2022-05-16 02:47:41] [INFO ] Flatten gal took : 35 ms
[2022-05-16 02:47:41] [INFO ] Time to serialize gal into /tmp/LTL5737568330770794958.gal : 5 ms
[2022-05-16 02:47:41] [INFO ] Time to serialize properties into /tmp/LTL5723398812126046340.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5737568330770794958.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5723398812126046340.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5737568...266
Read 1 LTL properties
Checking formula 0 : !((F(G(((G(X("(p1064==1)")))U("((p150==0)||(p1065==1))"))||((X("((p212==0)||(p8==1))"))&&("(p1064==1)"))))))
Formula 0 simplified : !FG((GX"(p1064==1)" U "((p150==0)||(p1065==1))") | ("(p1064==1)" & X"((p212==0)||(p8==1))"))
Detected timeout of ITS tools.
[2022-05-16 02:47:56] [INFO ] Flatten gal took : 35 ms
[2022-05-16 02:47:56] [INFO ] Applying decomposition
[2022-05-16 02:47:56] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2290095543973164631.txt' '-o' '/tmp/graph2290095543973164631.bin' '-w' '/tmp/graph2290095543973164631.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2290095543973164631.bin' '-l' '-1' '-v' '-w' '/tmp/graph2290095543973164631.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:47:57] [INFO ] Decomposing Gal with order
[2022-05-16 02:47:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:47:57] [INFO ] Removed a total of 1036 redundant transitions.
[2022-05-16 02:47:57] [INFO ] Flatten gal took : 64 ms
[2022-05-16 02:47:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 16 ms.
[2022-05-16 02:47:57] [INFO ] Time to serialize gal into /tmp/LTL17545499828941343269.gal : 8 ms
[2022-05-16 02:47:57] [INFO ] Time to serialize properties into /tmp/LTL600433003047111156.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17545499828941343269.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL600433003047111156.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1754549...245
Read 1 LTL properties
Checking formula 0 : !((F(G(((G(X("(i9.u111.p1064==1)")))U("((i5.i2.u59.p150==0)||(i6.i1.u13.p1065==1))"))||((X("((i8.i2.u74.p212==0)||(i5.i2.u43.p8==1))")...185
Formula 0 simplified : !FG((GX"(i9.u111.p1064==1)" U "((i5.i2.u59.p150==0)||(i6.i1.u13.p1065==1))") | ("(i9.u111.p1064==1)" & X"((i8.i2.u74.p212==0)||(i5.i...171
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7290691140646000101
[2022-05-16 02:48:12] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7290691140646000101
Running compilation step : cd /tmp/ltsmin7290691140646000101;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1812 ms.
Running link step : cd /tmp/ltsmin7290691140646000101;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin7290691140646000101;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((([](X((LTLAPp0==true))) U (LTLAPp1==true))||(X((LTLAPp2==true))&&(LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Echo-PT-d02r11-LTLCardinality-08 finished in 416691 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(X((p0 U X(p1)))))))'
Found a SL insensitive property : Echo-PT-d02r11-LTLCardinality-09
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 4 out of 1001 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1001/1001 places, 874/874 transitions.
Graph (complete) has 2957 edges and 1001 vertex of which 993 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 25 ms. Remains 992 /1001 variables (removed 9) and now considering 872/874 (removed 2) transitions.
// Phase 1: matrix 872 rows 992 cols
[2022-05-16 02:48:27] [INFO ] Computed 436 place invariants in 251 ms
[2022-05-16 02:48:31] [INFO ] Implicit Places using invariants in 4027 ms returned [379, 416, 419, 456]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 4032 ms to find 4 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 988/1001 places, 872/874 transitions.
Applied a total of 0 rules in 25 ms. Remains 988 /988 variables (removed 0) and now considering 872/872 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 988/1001 places, 872/874 transitions.
Running random walk in product with property : Echo-PT-d02r11-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s640 0) (EQ s892 1)), p1:(OR (EQ s981 0) (EQ s493 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33332 reset in 627 ms.
Product exploration explored 100000 steps with 33314 reset in 666 ms.
Computed a total of 988 stabilizing places and 872 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 988 transition count 872
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 467 ms. Reduced automaton from 3 states, 8 edges and 2 AP to 3 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 1062 steps, including 4 resets, run visited all 5 properties in 51 ms. (steps per millisecond=20 )
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 11 factoid took 439 ms. Reduced automaton from 3 states, 9 edges and 2 AP to 3 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 4 out of 988 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 988/988 places, 872/872 transitions.
Applied a total of 0 rules in 28 ms. Remains 988 /988 variables (removed 0) and now considering 872/872 (removed 0) transitions.
// Phase 1: matrix 872 rows 988 cols
[2022-05-16 02:48:34] [INFO ] Computed 432 place invariants in 250 ms
[2022-05-16 02:48:38] [INFO ] Implicit Places using invariants in 3642 ms returned []
// Phase 1: matrix 872 rows 988 cols
[2022-05-16 02:48:38] [INFO ] Computed 432 place invariants in 257 ms
[2022-05-16 02:51:18] [INFO ] Performed 12/988 implicitness test of which 0 returned IMPLICIT in 158 seconds.
[2022-05-16 02:51:18] [INFO ] Timeout of Implicit test with SMT after 158 seconds.
[2022-05-16 02:51:18] [INFO ] Implicit Places using invariants and state equation in 160279 ms returned []
Implicit Place search using SMT with State Equation took 163923 ms to find 0 implicit places.
[2022-05-16 02:51:18] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 872 rows 988 cols
[2022-05-16 02:51:18] [INFO ] Computed 432 place invariants in 252 ms
[2022-05-16 02:51:20] [INFO ] Dead Transitions using invariants and state equation in 2255 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 988/988 places, 872/872 transitions.
Computed a total of 988 stabilizing places and 872 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 988 transition count 872
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (OR p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 448 ms. Reduced automaton from 3 states, 9 edges and 2 AP to 3 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 1761 steps, including 7 resets, run visited all 5 properties in 40 ms. (steps per millisecond=44 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (OR p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 13 factoid took 540 ms. Reduced automaton from 3 states, 9 edges and 2 AP to 3 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 33189 reset in 641 ms.
Product exploration explored 100000 steps with 33256 reset in 686 ms.
Built C files in :
/tmp/ltsmin8218784464239376355
[2022-05-16 02:51:23] [INFO ] Computing symmetric may disable matrix : 872 transitions.
[2022-05-16 02:51:23] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:51:23] [INFO ] Computing symmetric may enable matrix : 872 transitions.
[2022-05-16 02:51:23] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:51:24] [INFO ] Computing Do-Not-Accords matrix : 872 transitions.
[2022-05-16 02:51:24] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:51:24] [INFO ] Built C files in 83ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8218784464239376355
Running compilation step : cd /tmp/ltsmin8218784464239376355;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2525 ms.
Running link step : cd /tmp/ltsmin8218784464239376355;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin8218784464239376355;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17133633622841839999.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 988 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 988/988 places, 872/872 transitions.
Applied a total of 0 rules in 20 ms. Remains 988 /988 variables (removed 0) and now considering 872/872 (removed 0) transitions.
// Phase 1: matrix 872 rows 988 cols
[2022-05-16 02:51:39] [INFO ] Computed 432 place invariants in 223 ms
[2022-05-16 02:51:43] [INFO ] Implicit Places using invariants in 4012 ms returned []
// Phase 1: matrix 872 rows 988 cols
[2022-05-16 02:51:43] [INFO ] Computed 432 place invariants in 248 ms
[2022-05-16 02:54:23] [INFO ] Performed 23/988 implicitness test of which 0 returned IMPLICIT in 158 seconds.
[2022-05-16 02:54:23] [INFO ] Timeout of Implicit test with SMT after 158 seconds.
[2022-05-16 02:54:23] [INFO ] Implicit Places using invariants and state equation in 160272 ms returned []
Implicit Place search using SMT with State Equation took 164286 ms to find 0 implicit places.
[2022-05-16 02:54:23] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 872 rows 988 cols
[2022-05-16 02:54:23] [INFO ] Computed 432 place invariants in 226 ms
[2022-05-16 02:54:25] [INFO ] Dead Transitions using invariants and state equation in 2279 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 988/988 places, 872/872 transitions.
Built C files in :
/tmp/ltsmin3729068384413250998
[2022-05-16 02:54:25] [INFO ] Computing symmetric may disable matrix : 872 transitions.
[2022-05-16 02:54:25] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:54:25] [INFO ] Computing symmetric may enable matrix : 872 transitions.
[2022-05-16 02:54:25] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:54:25] [INFO ] Computing Do-Not-Accords matrix : 872 transitions.
[2022-05-16 02:54:25] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:54:25] [INFO ] Built C files in 79ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3729068384413250998
Running compilation step : cd /tmp/ltsmin3729068384413250998;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2700 ms.
Running link step : cd /tmp/ltsmin3729068384413250998;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin3729068384413250998;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8201958157416776130.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 02:54:40] [INFO ] Flatten gal took : 39 ms
[2022-05-16 02:54:40] [INFO ] Flatten gal took : 46 ms
[2022-05-16 02:54:40] [INFO ] Time to serialize gal into /tmp/LTL11499968290332278821.gal : 5 ms
[2022-05-16 02:54:40] [INFO ] Time to serialize properties into /tmp/LTL5239974546879885639.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11499968290332278821.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5239974546879885639.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1149996...267
Read 1 LTL properties
Checking formula 0 : !((F(X(G(X(("((p650==0)||(p902==1))")U(X("((p991==0)||(p503==1))"))))))))
Formula 0 simplified : !FXGX("((p650==0)||(p902==1))" U X"((p991==0)||(p503==1))")
Detected timeout of ITS tools.
[2022-05-16 02:54:55] [INFO ] Flatten gal took : 42 ms
[2022-05-16 02:54:55] [INFO ] Applying decomposition
[2022-05-16 02:54:55] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1349345320275077659.txt' '-o' '/tmp/graph1349345320275077659.bin' '-w' '/tmp/graph1349345320275077659.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1349345320275077659.bin' '-l' '-1' '-v' '-w' '/tmp/graph1349345320275077659.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:54:56] [INFO ] Decomposing Gal with order
[2022-05-16 02:54:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:54:56] [INFO ] Removed a total of 1025 redundant transitions.
[2022-05-16 02:54:56] [INFO ] Flatten gal took : 72 ms
[2022-05-16 02:54:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 20 ms.
[2022-05-16 02:54:56] [INFO ] Time to serialize gal into /tmp/LTL9228705304012019469.gal : 17 ms
[2022-05-16 02:54:56] [INFO ] Time to serialize properties into /tmp/LTL15155234033178885614.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9228705304012019469.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15155234033178885614.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9228705...246
Read 1 LTL properties
Checking formula 0 : !((F(X(G(X(("((i4.i0.u68.p650==0)||(i7.i1.u19.p902==1))")U(X("((i9.u129.p991==0)||(i2.i4.u140.p503==1))"))))))))
Formula 0 simplified : !FXGX("((i4.i0.u68.p650==0)||(i7.i1.u19.p902==1))" U X"((i9.u129.p991==0)||(i2.i4.u140.p503==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10174218002212171534
[2022-05-16 02:55:11] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10174218002212171534
Running compilation step : cd /tmp/ltsmin10174218002212171534;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1671 ms.
Running link step : cd /tmp/ltsmin10174218002212171534;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin10174218002212171534;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X([](X(((LTLAPp0==true) U X((LTLAPp1==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Echo-PT-d02r11-LTLCardinality-09 finished in 419103 ms.
[2022-05-16 02:55:26] [INFO ] Flatten gal took : 37 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12130778698829127657
[2022-05-16 02:55:26] [INFO ] Computing symmetric may disable matrix : 874 transitions.
[2022-05-16 02:55:26] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:55:26] [INFO ] Computing symmetric may enable matrix : 874 transitions.
[2022-05-16 02:55:26] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:55:26] [INFO ] Applying decomposition
[2022-05-16 02:55:26] [INFO ] Flatten gal took : 37 ms
[2022-05-16 02:55:26] [INFO ] Computing Do-Not-Accords matrix : 874 transitions.
[2022-05-16 02:55:26] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:55:26] [INFO ] Built C files in 119ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12130778698829127657
Running compilation step : cd /tmp/ltsmin12130778698829127657;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4105808817482479520.txt' '-o' '/tmp/graph4105808817482479520.bin' '-w' '/tmp/graph4105808817482479520.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4105808817482479520.bin' '-l' '-1' '-v' '-w' '/tmp/graph4105808817482479520.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:55:26] [INFO ] Decomposing Gal with order
[2022-05-16 02:55:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:55:26] [INFO ] Removed a total of 907 redundant transitions.
[2022-05-16 02:55:26] [INFO ] Flatten gal took : 68 ms
[2022-05-16 02:55:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 89 labels/synchronizations in 15 ms.
[2022-05-16 02:55:26] [INFO ] Time to serialize gal into /tmp/LTLCardinality4291439286360375960.gal : 8 ms
[2022-05-16 02:55:26] [INFO ] Time to serialize properties into /tmp/LTLCardinality8094941841167764128.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality4291439286360375960.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8094941841167764128.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...267
Read 3 LTL properties
Checking formula 0 : !((G((F("((i11.u131.p98==0)||(i4.i0.u77.p284==1))"))U(((X(X(!(X(F(G("((i11.u131.p98==0)||(i4.i0.u77.p284==1))")))))))||("(i3.i1.u30.p5...192
Formula 0 simplified : !G(F"((i11.u131.p98==0)||(i4.i0.u77.p284==1))" U ("(i3.i1.u30.p550==0)" | "(i3.i1.u44.p10==1)" | XX!XFG"((i11.u131.p98==0)||(i4.i0.u...170
Compilation finished in 2608 ms.
Running link step : cd /tmp/ltsmin12130778698829127657;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin12130778698829127657;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true)) U (X(X(!X(<>([]((LTLAPp0==true))))))||(LTLAPp1==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.027: LTL layer: formula: []((<>((LTLAPp0==true)) U (X(X(!X(<>([]((LTLAPp0==true))))))||(LTLAPp1==true))))
pins2lts-mc-linux64( 2/ 8), 0.027: "[]((<>((LTLAPp0==true)) U (X(X(!X(<>([]((LTLAPp0==true))))))||(LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.028: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.035: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.048: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.051: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.056: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.059: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.060: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.061: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.064: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.203: DFS-FIFO for weak LTL, using special progress label 882
pins2lts-mc-linux64( 0/ 8), 0.203: There are 883 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.203: State length is 1002, there are 877 groups
pins2lts-mc-linux64( 0/ 8), 0.203: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.203: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.203: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.203: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.402: ~1 levels ~960 states ~9848 transitions
pins2lts-mc-linux64( 1/ 8), 0.526: ~1 levels ~1920 states ~21016 transitions
pins2lts-mc-linux64( 1/ 8), 0.772: ~1 levels ~3840 states ~45856 transitions
pins2lts-mc-linux64( 1/ 8), 1.128: ~1 levels ~7680 states ~97016 transitions
pins2lts-mc-linux64( 1/ 8), 1.763: ~1 levels ~15360 states ~204216 transitions
pins2lts-mc-linux64( 0/ 8), 3.010: ~226 levels ~30720 states ~352000 transitions
pins2lts-mc-linux64( 0/ 8), 4.248: ~226 levels ~61440 states ~407824 transitions
pins2lts-mc-linux64( 0/ 8), 6.661: ~226 levels ~122880 states ~525600 transitions
pins2lts-mc-linux64( 0/ 8), 11.139: ~226 levels ~245760 states ~775976 transitions
pins2lts-mc-linux64( 0/ 8), 20.186: ~226 levels ~491520 states ~1344304 transitions
pins2lts-mc-linux64( 1/ 8), 37.865: ~224 levels ~983040 states ~2661336 transitions
pins2lts-mc-linux64( 1/ 8), 72.594: ~224 levels ~1966080 states ~5014008 transitions
pins2lts-mc-linux64( 1/ 8), 142.633: ~224 levels ~3932160 states ~10177928 transitions
pins2lts-mc-linux64( 0/ 8), 314.785: ~226 levels ~7864320 states ~21232624 transitions
pins2lts-mc-linux64( 0/ 8), 602.607: ~226 levels ~15728640 states ~43933312 transitions
pins2lts-mc-linux64( 7/ 8), 908.806: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 908.926:
pins2lts-mc-linux64( 0/ 8), 908.926: mean standard work distribution: 28.3% (states) 26.7% (transitions)
pins2lts-mc-linux64( 0/ 8), 908.926:
pins2lts-mc-linux64( 0/ 8), 908.926: Explored 17336168 states 50921138 transitions, fanout: 2.937
pins2lts-mc-linux64( 0/ 8), 908.926: Total exploration time 908.710 sec (908.610 sec minimum, 908.650 sec on average)
pins2lts-mc-linux64( 0/ 8), 908.926: States per second: 19078, Transitions per second: 56037
pins2lts-mc-linux64( 0/ 8), 908.926:
pins2lts-mc-linux64( 0/ 8), 908.926: Progress states detected: 648273
pins2lts-mc-linux64( 0/ 8), 908.926: Redundant explorations: -3.2395
pins2lts-mc-linux64( 0/ 8), 908.926:
pins2lts-mc-linux64( 0/ 8), 908.926: Queue width: 8B, total height: 1010988, memory: 7.71MB
pins2lts-mc-linux64( 0/ 8), 908.926: Tree memory: 392.7MB, 23.0 B/state, compr.: 0.6%
pins2lts-mc-linux64( 0/ 8), 908.926: Tree fill ratio (roots/leafs): 13.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 908.926: Stored 1034 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 908.926: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 908.926: Est. total memory use: 400.4MB (~1031.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12130778698829127657;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true)) U (X(X(!X(<>([]((LTLAPp0==true))))))||(LTLAPp1==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12130778698829127657;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true)) U (X(X(!X(<>([]((LTLAPp0==true))))))||(LTLAPp1==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Echo-PT-d02r11"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Echo-PT-d02r11, 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 r078-tall-165260110200379"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Echo-PT-d02r11.tgz
mv Echo-PT-d02r11 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;