About the Execution of ITS-Tools for HirschbergSinclair-PT-15
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4609.315 | 2507128.00 | 3917154.00 | 5772.90 | TFFTFTTFFTTFFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r197-smll-167840344200444.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is HirschbergSinclair-PT-15, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-smll-167840344200444
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 9.1K Feb 26 02:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 02:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 26 02:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 02:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 16:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 16:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 02:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 26 02:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 02:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 02:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 173K Mar 5 18:22 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 HirschbergSinclair-PT-15-LTLFireability-00
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-01
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-02
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-03
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-04
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-05
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-06
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-07
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-08
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-09
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-10
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-11
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-12
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-13
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-14
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678565717095
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-15
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-11 20:15:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 20:15:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 20:15:20] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2023-03-11 20:15:20] [INFO ] Transformed 330 places.
[2023-03-11 20:15:20] [INFO ] Transformed 296 transitions.
[2023-03-11 20:15:20] [INFO ] Parsed PT model containing 330 places and 296 transitions and 906 arcs in 303 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA HirschbergSinclair-PT-15-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-15-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 330/330 places, 296/296 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 315 transition count 296
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 23 place count 307 transition count 288
Iterating global reduction 1 with 8 rules applied. Total rules applied 31 place count 307 transition count 288
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 38 place count 300 transition count 281
Iterating global reduction 1 with 7 rules applied. Total rules applied 45 place count 300 transition count 281
Applied a total of 45 rules in 158 ms. Remains 300 /330 variables (removed 30) and now considering 281/296 (removed 15) transitions.
// Phase 1: matrix 281 rows 300 cols
[2023-03-11 20:15:21] [INFO ] Computed 19 place invariants in 39 ms
[2023-03-11 20:15:22] [INFO ] Implicit Places using invariants in 694 ms returned []
[2023-03-11 20:15:22] [INFO ] Invariant cache hit.
[2023-03-11 20:15:22] [INFO ] Implicit Places using invariants and state equation in 932 ms returned []
Implicit Place search using SMT with State Equation took 1689 ms to find 0 implicit places.
[2023-03-11 20:15:22] [INFO ] Invariant cache hit.
[2023-03-11 20:15:23] [INFO ] Dead Transitions using invariants and state equation in 370 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 300/330 places, 281/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2222 ms. Remains : 300/330 places, 281/296 transitions.
Support contains 43 out of 300 places after structural reductions.
[2023-03-11 20:15:23] [INFO ] Flatten gal took : 109 ms
[2023-03-11 20:15:23] [INFO ] Flatten gal took : 50 ms
[2023-03-11 20:15:23] [INFO ] Input system was already deterministic with 281 transitions.
Incomplete random walk after 10000 steps, including 33 resets, run finished after 456 ms. (steps per millisecond=21 ) properties (out of 32) seen :30
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-11 20:15:24] [INFO ] Invariant cache hit.
[2023-03-11 20:15:24] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 45 ms returned sat
[2023-03-11 20:15:24] [INFO ] After 401ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 300 stabilizing places and 281 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 300 transition count 281
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 : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 300/300 places, 281/281 transitions.
Reduce places removed 14 places and 14 transitions.
Drop transitions removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 111 rules applied. Total rules applied 111 place count 286 transition count 156
Reduce places removed 111 places and 0 transitions.
Iterating post reduction 1 with 111 rules applied. Total rules applied 222 place count 175 transition count 156
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 230 place count 167 transition count 148
Iterating global reduction 2 with 8 rules applied. Total rules applied 238 place count 167 transition count 148
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 239 place count 167 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 240 place count 166 transition count 147
Applied a total of 240 rules in 67 ms. Remains 166 /300 variables (removed 134) and now considering 147/281 (removed 134) transitions.
// Phase 1: matrix 147 rows 166 cols
[2023-03-11 20:15:25] [INFO ] Computed 19 place invariants in 6 ms
[2023-03-11 20:15:25] [INFO ] Implicit Places using invariants in 220 ms returned []
[2023-03-11 20:15:25] [INFO ] Invariant cache hit.
[2023-03-11 20:15:26] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 574 ms to find 0 implicit places.
[2023-03-11 20:15:26] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-11 20:15:26] [INFO ] Invariant cache hit.
[2023-03-11 20:15:26] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 166/300 places, 147/281 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 832 ms. Remains : 166/300 places, 147/281 transitions.
Stuttering acceptance computed with spot in 250 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s116 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 911 reset in 618 ms.
Product exploration explored 100000 steps with 910 reset in 335 ms.
Computed a total of 166 stabilizing places and 147 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 166 transition count 147
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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 171 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Finished random walk after 116 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=58 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 208 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
[2023-03-11 20:15:28] [INFO ] Invariant cache hit.
[2023-03-11 20:15:28] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 36 ms returned sat
[2023-03-11 20:15:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 20:15:29] [INFO ] [Real]Absence check using state equation in 381 ms returned sat
[2023-03-11 20:15:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 20:15:29] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 38 ms returned sat
[2023-03-11 20:15:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 20:15:29] [INFO ] [Nat]Absence check using state equation in 396 ms returned sat
[2023-03-11 20:15:29] [INFO ] Computed and/alt/rep : 109/115/109 causal constraints (skipped 11 transitions) in 20 ms.
[2023-03-11 20:15:30] [INFO ] Added : 62 causal constraints over 13 iterations in 588 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 147/147 transitions.
Applied a total of 0 rules in 10 ms. Remains 166 /166 variables (removed 0) and now considering 147/147 (removed 0) transitions.
[2023-03-11 20:15:30] [INFO ] Invariant cache hit.
[2023-03-11 20:15:30] [INFO ] Implicit Places using invariants in 208 ms returned []
[2023-03-11 20:15:30] [INFO ] Invariant cache hit.
[2023-03-11 20:15:30] [INFO ] Implicit Places using invariants and state equation in 487 ms returned []
Implicit Place search using SMT with State Equation took 698 ms to find 0 implicit places.
[2023-03-11 20:15:30] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-11 20:15:30] [INFO ] Invariant cache hit.
[2023-03-11 20:15:31] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 979 ms. Remains : 166/166 places, 147/147 transitions.
Computed a total of 166 stabilizing places and 147 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 166 transition count 147
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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 229 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Finished random walk after 109 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=54 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 248 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
[2023-03-11 20:15:32] [INFO ] Invariant cache hit.
[2023-03-11 20:15:32] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 42 ms returned sat
[2023-03-11 20:15:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 20:15:32] [INFO ] [Real]Absence check using state equation in 383 ms returned sat
[2023-03-11 20:15:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 20:15:32] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 40 ms returned sat
[2023-03-11 20:15:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 20:15:33] [INFO ] [Nat]Absence check using state equation in 408 ms returned sat
[2023-03-11 20:15:33] [INFO ] Computed and/alt/rep : 109/115/109 causal constraints (skipped 11 transitions) in 17 ms.
[2023-03-11 20:15:33] [INFO ] Added : 62 causal constraints over 13 iterations in 489 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Product exploration explored 100000 steps with 909 reset in 297 ms.
Product exploration explored 100000 steps with 911 reset in 313 ms.
Built C files in :
/tmp/ltsmin15276660978233034234
[2023-03-11 20:15:34] [INFO ] Computing symmetric may disable matrix : 147 transitions.
[2023-03-11 20:15:34] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 20:15:34] [INFO ] Computing symmetric may enable matrix : 147 transitions.
[2023-03-11 20:15:34] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 20:15:34] [INFO ] Computing Do-Not-Accords matrix : 147 transitions.
[2023-03-11 20:15:34] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 20:15:34] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15276660978233034234
Running compilation step : cd /tmp/ltsmin15276660978233034234;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 704 ms.
Running link step : cd /tmp/ltsmin15276660978233034234;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin15276660978233034234;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4206877718369520647.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 147/147 transitions.
Applied a total of 0 rules in 9 ms. Remains 166 /166 variables (removed 0) and now considering 147/147 (removed 0) transitions.
[2023-03-11 20:15:49] [INFO ] Invariant cache hit.
[2023-03-11 20:15:49] [INFO ] Implicit Places using invariants in 165 ms returned []
[2023-03-11 20:15:49] [INFO ] Invariant cache hit.
[2023-03-11 20:15:50] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
[2023-03-11 20:15:50] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-11 20:15:50] [INFO ] Invariant cache hit.
[2023-03-11 20:15:50] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 865 ms. Remains : 166/166 places, 147/147 transitions.
Built C files in :
/tmp/ltsmin13436999292998339904
[2023-03-11 20:15:50] [INFO ] Computing symmetric may disable matrix : 147 transitions.
[2023-03-11 20:15:50] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 20:15:50] [INFO ] Computing symmetric may enable matrix : 147 transitions.
[2023-03-11 20:15:50] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 20:15:50] [INFO ] Computing Do-Not-Accords matrix : 147 transitions.
[2023-03-11 20:15:50] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 20:15:50] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13436999292998339904
Running compilation step : cd /tmp/ltsmin13436999292998339904;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 653 ms.
Running link step : cd /tmp/ltsmin13436999292998339904;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin13436999292998339904;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1689780642876986327.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-11 20:16:05] [INFO ] Flatten gal took : 13 ms
[2023-03-11 20:16:05] [INFO ] Flatten gal took : 13 ms
[2023-03-11 20:16:05] [INFO ] Time to serialize gal into /tmp/LTL17696530001840877685.gal : 4 ms
[2023-03-11 20:16:05] [INFO ] Time to serialize properties into /tmp/LTL1948432578590951668.prop : 32 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17696530001840877685.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6721120617513282839.hoa' '-atoms' '/tmp/LTL1948432578590951668.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1948432578590951668.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6721120617513282839.hoa
Reverse transition relation is NOT exact ! Due to transitions t0, t15.t16, t17.t18, t20, t23.t24, t27.t28, t31.t32, t37.t38, t41.t42, t47.t48, t53.t54, t59...314
Computing Next relation with stutter on 1.09863e+11 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
431 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.39332,135596,1,0,759,646603,320,484,4635,570811,1411
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA HirschbergSinclair-PT-15-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property HirschbergSinclair-PT-15-LTLFireability-00 finished in 45259 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))&&G(p1))))'
Support contains 4 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 281/281 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 294 transition count 275
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 294 transition count 275
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 289 transition count 270
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 289 transition count 270
Applied a total of 22 rules in 19 ms. Remains 289 /300 variables (removed 11) and now considering 270/281 (removed 11) transitions.
// Phase 1: matrix 270 rows 289 cols
[2023-03-11 20:16:10] [INFO ] Computed 19 place invariants in 4 ms
[2023-03-11 20:16:11] [INFO ] Implicit Places using invariants in 231 ms returned []
[2023-03-11 20:16:11] [INFO ] Invariant cache hit.
[2023-03-11 20:16:12] [INFO ] Implicit Places using invariants and state equation in 947 ms returned []
Implicit Place search using SMT with State Equation took 1180 ms to find 0 implicit places.
[2023-03-11 20:16:12] [INFO ] Invariant cache hit.
[2023-03-11 20:16:12] [INFO ] Dead Transitions using invariants and state equation in 383 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 289/300 places, 270/281 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1585 ms. Remains : 289/300 places, 270/281 transitions.
Stuttering acceptance computed with spot in 279 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(GEQ s0 1), p0:(OR (AND (LT s239 1) (LT s49 1)) (GEQ s87 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-15-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-15-LTLFireability-01 finished in 1889 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(p0) U p1))))'
Support contains 3 out of 300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 300/300 places, 281/281 transitions.
Reduce places removed 15 places and 15 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 285 transition count 147
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 238 place count 166 transition count 147
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 246 place count 158 transition count 139
Iterating global reduction 2 with 8 rules applied. Total rules applied 254 place count 158 transition count 139
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 255 place count 158 transition count 138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 256 place count 157 transition count 138
Applied a total of 256 rules in 41 ms. Remains 157 /300 variables (removed 143) and now considering 138/281 (removed 143) transitions.
// Phase 1: matrix 138 rows 157 cols
[2023-03-11 20:16:12] [INFO ] Computed 19 place invariants in 3 ms
[2023-03-11 20:16:13] [INFO ] Implicit Places using invariants in 249 ms returned []
[2023-03-11 20:16:13] [INFO ] Invariant cache hit.
[2023-03-11 20:16:13] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 716 ms to find 0 implicit places.
[2023-03-11 20:16:13] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-11 20:16:13] [INFO ] Invariant cache hit.
[2023-03-11 20:16:13] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 157/300 places, 138/281 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 982 ms. Remains : 157/300 places, 138/281 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s101 1), p0:(AND (GEQ s45 1) (GEQ s49 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 151 steps with 0 reset in 3 ms.
FORMULA HirschbergSinclair-PT-15-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-15-LTLFireability-02 finished in 1172 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||F(p1)))))'
Support contains 2 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 281/281 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 292 transition count 273
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 292 transition count 273
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 285 transition count 266
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 285 transition count 266
Applied a total of 30 rules in 22 ms. Remains 285 /300 variables (removed 15) and now considering 266/281 (removed 15) transitions.
// Phase 1: matrix 266 rows 285 cols
[2023-03-11 20:16:13] [INFO ] Computed 19 place invariants in 6 ms
[2023-03-11 20:16:14] [INFO ] Implicit Places using invariants in 268 ms returned []
[2023-03-11 20:16:14] [INFO ] Invariant cache hit.
[2023-03-11 20:16:15] [INFO ] Implicit Places using invariants and state equation in 965 ms returned []
Implicit Place search using SMT with State Equation took 1236 ms to find 0 implicit places.
[2023-03-11 20:16:15] [INFO ] Invariant cache hit.
[2023-03-11 20:16:15] [INFO ] Dead Transitions using invariants and state equation in 402 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 285/300 places, 266/281 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1664 ms. Remains : 285/300 places, 266/281 transitions.
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s113 1), p1:(GEQ s151 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 482 reset in 373 ms.
Product exploration explored 100000 steps with 483 reset in 463 ms.
Computed a total of 285 stabilizing places and 266 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 285 transition count 266
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 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 353 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 165 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=33 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F p1)]
Knowledge based reduction with 7 factoid took 310 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 285 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 266/266 transitions.
Applied a total of 0 rules in 7 ms. Remains 285 /285 variables (removed 0) and now considering 266/266 (removed 0) transitions.
[2023-03-11 20:16:17] [INFO ] Invariant cache hit.
[2023-03-11 20:16:18] [INFO ] Implicit Places using invariants in 314 ms returned []
[2023-03-11 20:16:18] [INFO ] Invariant cache hit.
[2023-03-11 20:16:19] [INFO ] Implicit Places using invariants and state equation in 901 ms returned []
Implicit Place search using SMT with State Equation took 1230 ms to find 0 implicit places.
[2023-03-11 20:16:19] [INFO ] Invariant cache hit.
[2023-03-11 20:16:19] [INFO ] Dead Transitions using invariants and state equation in 357 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1597 ms. Remains : 285/285 places, 266/266 transitions.
Computed a total of 285 stabilizing places and 266 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 285 transition count 266
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 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 361 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 167 steps, including 0 resets, run visited all 2 properties in 7 ms. (steps per millisecond=23 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F p1)]
Knowledge based reduction with 7 factoid took 529 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 480 reset in 320 ms.
Product exploration explored 100000 steps with 486 reset in 374 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 285 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 285/285 places, 266/266 transitions.
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 114 rules applied. Total rules applied 114 place count 285 transition count 266
Deduced a syphon composed of 114 places in 0 ms
Applied a total of 114 rules in 44 ms. Remains 285 /285 variables (removed 0) and now considering 266/266 (removed 0) transitions.
[2023-03-11 20:16:22] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 266 rows 285 cols
[2023-03-11 20:16:22] [INFO ] Computed 19 place invariants in 3 ms
[2023-03-11 20:16:22] [INFO ] Dead Transitions using invariants and state equation in 255 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 285/285 places, 266/266 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 322 ms. Remains : 285/285 places, 266/266 transitions.
Built C files in :
/tmp/ltsmin8776212395482466692
[2023-03-11 20:16:22] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8776212395482466692
Running compilation step : cd /tmp/ltsmin8776212395482466692;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 587 ms.
Running link step : cd /tmp/ltsmin8776212395482466692;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin8776212395482466692;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1894317563789931362.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 285 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 266/266 transitions.
Applied a total of 0 rules in 10 ms. Remains 285 /285 variables (removed 0) and now considering 266/266 (removed 0) transitions.
// Phase 1: matrix 266 rows 285 cols
[2023-03-11 20:16:37] [INFO ] Computed 19 place invariants in 3 ms
[2023-03-11 20:16:37] [INFO ] Implicit Places using invariants in 182 ms returned []
[2023-03-11 20:16:37] [INFO ] Invariant cache hit.
[2023-03-11 20:16:38] [INFO ] Implicit Places using invariants and state equation in 791 ms returned []
Implicit Place search using SMT with State Equation took 983 ms to find 0 implicit places.
[2023-03-11 20:16:38] [INFO ] Invariant cache hit.
[2023-03-11 20:16:39] [INFO ] Dead Transitions using invariants and state equation in 417 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1412 ms. Remains : 285/285 places, 266/266 transitions.
Built C files in :
/tmp/ltsmin12780030447699636787
[2023-03-11 20:16:39] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12780030447699636787
Running compilation step : cd /tmp/ltsmin12780030447699636787;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 958 ms.
Running link step : cd /tmp/ltsmin12780030447699636787;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin12780030447699636787;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3663283112459866881.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-11 20:16:54] [INFO ] Flatten gal took : 21 ms
[2023-03-11 20:16:54] [INFO ] Flatten gal took : 21 ms
[2023-03-11 20:16:54] [INFO ] Time to serialize gal into /tmp/LTL8233173367837312419.gal : 5 ms
[2023-03-11 20:16:54] [INFO ] Time to serialize properties into /tmp/LTL17878240050723440727.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8233173367837312419.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16330243183397522505.hoa' '-atoms' '/tmp/LTL17878240050723440727.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17878240050723440727.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16330243183397522505.hoa
Detected timeout of ITS tools.
[2023-03-11 20:17:09] [INFO ] Flatten gal took : 20 ms
[2023-03-11 20:17:09] [INFO ] Flatten gal took : 19 ms
[2023-03-11 20:17:09] [INFO ] Time to serialize gal into /tmp/LTL11199363385873111384.gal : 5 ms
[2023-03-11 20:17:09] [INFO ] Time to serialize properties into /tmp/LTL1744020123381640889.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11199363385873111384.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1744020123381640889.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G(("(rcv_right_election_15_2_1_14<1)")||(F("(rcv_right_election_15_3_3_12>=1)"))))))
Formula 0 simplified : XF(!"(rcv_right_election_15_2_1_14<1)" & G!"(rcv_right_election_15_3_3_12>=1)")
Detected timeout of ITS tools.
[2023-03-11 20:17:24] [INFO ] Flatten gal took : 17 ms
[2023-03-11 20:17:24] [INFO ] Applying decomposition
[2023-03-11 20:17:24] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14482807807118007681.txt' '-o' '/tmp/graph14482807807118007681.bin' '-w' '/tmp/graph14482807807118007681.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14482807807118007681.bin' '-l' '-1' '-v' '-w' '/tmp/graph14482807807118007681.weights' '-q' '0' '-e' '0.001'
[2023-03-11 20:17:24] [INFO ] Decomposing Gal with order
[2023-03-11 20:17:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 20:17:24] [INFO ] Removed a total of 28 redundant transitions.
[2023-03-11 20:17:24] [INFO ] Flatten gal took : 109 ms
[2023-03-11 20:17:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2023-03-11 20:17:24] [INFO ] Time to serialize gal into /tmp/LTL18215019974254902773.gal : 8 ms
[2023-03-11 20:17:24] [INFO ] Time to serialize properties into /tmp/LTL9323991109982786372.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18215019974254902773.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9323991109982786372.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G(("(i6.u10.rcv_right_election_15_2_1_14<1)")||(F("(i5.u9.rcv_right_election_15_3_3_12>=1)"))))))
Formula 0 simplified : XF(!"(i6.u10.rcv_right_election_15_2_1_14<1)" & G!"(i5.u9.rcv_right_election_15_3_3_12>=1)")
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t4, t6, t7, t8, t10, t12, t13, t14, t56, t265, t280, i0.t20, i0.t1, i0.u0.t18, i0.u0....555
Computing Next relation with stutter on 1.09863e+11 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11813435037809834804
[2023-03-11 20:17:39] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11813435037809834804
Running compilation step : cd /tmp/ltsmin11813435037809834804;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 779 ms.
Running link step : cd /tmp/ltsmin11813435037809834804;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin11813435037809834804;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](((LTLAPp0==true)||<>((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HirschbergSinclair-PT-15-LTLFireability-03 finished in 101083 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(G(p1)))))'
Support contains 3 out of 300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 300/300 places, 281/281 transitions.
Reduce places removed 14 places and 14 transitions.
Drop transitions removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 111 rules applied. Total rules applied 111 place count 286 transition count 156
Reduce places removed 111 places and 0 transitions.
Iterating post reduction 1 with 111 rules applied. Total rules applied 222 place count 175 transition count 156
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 230 place count 167 transition count 148
Iterating global reduction 2 with 8 rules applied. Total rules applied 238 place count 167 transition count 148
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 239 place count 167 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 240 place count 166 transition count 147
Applied a total of 240 rules in 32 ms. Remains 166 /300 variables (removed 134) and now considering 147/281 (removed 134) transitions.
// Phase 1: matrix 147 rows 166 cols
[2023-03-11 20:17:55] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-11 20:17:55] [INFO ] Implicit Places using invariants in 169 ms returned []
[2023-03-11 20:17:55] [INFO ] Invariant cache hit.
[2023-03-11 20:17:55] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 508 ms to find 0 implicit places.
[2023-03-11 20:17:55] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-11 20:17:55] [INFO ] Invariant cache hit.
[2023-03-11 20:17:55] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 166/300 places, 147/281 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 733 ms. Remains : 166/300 places, 147/281 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s141 1), p1:(AND (GEQ s13 1) (GEQ s148 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 163 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-15-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-15-LTLFireability-04 finished in 867 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 4 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 281/281 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 292 transition count 273
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 292 transition count 273
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 286 transition count 267
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 286 transition count 267
Applied a total of 28 rules in 24 ms. Remains 286 /300 variables (removed 14) and now considering 267/281 (removed 14) transitions.
// Phase 1: matrix 267 rows 286 cols
[2023-03-11 20:17:55] [INFO ] Computed 19 place invariants in 3 ms
[2023-03-11 20:17:56] [INFO ] Implicit Places using invariants in 192 ms returned []
[2023-03-11 20:17:56] [INFO ] Invariant cache hit.
[2023-03-11 20:17:56] [INFO ] Implicit Places using invariants and state equation in 670 ms returned []
Implicit Place search using SMT with State Equation took 871 ms to find 0 implicit places.
[2023-03-11 20:17:56] [INFO ] Invariant cache hit.
[2023-03-11 20:17:57] [INFO ] Dead Transitions using invariants and state equation in 413 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 286/300 places, 267/281 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1310 ms. Remains : 286/300 places, 267/281 transitions.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(OR (LT s11 1) (LT s198 1)), p0:(AND (GEQ s21 1) (GEQ s68 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 4315 reset in 479 ms.
Product exploration explored 100000 steps with 4301 reset in 402 ms.
Computed a total of 286 stabilizing places and 267 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 286 transition count 267
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 p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 6 factoid took 247 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-15-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-15-LTLFireability-05 finished in 2695 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 2 out of 300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 300/300 places, 281/281 transitions.
Reduce places removed 15 places and 15 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 285 transition count 146
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 165 transition count 146
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 246 place count 159 transition count 140
Iterating global reduction 2 with 6 rules applied. Total rules applied 252 place count 159 transition count 140
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 253 place count 159 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 254 place count 158 transition count 139
Applied a total of 254 rules in 28 ms. Remains 158 /300 variables (removed 142) and now considering 139/281 (removed 142) transitions.
// Phase 1: matrix 139 rows 158 cols
[2023-03-11 20:17:58] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-11 20:17:58] [INFO ] Implicit Places using invariants in 237 ms returned []
[2023-03-11 20:17:58] [INFO ] Invariant cache hit.
[2023-03-11 20:17:59] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 759 ms to find 0 implicit places.
[2023-03-11 20:17:59] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 20:17:59] [INFO ] Invariant cache hit.
[2023-03-11 20:17:59] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 158/300 places, 139/281 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1009 ms. Remains : 158/300 places, 139/281 transitions.
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LT s29 1), p0:(GEQ s43 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1026 reset in 292 ms.
Product exploration explored 100000 steps with 1085 reset in 344 ms.
Computed a total of 158 stabilizing places and 139 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 158 transition count 139
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 p0)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 3 factoid took 349 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-15-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-15-LTLFireability-06 finished in 2228 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (!p1&&G(p2))))'
Support contains 4 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 281/281 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 294 transition count 275
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 294 transition count 275
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 289 transition count 270
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 289 transition count 270
Applied a total of 22 rules in 23 ms. Remains 289 /300 variables (removed 11) and now considering 270/281 (removed 11) transitions.
// Phase 1: matrix 270 rows 289 cols
[2023-03-11 20:18:00] [INFO ] Computed 19 place invariants in 4 ms
[2023-03-11 20:18:01] [INFO ] Implicit Places using invariants in 310 ms returned []
[2023-03-11 20:18:01] [INFO ] Invariant cache hit.
[2023-03-11 20:18:02] [INFO ] Implicit Places using invariants and state equation in 929 ms returned []
Implicit Place search using SMT with State Equation took 1250 ms to find 0 implicit places.
[2023-03-11 20:18:02] [INFO ] Invariant cache hit.
[2023-03-11 20:18:02] [INFO ] Dead Transitions using invariants and state equation in 369 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 289/300 places, 270/281 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1644 ms. Remains : 289/300 places, 270/281 transitions.
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p2) p1), (NOT p0), (NOT p2), true, (AND (NOT p2) p0)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(OR p1 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(OR p1 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 3}, { cond=(AND p2 p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s9 1) (GEQ s203 1)), p2:(LT s59 1), p0:(GEQ s37 1)], nbAcceptance=1, 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 24999 reset in 464 ms.
Product exploration explored 100000 steps with 24931 reset in 423 ms.
Computed a total of 289 stabilizing places and 270 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 289 transition count 270
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 (NOT p1) p2 (NOT p0)), (X (NOT (OR p1 (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT p0)), (X (NOT (AND (NOT p2) p0))), (X p2), (X (AND p2 (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (OR p1 (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p2)), true, (X (X (NOT (AND p2 p0)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (G (NOT p1))), (F (G p2)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 1509 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p2) p1), (AND p2 (NOT p0) (NOT p1)), (NOT p2), true, (AND (NOT p2) p0)]
Finished random walk after 1220 steps, including 4 resets, run visited all 9 properties in 62 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (NOT (OR p1 (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT p0)), (X (NOT (AND (NOT p2) p0))), (X p2), (X (AND p2 (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (OR p1 (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p2)), true, (X (X (NOT (AND p2 p0)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (G (NOT p1))), (F (G p2)), (F (G (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p2) p0)), (F (NOT (AND p2 (NOT p0) (NOT p1)))), (F (AND (NOT p2) (NOT p0))), (F (NOT p2)), (F (OR (AND (NOT p2) p0) (AND p0 p1))), (F (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) p1))), (F (NOT (AND p2 (NOT p1)))), (F (AND p2 p0)), (F (NOT (AND p2 (NOT p0))))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p2) (NOT p0)))
Knowledge based reduction with 20 factoid took 543 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-15-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-15-LTLFireability-07 finished in 5297 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0) U p1)||F(p2))))'
Support contains 4 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 281/281 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 293 transition count 274
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 293 transition count 274
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 287 transition count 268
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 287 transition count 268
Applied a total of 26 rules in 21 ms. Remains 287 /300 variables (removed 13) and now considering 268/281 (removed 13) transitions.
// Phase 1: matrix 268 rows 287 cols
[2023-03-11 20:18:06] [INFO ] Computed 19 place invariants in 3 ms
[2023-03-11 20:18:06] [INFO ] Implicit Places using invariants in 290 ms returned []
[2023-03-11 20:18:06] [INFO ] Invariant cache hit.
[2023-03-11 20:18:07] [INFO ] Implicit Places using invariants and state equation in 870 ms returned []
Implicit Place search using SMT with State Equation took 1168 ms to find 0 implicit places.
[2023-03-11 20:18:07] [INFO ] Invariant cache hit.
[2023-03-11 20:18:07] [INFO ] Dead Transitions using invariants and state equation in 352 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 287/300 places, 268/281 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1542 ms. Remains : 287/300 places, 268/281 transitions.
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s240 1)), p0:(GEQ s73 1), p2:(AND (GEQ s1 1) (GEQ s285 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 341 reset in 296 ms.
Product exploration explored 100000 steps with 341 reset in 342 ms.
Computed a total of 287 stabilizing places and 268 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 287 transition count 268
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 (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 831 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p2), (NOT p2)]
Finished random walk after 294 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=98 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 11 factoid took 610 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p2)]
[2023-03-11 20:18:10] [INFO ] Invariant cache hit.
[2023-03-11 20:18:10] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 46 ms returned sat
[2023-03-11 20:18:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 20:18:12] [INFO ] [Real]Absence check using state equation in 1931 ms returned sat
[2023-03-11 20:18:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 20:18:12] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 35 ms returned sat
[2023-03-11 20:18:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 20:18:13] [INFO ] [Nat]Absence check using state equation in 894 ms returned sat
[2023-03-11 20:18:13] [INFO ] Computed and/alt/rep : 170/542/170 causal constraints (skipped 83 transitions) in 30 ms.
[2023-03-11 20:18:17] [INFO ] Added : 149 causal constraints over 30 iterations in 3884 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 2 out of 287 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 287/287 places, 268/268 transitions.
Reduce places removed 14 places and 14 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 273 transition count 149
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 210 place count 168 transition count 149
Applied a total of 210 rules in 19 ms. Remains 168 /287 variables (removed 119) and now considering 149/268 (removed 119) transitions.
// Phase 1: matrix 149 rows 168 cols
[2023-03-11 20:18:17] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-11 20:18:17] [INFO ] Implicit Places using invariants in 279 ms returned []
[2023-03-11 20:18:17] [INFO ] Invariant cache hit.
[2023-03-11 20:18:18] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 765 ms to find 0 implicit places.
[2023-03-11 20:18:18] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 20:18:18] [INFO ] Invariant cache hit.
[2023-03-11 20:18:18] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 168/287 places, 149/268 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1040 ms. Remains : 168/287 places, 149/268 transitions.
Computed a total of 168 stabilizing places and 149 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 168 transition count 149
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 : [(NOT p2), (X (NOT p2)), (X (X (NOT p2))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 209 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p2)]
Finished random walk after 165 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=82 )
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2))), (F (G (NOT p2)))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 4 factoid took 234 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p2)]
[2023-03-11 20:18:19] [INFO ] Invariant cache hit.
[2023-03-11 20:18:19] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 36 ms returned sat
[2023-03-11 20:18:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 20:18:20] [INFO ] [Real]Absence check using state equation in 1090 ms returned sat
[2023-03-11 20:18:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 20:18:21] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 40 ms returned sat
[2023-03-11 20:18:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 20:18:22] [INFO ] [Nat]Absence check using state equation in 1026 ms returned sat
[2023-03-11 20:18:22] [INFO ] Computed and/alt/rep : 111/117/111 causal constraints (skipped 11 transitions) in 10 ms.
[2023-03-11 20:18:23] [INFO ] Added : 103 causal constraints over 21 iterations in 948 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 55 ms :[(NOT p2)]
Product exploration explored 100000 steps with 621 reset in 258 ms.
Product exploration explored 100000 steps with 621 reset in 298 ms.
Built C files in :
/tmp/ltsmin11256181346776414838
[2023-03-11 20:18:23] [INFO ] Computing symmetric may disable matrix : 149 transitions.
[2023-03-11 20:18:23] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 20:18:23] [INFO ] Computing symmetric may enable matrix : 149 transitions.
[2023-03-11 20:18:23] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 20:18:23] [INFO ] Computing Do-Not-Accords matrix : 149 transitions.
[2023-03-11 20:18:23] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 20:18:23] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11256181346776414838
Running compilation step : cd /tmp/ltsmin11256181346776414838;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 693 ms.
Running link step : cd /tmp/ltsmin11256181346776414838;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin11256181346776414838;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased46774378757671941.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 168 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 149/149 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 168 transition count 147
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 166 transition count 147
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 165 transition count 146
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 165 transition count 146
Applied a total of 6 rules in 13 ms. Remains 165 /168 variables (removed 3) and now considering 146/149 (removed 3) transitions.
// Phase 1: matrix 146 rows 165 cols
[2023-03-11 20:18:38] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-11 20:18:38] [INFO ] Implicit Places using invariants in 161 ms returned []
[2023-03-11 20:18:38] [INFO ] Invariant cache hit.
[2023-03-11 20:18:39] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 621 ms to find 0 implicit places.
[2023-03-11 20:18:39] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 20:18:39] [INFO ] Invariant cache hit.
[2023-03-11 20:18:39] [INFO ] Dead Transitions using invariants and state equation in 237 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 165/168 places, 146/149 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 883 ms. Remains : 165/168 places, 146/149 transitions.
Built C files in :
/tmp/ltsmin959011273674987093
[2023-03-11 20:18:39] [INFO ] Computing symmetric may disable matrix : 146 transitions.
[2023-03-11 20:18:39] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 20:18:39] [INFO ] Computing symmetric may enable matrix : 146 transitions.
[2023-03-11 20:18:39] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 20:18:39] [INFO ] Computing Do-Not-Accords matrix : 146 transitions.
[2023-03-11 20:18:39] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 20:18:39] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin959011273674987093
Running compilation step : cd /tmp/ltsmin959011273674987093;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 662 ms.
Running link step : cd /tmp/ltsmin959011273674987093;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin959011273674987093;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8238083411436527273.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-11 20:18:54] [INFO ] Flatten gal took : 9 ms
[2023-03-11 20:18:54] [INFO ] Flatten gal took : 8 ms
[2023-03-11 20:18:54] [INFO ] Time to serialize gal into /tmp/LTL5534680036698161519.gal : 2 ms
[2023-03-11 20:18:54] [INFO ] Time to serialize properties into /tmp/LTL15168671526765458243.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5534680036698161519.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10444358314162085931.hoa' '-atoms' '/tmp/LTL15168671526765458243.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15168671526765458243.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10444358314162085931.hoa
Reverse transition relation is NOT exact ! Due to transitions t0, t15.t16, t17.t18, t20, t23.t24, t27.t28, t31.t32, t37.t38, t41.t42, t47.t48, t53.t54, t59...314
Computing Next relation with stutter on 1.09863e+11 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
805 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,8.07944,232336,1,0,950,1.1931e+06,318,627,4605,1.05842e+06,1889
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA HirschbergSinclair-PT-15-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property HirschbergSinclair-PT-15-LTLFireability-09 finished in 58090 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(X(F(G((G(p1) U p1)))))&&X(p1)&&p0))))'
Support contains 2 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 281/281 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 292 transition count 273
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 292 transition count 273
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 285 transition count 266
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 285 transition count 266
Applied a total of 30 rules in 13 ms. Remains 285 /300 variables (removed 15) and now considering 266/281 (removed 15) transitions.
// Phase 1: matrix 266 rows 285 cols
[2023-03-11 20:19:04] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-11 20:19:04] [INFO ] Implicit Places using invariants in 181 ms returned []
[2023-03-11 20:19:04] [INFO ] Invariant cache hit.
[2023-03-11 20:19:05] [INFO ] Implicit Places using invariants and state equation in 837 ms returned []
Implicit Place search using SMT with State Equation took 1023 ms to find 0 implicit places.
[2023-03-11 20:19:05] [INFO ] Invariant cache hit.
[2023-03-11 20:19:05] [INFO ] Dead Transitions using invariants and state equation in 342 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 285/300 places, 266/281 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1379 ms. Remains : 285/300 places, 266/281 transitions.
Stuttering acceptance computed with spot in 161 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s21 1) (GEQ s74 1)), p1:(AND (GEQ s21 1) (GEQ s74 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-15-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-15-LTLFireability-11 finished in 1559 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 281/281 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 293 transition count 274
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 293 transition count 274
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 286 transition count 267
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 286 transition count 267
Applied a total of 28 rules in 20 ms. Remains 286 /300 variables (removed 14) and now considering 267/281 (removed 14) transitions.
// Phase 1: matrix 267 rows 286 cols
[2023-03-11 20:19:05] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-11 20:19:05] [INFO ] Implicit Places using invariants in 268 ms returned []
[2023-03-11 20:19:05] [INFO ] Invariant cache hit.
[2023-03-11 20:19:06] [INFO ] Implicit Places using invariants and state equation in 977 ms returned []
Implicit Place search using SMT with State Equation took 1247 ms to find 0 implicit places.
[2023-03-11 20:19:06] [INFO ] Invariant cache hit.
[2023-03-11 20:19:07] [INFO ] Dead Transitions using invariants and state equation in 358 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 286/300 places, 267/281 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1626 ms. Remains : 286/300 places, 267/281 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s23 1) (LT s72 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-15-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-15-LTLFireability-12 finished in 1756 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||F(p1)))))'
Support contains 3 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 281/281 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 293 transition count 274
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 293 transition count 274
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 287 transition count 268
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 287 transition count 268
Applied a total of 26 rules in 21 ms. Remains 287 /300 variables (removed 13) and now considering 268/281 (removed 13) transitions.
// Phase 1: matrix 268 rows 287 cols
[2023-03-11 20:19:07] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-11 20:19:07] [INFO ] Implicit Places using invariants in 294 ms returned []
[2023-03-11 20:19:07] [INFO ] Invariant cache hit.
[2023-03-11 20:19:08] [INFO ] Implicit Places using invariants and state equation in 863 ms returned []
Implicit Place search using SMT with State Equation took 1159 ms to find 0 implicit places.
[2023-03-11 20:19:08] [INFO ] Invariant cache hit.
[2023-03-11 20:19:09] [INFO ] Dead Transitions using invariants and state equation in 389 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 287/300 places, 268/281 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1571 ms. Remains : 287/300 places, 268/281 transitions.
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(OR (LT s13 1) (LT s228 1)), p0:(LT s65 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][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 380 ms.
Product exploration explored 100000 steps with 33333 reset in 379 ms.
Computed a total of 287 stabilizing places and 268 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 287 transition count 268
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), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) (NOT p1)))))
Knowledge based reduction with 4 factoid took 75 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-15-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-15-LTLFireability-13 finished in 2746 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&(p1 U (p2||G(p1))))))))'
Support contains 4 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 281/281 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 292 transition count 273
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 292 transition count 273
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 285 transition count 266
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 285 transition count 266
Applied a total of 30 rules in 14 ms. Remains 285 /300 variables (removed 15) and now considering 266/281 (removed 15) transitions.
// Phase 1: matrix 266 rows 285 cols
[2023-03-11 20:19:10] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-11 20:19:10] [INFO ] Implicit Places using invariants in 173 ms returned []
[2023-03-11 20:19:10] [INFO ] Invariant cache hit.
[2023-03-11 20:19:11] [INFO ] Implicit Places using invariants and state equation in 663 ms returned []
Implicit Place search using SMT with State Equation took 838 ms to find 0 implicit places.
[2023-03-11 20:19:11] [INFO ] Invariant cache hit.
[2023-03-11 20:19:11] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 285/300 places, 266/281 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1071 ms. Remains : 285/300 places, 266/281 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=3 dest: 0}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(OR (LT s23 1) (LT s120 1)), p2:(AND (GEQ s51 1) (LT s149 1)), p1:(LT s149 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 142 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-15-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-15-LTLFireability-14 finished in 1221 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((F(p1)&&p0))||X((F(p2) U p3))))'
Support contains 6 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 281/281 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 292 transition count 273
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 292 transition count 273
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 285 transition count 266
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 285 transition count 266
Applied a total of 30 rules in 13 ms. Remains 285 /300 variables (removed 15) and now considering 266/281 (removed 15) transitions.
[2023-03-11 20:19:11] [INFO ] Invariant cache hit.
[2023-03-11 20:19:11] [INFO ] Implicit Places using invariants in 286 ms returned []
[2023-03-11 20:19:11] [INFO ] Invariant cache hit.
[2023-03-11 20:19:12] [INFO ] Implicit Places using invariants and state equation in 867 ms returned []
Implicit Place search using SMT with State Equation took 1155 ms to find 0 implicit places.
[2023-03-11 20:19:12] [INFO ] Invariant cache hit.
[2023-03-11 20:19:12] [INFO ] Dead Transitions using invariants and state equation in 358 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 285/300 places, 266/281 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1530 ms. Remains : 285/300 places, 266/281 transitions.
Stuttering acceptance computed with spot in 308 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s15 1) (GEQ s224 1) (GEQ s19 1) (GEQ s70 1)), p1:(AND (GEQ s19 1) (GEQ s70 1)), p3:(AND (GEQ s17 1) (GEQ s222 1)), p2:(OR (AND (GEQ s15 1) (G...], 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 413 reset in 365 ms.
Product exploration explored 100000 steps with 413 reset in 406 ms.
Computed a total of 285 stabilizing places and 266 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 285 transition count 266
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 (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2)))), (X (AND (NOT p1) (NOT p3) (NOT p2))), (X (AND (NOT p0) (NOT p3))), (X (AND (NOT p1) (NOT p3))), (X (AND (NOT p0) (NOT p3) (NOT p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p3))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 1374 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 5 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 323 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 33 resets, run finished after 463 ms. (steps per millisecond=21 ) properties (out of 9) seen :6
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 20:19:16] [INFO ] Invariant cache hit.
[2023-03-11 20:19:16] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2)))), (X (AND (NOT p1) (NOT p3) (NOT p2))), (X (AND (NOT p0) (NOT p3))), (X (AND (NOT p1) (NOT p3))), (X (AND (NOT p0) (NOT p3) (NOT p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p3))), (F (G (NOT p2))), (G (NOT (AND p0 (NOT p2) (NOT p3) (NOT p1)))), (G (NOT (AND p0 (NOT p3) (NOT p1)))), (G (NOT (AND p0 (NOT p2) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (F (NOT (AND (NOT p3) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p2) (NOT p3) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 20 factoid took 1519 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 168 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2))]
[2023-03-11 20:19:18] [INFO ] Invariant cache hit.
[2023-03-11 20:19:18] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 52 ms returned sat
[2023-03-11 20:19:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 20:19:19] [INFO ] [Real]Absence check using state equation in 945 ms returned sat
[2023-03-11 20:19:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 20:19:20] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 44 ms returned sat
[2023-03-11 20:19:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 20:19:20] [INFO ] [Nat]Absence check using state equation in 657 ms returned sat
[2023-03-11 20:19:20] [INFO ] Computed and/alt/rep : 176/604/176 causal constraints (skipped 75 transitions) in 22 ms.
[2023-03-11 20:19:22] [INFO ] Added : 154 causal constraints over 31 iterations in 1832 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3))
[2023-03-11 20:19:22] [INFO ] Invariant cache hit.
[2023-03-11 20:19:23] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 58 ms returned sat
[2023-03-11 20:19:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 20:19:24] [INFO ] [Real]Absence check using state equation in 1318 ms returned sat
[2023-03-11 20:19:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 20:19:24] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 48 ms returned sat
[2023-03-11 20:19:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 20:19:25] [INFO ] [Nat]Absence check using state equation in 777 ms returned sat
[2023-03-11 20:19:25] [INFO ] Computed and/alt/rep : 176/604/176 causal constraints (skipped 75 transitions) in 32 ms.
[2023-03-11 20:19:27] [INFO ] Added : 143 causal constraints over 29 iterations in 1703 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 6 out of 285 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 266/266 transitions.
Applied a total of 0 rules in 7 ms. Remains 285 /285 variables (removed 0) and now considering 266/266 (removed 0) transitions.
[2023-03-11 20:19:27] [INFO ] Invariant cache hit.
[2023-03-11 20:19:27] [INFO ] Implicit Places using invariants in 300 ms returned []
[2023-03-11 20:19:27] [INFO ] Invariant cache hit.
[2023-03-11 20:19:28] [INFO ] Implicit Places using invariants and state equation in 860 ms returned []
Implicit Place search using SMT with State Equation took 1163 ms to find 0 implicit places.
[2023-03-11 20:19:28] [INFO ] Invariant cache hit.
[2023-03-11 20:19:28] [INFO ] Dead Transitions using invariants and state equation in 378 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1550 ms. Remains : 285/285 places, 266/266 transitions.
Computed a total of 285 stabilizing places and 266 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 285 transition count 266
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 (NOT p0) (NOT p3) (NOT p2)), (X (AND (NOT p0) (NOT p2) (NOT p3))), (X (AND (NOT p0) (NOT p3))), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (AND (NOT p0) (NOT p2)))), (F (G (NOT p0))), (F (G (NOT p3))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 572 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2))]
Finished random walk after 244 steps, including 0 resets, run visited all 3 properties in 12 ms. (steps per millisecond=20 )
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p2)), (X (AND (NOT p0) (NOT p2) (NOT p3))), (X (AND (NOT p0) (NOT p3))), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (AND (NOT p0) (NOT p2)))), (F (G (NOT p0))), (F (G (NOT p3))), (F (G (NOT p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p3))))]
Knowledge based reduction with 10 factoid took 674 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 173 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2))]
[2023-03-11 20:19:30] [INFO ] Invariant cache hit.
[2023-03-11 20:19:31] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 52 ms returned sat
[2023-03-11 20:19:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 20:19:32] [INFO ] [Real]Absence check using state equation in 1097 ms returned sat
[2023-03-11 20:19:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 20:19:32] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 36 ms returned sat
[2023-03-11 20:19:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 20:19:33] [INFO ] [Nat]Absence check using state equation in 780 ms returned sat
[2023-03-11 20:19:33] [INFO ] Computed and/alt/rep : 176/604/176 causal constraints (skipped 75 transitions) in 21 ms.
[2023-03-11 20:19:34] [INFO ] Added : 154 causal constraints over 31 iterations in 1715 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3))
[2023-03-11 20:19:34] [INFO ] Invariant cache hit.
[2023-03-11 20:19:35] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 57 ms returned sat
[2023-03-11 20:19:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 20:19:36] [INFO ] [Real]Absence check using state equation in 1202 ms returned sat
[2023-03-11 20:19:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 20:19:36] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 30 ms returned sat
[2023-03-11 20:19:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 20:19:37] [INFO ] [Nat]Absence check using state equation in 766 ms returned sat
[2023-03-11 20:19:37] [INFO ] Computed and/alt/rep : 176/604/176 causal constraints (skipped 75 transitions) in 33 ms.
[2023-03-11 20:19:39] [INFO ] Added : 143 causal constraints over 29 iterations in 1844 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 170 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 414 reset in 350 ms.
Product exploration explored 100000 steps with 413 reset in 253 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 117 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2))]
Support contains 6 out of 285 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 285/285 places, 266/266 transitions.
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 97 rules applied. Total rules applied 97 place count 285 transition count 266
Deduced a syphon composed of 97 places in 0 ms
Applied a total of 97 rules in 17 ms. Remains 285 /285 variables (removed 0) and now considering 266/266 (removed 0) transitions.
[2023-03-11 20:19:40] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 266 rows 285 cols
[2023-03-11 20:19:40] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-11 20:19:40] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 285/285 places, 266/266 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 266 ms. Remains : 285/285 places, 266/266 transitions.
Built C files in :
/tmp/ltsmin13481904799111689984
[2023-03-11 20:19:40] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13481904799111689984
Running compilation step : cd /tmp/ltsmin13481904799111689984;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 584 ms.
Running link step : cd /tmp/ltsmin13481904799111689984;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin13481904799111689984;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16563756619250669190.hoa' '--buchi-type=spotba'
LTSmin run took 823 ms.
FORMULA HirschbergSinclair-PT-15-LTLFireability-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-15-LTLFireability-15 finished in 30713 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||F(p1)))))'
Found a Lengthening insensitive property : HirschbergSinclair-PT-15-LTLFireability-03
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 300 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 300/300 places, 281/281 transitions.
Reduce places removed 15 places and 15 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 285 transition count 146
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 165 transition count 146
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 248 place count 157 transition count 138
Iterating global reduction 2 with 8 rules applied. Total rules applied 256 place count 157 transition count 138
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 257 place count 157 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 258 place count 156 transition count 137
Applied a total of 258 rules in 16 ms. Remains 156 /300 variables (removed 144) and now considering 137/281 (removed 144) transitions.
// Phase 1: matrix 137 rows 156 cols
[2023-03-11 20:19:42] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-11 20:19:42] [INFO ] Implicit Places using invariants in 186 ms returned []
[2023-03-11 20:19:42] [INFO ] Invariant cache hit.
[2023-03-11 20:19:43] [INFO ] Implicit Places using invariants and state equation in 465 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
[2023-03-11 20:19:43] [INFO ] Invariant cache hit.
[2023-03-11 20:19:43] [INFO ] Dead Transitions using invariants and state equation in 226 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 156/300 places, 137/281 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 904 ms. Remains : 156/300 places, 137/281 transitions.
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s59 1), p1:(GEQ s80 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 972 reset in 285 ms.
Product exploration explored 100000 steps with 958 reset in 326 ms.
Computed a total of 156 stabilizing places and 137 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 156 transition count 137
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 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 479 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 90 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=30 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F p1)]
Knowledge based reduction with 7 factoid took 445 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 137/137 transitions.
Applied a total of 0 rules in 2 ms. Remains 156 /156 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-11 20:19:45] [INFO ] Invariant cache hit.
[2023-03-11 20:19:45] [INFO ] Implicit Places using invariants in 261 ms returned []
[2023-03-11 20:19:45] [INFO ] Invariant cache hit.
[2023-03-11 20:19:46] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 730 ms to find 0 implicit places.
[2023-03-11 20:19:46] [INFO ] Invariant cache hit.
[2023-03-11 20:19:46] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 959 ms. Remains : 156/156 places, 137/137 transitions.
Computed a total of 156 stabilizing places and 137 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 156 transition count 137
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 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 385 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 88 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=44 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F p1)]
Knowledge based reduction with 7 factoid took 445 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 978 reset in 288 ms.
Product exploration explored 100000 steps with 962 reset in 296 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 137/137 transitions.
Applied a total of 0 rules in 11 ms. Remains 156 /156 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-11 20:19:48] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 20:19:48] [INFO ] Invariant cache hit.
[2023-03-11 20:19:48] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 160 ms. Remains : 156/156 places, 137/137 transitions.
Built C files in :
/tmp/ltsmin9318316518911045349
[2023-03-11 20:19:48] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9318316518911045349
Running compilation step : cd /tmp/ltsmin9318316518911045349;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 434 ms.
Running link step : cd /tmp/ltsmin9318316518911045349;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin9318316518911045349;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12248314109243601366.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 137/137 transitions.
Applied a total of 0 rules in 6 ms. Remains 156 /156 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-11 20:20:03] [INFO ] Invariant cache hit.
[2023-03-11 20:20:04] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-03-11 20:20:04] [INFO ] Invariant cache hit.
[2023-03-11 20:20:04] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
[2023-03-11 20:20:04] [INFO ] Invariant cache hit.
[2023-03-11 20:20:04] [INFO ] Dead Transitions using invariants and state equation in 212 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 662 ms. Remains : 156/156 places, 137/137 transitions.
Built C files in :
/tmp/ltsmin3229061972407803310
[2023-03-11 20:20:04] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3229061972407803310
Running compilation step : cd /tmp/ltsmin3229061972407803310;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 547 ms.
Running link step : cd /tmp/ltsmin3229061972407803310;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin3229061972407803310;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4176894588551948992.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-11 20:20:19] [INFO ] Flatten gal took : 12 ms
[2023-03-11 20:20:19] [INFO ] Flatten gal took : 8 ms
[2023-03-11 20:20:19] [INFO ] Time to serialize gal into /tmp/LTL13512930882698237196.gal : 2 ms
[2023-03-11 20:20:19] [INFO ] Time to serialize properties into /tmp/LTL13692568018887500312.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13512930882698237196.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5328902965076978782.hoa' '-atoms' '/tmp/LTL13692568018887500312.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13692568018887500312.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5328902965076978782.hoa
Reverse transition relation is NOT exact ! Due to transitions t17.t18, t23.t24, t27.t28, t31.t32, t37.t38, t41.t42, t47.t48, t53.t54, t59.t60, t63.t64, t69...301
Computing Next relation with stutter on 1.09863e+11 deadlock states
203 unique states visited
0 strongly connected components in search stack
217 transitions explored
153 items max in DFS search stack
1256 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,12.5871,340368,1,0,6563,1.365e+06,309,4566,4558,1.92666e+06,15014
no accepting run found
Formula 0 is TRUE no accepting run found.
Treatment of property HirschbergSinclair-PT-15-LTLFireability-03 finished in 52355 ms.
Length sensitive decision was in the wrong direction : Lengthening insensitive + true
[2023-03-11 20:20:34] [INFO ] Flatten gal took : 16 ms
Using solver Z3 to compute partial order matrices.
[2023-03-11 20:20:34] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin5806212395857886469
[2023-03-11 20:20:34] [INFO ] Computing symmetric may disable matrix : 281 transitions.
[2023-03-11 20:20:34] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 20:20:34] [INFO ] Computing symmetric may enable matrix : 281 transitions.
[2023-03-11 20:20:34] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 20:20:34] [INFO ] Flatten gal took : 16 ms
[2023-03-11 20:20:34] [INFO ] Computing Do-Not-Accords matrix : 281 transitions.
[2023-03-11 20:20:34] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 20:20:34] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5806212395857886469
Running compilation step : cd /tmp/ltsmin5806212395857886469;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph9258093674765508962.txt' '-o' '/tmp/graph9258093674765508962.bin' '-w' '/tmp/graph9258093674765508962.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9258093674765508962.bin' '-l' '-1' '-v' '-w' '/tmp/graph9258093674765508962.weights' '-q' '0' '-e' '0.001'
[2023-03-11 20:20:34] [INFO ] Decomposing Gal with order
[2023-03-11 20:20:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 20:20:34] [INFO ] Removed a total of 27 redundant transitions.
[2023-03-11 20:20:34] [INFO ] Flatten gal took : 80 ms
[2023-03-11 20:20:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 10 ms.
[2023-03-11 20:20:34] [INFO ] Time to serialize gal into /tmp/LTLFireability2327632197245620213.gal : 17 ms
[2023-03-11 20:20:34] [INFO ] Time to serialize properties into /tmp/LTLFireability6934571220247999640.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2327632197245620213.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6934571220247999640.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G(("(i5.u17.rcv_right_election_15_2_1_14<1)")||(F("(i4.u11.rcv_right_election_15_3_3_12>=1)"))))))
Formula 0 simplified : XF(!"(i5.u17.rcv_right_election_15_2_1_14<1)" & G!"(i4.u11.rcv_right_election_15_3_3_12>=1)")
Compilation finished in 1021 ms.
Running link step : cd /tmp/ltsmin5806212395857886469;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin5806212395857886469;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](((LTLAPp0==true)||<>((LTLAPp1==true)))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t5, t6, t7, t8, t9, t10, t12, t13, t14, t26, t235, t280, i0.u1.t18, i0.u1.t22...548
Computing Next relation with stutter on 4.72392e+11 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.009: LTL layer: formula: X([](((LTLAPp0==true)||<>((LTLAPp1==true)))))
pins2lts-mc-linux64( 5/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.009: "X([](((LTLAPp0==true)||<>((LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.010: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.032: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.036: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.042: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.045: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.052: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.059: buchi has 3 states
pins2lts-mc-linux64( 7/ 8), 0.058: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.070: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.148: DFS-FIFO for weak LTL, using special progress label 284
pins2lts-mc-linux64( 0/ 8), 0.148: There are 285 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.148: State length is 301, there are 285 groups
pins2lts-mc-linux64( 0/ 8), 0.148: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.148: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.148: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.148: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.521: ~1 levels ~960 states ~12776 transitions
pins2lts-mc-linux64( 1/ 8), 0.767: ~1 levels ~1920 states ~25024 transitions
pins2lts-mc-linux64( 1/ 8), 1.399: ~1 levels ~3840 states ~51192 transitions
pins2lts-mc-linux64( 3/ 8), 1.982: ~1 levels ~7680 states ~100376 transitions
pins2lts-mc-linux64( 6/ 8), 2.980: ~1 levels ~15360 states ~209872 transitions
pins2lts-mc-linux64( 3/ 8), 4.422: ~1 levels ~30720 states ~406368 transitions
pins2lts-mc-linux64( 2/ 8), 7.981: ~1 levels ~61440 states ~829280 transitions
pins2lts-mc-linux64( 2/ 8), 14.176: ~1 levels ~122880 states ~1684816 transitions
pins2lts-mc-linux64( 6/ 8), 24.999: ~1 levels ~245760 states ~3391936 transitions
pins2lts-mc-linux64( 1/ 8), 39.977: ~1 levels ~491520 states ~6800240 transitions
pins2lts-mc-linux64( 1/ 8), 57.917: ~1 levels ~983040 states ~13741592 transitions
pins2lts-mc-linux64( 1/ 8), 83.291: ~1 levels ~1966080 states ~27608560 transitions
pins2lts-mc-linux64( 1/ 8), 132.230: ~1 levels ~3932160 states ~55777712 transitions
pins2lts-mc-linux64( 1/ 8), 238.749: ~1 levels ~7864320 states ~113341176 transitions
pins2lts-mc-linux64( 4/ 8), 325.346: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 325.715:
pins2lts-mc-linux64( 0/ 8), 325.715: mean standard work distribution: 7.1% (states) 7.0% (transitions)
pins2lts-mc-linux64( 0/ 8), 325.715:
pins2lts-mc-linux64( 0/ 8), 325.715: Explored 9957616 states 145010826 transitions, fanout: 14.563
pins2lts-mc-linux64( 0/ 8), 325.715: Total exploration time 325.540 sec (325.190 sec minimum, 325.390 sec on average)
pins2lts-mc-linux64( 0/ 8), 325.715: States per second: 30588, Transitions per second: 445447
pins2lts-mc-linux64( 0/ 8), 325.715:
pins2lts-mc-linux64( 0/ 8), 325.715: Progress states detected: 24646850
pins2lts-mc-linux64( 0/ 8), 325.715: Redundant explorations: -59.5996
pins2lts-mc-linux64( 0/ 8), 325.715:
pins2lts-mc-linux64( 0/ 8), 325.715: Queue width: 8B, total height: 26669680, memory: 203.47MB
pins2lts-mc-linux64( 0/ 8), 325.715: Tree memory: 444.0MB, 18.9 B/state, compr.: 1.6%
pins2lts-mc-linux64( 0/ 8), 325.715: Tree fill ratio (roots/leafs): 18.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 325.715: Stored 283 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 325.715: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 325.715: Est. total memory use: 647.5MB (~1227.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5806212395857886469;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](((LTLAPp0==true)||<>((LTLAPp1==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5806212395857886469;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](((LTLAPp0==true)||<>((LTLAPp1==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-11 20:42:19] [INFO ] Flatten gal took : 19 ms
[2023-03-11 20:42:19] [INFO ] Time to serialize gal into /tmp/LTLFireability15986014413969687152.gal : 2 ms
[2023-03-11 20:42:19] [INFO ] Time to serialize properties into /tmp/LTLFireability13742970720753394294.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15986014413969687152.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13742970720753394294.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 1 LTL properties
Checking formula 0 : !((X(G(("(rcv_right_election_15_2_1_14<1)")||(F("(rcv_right_election_15_3_3_12>=1)"))))))
Formula 0 simplified : XF(!"(rcv_right_election_15_2_1_14<1)" & G!"(rcv_right_election_15_3_3_12>=1)")
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t16, t18, t22, t24, t26, t28...380
Computing Next relation with stutter on 4.72392e+11 deadlock states
406 unique states visited
0 strongly connected components in search stack
437 transitions explored
297 items max in DFS search stack
85766 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,857.696,3922880,1,0,10842,1.59174e+07,18,6856,4044,2.41476e+07,22213
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA HirschbergSinclair-PT-15-LTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Total runtime 2502248 ms.
BK_STOP 1678568224223
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HirschbergSinclair-PT-15"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is HirschbergSinclair-PT-15, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r197-smll-167840344200444"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HirschbergSinclair-PT-15.tgz
mv HirschbergSinclair-PT-15 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;