About the Execution of ITS-Tools for DNAwalker-PT-16redondantChoiceR
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6339.327 | 2405893.00 | 5647494.00 | 11081.50 | TFTTTTTFFTTTFFTF | 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.r101-tall-167814476100995.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 DNAwalker-PT-16redondantChoiceR, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r101-tall-167814476100995
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 8.4K Feb 25 13:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 13:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 13:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 13:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Feb 25 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 13:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 25 13:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 19 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 211K 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 DNAwalker-PT-16redondantChoiceR-LTLCardinality-00
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLCardinality-01
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLCardinality-02
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLCardinality-03
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLCardinality-04
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLCardinality-05
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLCardinality-06
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLCardinality-07
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLCardinality-08
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLCardinality-09
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLCardinality-10
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLCardinality-11
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLCardinality-12
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLCardinality-13
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLCardinality-14
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678335298971
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DNAwalker-PT-16redondantChoiceR
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-09 04:15:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 04:15:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 04:15:00] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2023-03-09 04:15:00] [INFO ] Transformed 43 places.
[2023-03-09 04:15:00] [INFO ] Transformed 490 transitions.
[2023-03-09 04:15:00] [INFO ] Parsed PT model containing 43 places and 490 transitions and 1438 arcs in 124 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 23 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2023-03-09 04:15:00] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
// Phase 1: matrix 489 rows 43 cols
[2023-03-09 04:15:01] [INFO ] Computed 0 place invariants in 13 ms
[2023-03-09 04:15:01] [INFO ] Dead Transitions using invariants and state equation in 278 ms found 0 transitions.
[2023-03-09 04:15:01] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:15:01] [INFO ] Invariant cache hit.
[2023-03-09 04:15:01] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-09 04:15:01] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:15:01] [INFO ] Invariant cache hit.
[2023-03-09 04:15:01] [INFO ] State equation strengthened by 161 read => feed constraints.
[2023-03-09 04:15:01] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
[2023-03-09 04:15:01] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:15:01] [INFO ] Invariant cache hit.
[2023-03-09 04:15:01] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1179 ms. Remains : 43/43 places, 490/490 transitions.
Support contains 30 out of 43 places after structural reductions.
[2023-03-09 04:15:02] [INFO ] Flatten gal took : 50 ms
[2023-03-09 04:15:02] [INFO ] Flatten gal took : 23 ms
[2023-03-09 04:15:02] [INFO ] Input system was already deterministic with 490 transitions.
Support contains 28 out of 43 places (down from 30) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 382 resets, run finished after 433 ms. (steps per millisecond=23 ) properties (out of 27) seen :22
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-09 04:15:02] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:15:02] [INFO ] Invariant cache hit.
[2023-03-09 04:15:03] [INFO ] After 283ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:631)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 04:15:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 04:15:28] [INFO ] After 25021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 43 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 43/43 places, 490/490 transitions.
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 43 transition count 478
Reduce places removed 9 places and 9 transitions.
Iterating global reduction 1 with 9 rules applied. Total rules applied 21 place count 34 transition count 469
Applied a total of 21 rules in 37 ms. Remains 34 /43 variables (removed 9) and now considering 469/490 (removed 21) transitions.
// Phase 1: matrix 469 rows 34 cols
[2023-03-09 04:15:28] [INFO ] Computed 0 place invariants in 8 ms
[2023-03-09 04:15:28] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 34/43 places, 469/490 transitions.
Incomplete random walk after 10000 steps, including 505 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 514548 steps, run timeout after 3001 ms. (steps per millisecond=171 ) properties seen :{}
Probabilistic random walk after 514548 steps, saw 133917 distinct states, run finished after 3002 ms. (steps per millisecond=171 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-09 04:15:31] [INFO ] Invariant cache hit.
[2023-03-09 04:15:31] [INFO ] After 205ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 04:15:56] [INFO ] After 24874ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 34 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 469/469 transitions.
Graph (complete) has 469 edges and 34 vertex of which 33 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 33 transition count 463
Applied a total of 7 rules in 20 ms. Remains 33 /34 variables (removed 1) and now considering 463/469 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 33/34 places, 463/469 transitions.
Incomplete random walk after 10000 steps, including 423 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 768696 steps, run timeout after 3001 ms. (steps per millisecond=256 ) properties seen :{}
Probabilistic random walk after 768696 steps, saw 194288 distinct states, run finished after 3001 ms. (steps per millisecond=256 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 463 rows 33 cols
[2023-03-09 04:15:59] [INFO ] Computed 0 place invariants in 5 ms
[2023-03-09 04:16:00] [INFO ] After 159ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 04:16:18] [INFO ] After 18137ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 463/463 transitions.
Applied a total of 0 rules in 9 ms. Remains 33 /33 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 33/33 places, 463/463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 463/463 transitions.
Applied a total of 0 rules in 6 ms. Remains 33 /33 variables (removed 0) and now considering 463/463 (removed 0) transitions.
[2023-03-09 04:16:18] [INFO ] Invariant cache hit.
[2023-03-09 04:16:18] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-09 04:16:18] [INFO ] Invariant cache hit.
[2023-03-09 04:16:18] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 04:16:18] [INFO ] Implicit Places using invariants and state equation in 609 ms returned [32]
Discarding 1 places :
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Implicit Place search using SMT with State Equation took 674 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 32/33 places, 458/463 transitions.
Applied a total of 0 rules in 29 ms. Remains 32 /32 variables (removed 0) and now considering 458/458 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 710 ms. Remains : 32/33 places, 458/463 transitions.
Incomplete random walk after 10000 steps, including 360 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 791474 steps, run timeout after 3001 ms. (steps per millisecond=263 ) properties seen :{}
Probabilistic random walk after 791474 steps, saw 200383 distinct states, run finished after 3001 ms. (steps per millisecond=263 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 458 rows 32 cols
[2023-03-09 04:16:22] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-09 04:16:22] [INFO ] After 176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 04:16:39] [INFO ] After 17736ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32/32 places, 458/458 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32 transition count 457
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 31 transition count 456
Applied a total of 2 rules in 14 ms. Remains 31 /32 variables (removed 1) and now considering 456/458 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 31/32 places, 456/458 transitions.
Incomplete random walk after 10000 steps, including 361 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1077599 steps, run timeout after 3001 ms. (steps per millisecond=359 ) properties seen :{}
Probabilistic random walk after 1077599 steps, saw 295938 distinct states, run finished after 3001 ms. (steps per millisecond=359 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 456 rows 31 cols
[2023-03-09 04:16:43] [INFO ] Computed 0 place invariants in 4 ms
[2023-03-09 04:16:43] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 04:16:53] [INFO ] After 10693ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 31 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 31/31 places, 456/456 transitions.
Applied a total of 0 rules in 10 ms. Remains 31 /31 variables (removed 0) and now considering 456/456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 31/31 places, 456/456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 31/31 places, 456/456 transitions.
Applied a total of 0 rules in 5 ms. Remains 31 /31 variables (removed 0) and now considering 456/456 (removed 0) transitions.
[2023-03-09 04:16:53] [INFO ] Invariant cache hit.
[2023-03-09 04:16:53] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-09 04:16:53] [INFO ] Invariant cache hit.
[2023-03-09 04:16:54] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
[2023-03-09 04:16:54] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-09 04:16:54] [INFO ] Invariant cache hit.
[2023-03-09 04:16:54] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 700 ms. Remains : 31/31 places, 456/456 transitions.
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 11 simplifications.
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 43 stabilizing places and 488 stable transitions
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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&&F(p1)&&X((!p2 U (p3||G(!p2)))))))'
Support contains 5 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 2 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2023-03-09 04:16:54] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
// Phase 1: matrix 489 rows 43 cols
[2023-03-09 04:16:54] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-09 04:16:55] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
[2023-03-09 04:16:55] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:16:55] [INFO ] Invariant cache hit.
[2023-03-09 04:16:55] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-09 04:16:55] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:16:55] [INFO ] Invariant cache hit.
[2023-03-09 04:16:55] [INFO ] State equation strengthened by 161 read => feed constraints.
[2023-03-09 04:16:56] [INFO ] Implicit Places using invariants and state equation in 923 ms returned []
Implicit Place search using SMT with State Equation took 994 ms to find 0 implicit places.
[2023-03-09 04:16:56] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:16:56] [INFO ] Invariant cache hit.
[2023-03-09 04:16:56] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1284 ms. Remains : 43/43 places, 490/490 transitions.
Stuttering acceptance computed with spot in 269 ms :[(OR (NOT p0) (NOT p1) (AND p2 (NOT p3))), (NOT p1), (AND p2 (NOT p3))]
Running random walk in product with property : DNAwalker-PT-16redondantChoiceR-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p3) p2), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p3) p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GT 2 s42) (AND (GT 1 s5) (GT s15 s2))), p1:(GT 2 s32), p3:(GT 2 s42), p2:(AND (OR (LEQ 1 s5) (LEQ s15 s2)) (LEQ 2 s42))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 332 ms.
Product exploration explored 100000 steps with 50000 reset in 300 ms.
Computed a total of 43 stabilizing places and 488 stable transitions
Computed a total of 43 stabilizing places and 488 stable transitions
Detected a total of 43/43 stabilizing places and 488/490 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND p0 p1 p3 (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X p0), (X p1), (X (NOT (AND p0 (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p3) p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p1 p3 (NOT p2))
Knowledge based reduction with 19 factoid took 1036 ms. Reduced automaton from 3 states, 8 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DNAwalker-PT-16redondantChoiceR-LTLCardinality-00 finished in 3320 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(((X((G(p0)&&p1)) U p1)||F(p2)||p0))))'
Support contains 5 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 18 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2023-03-09 04:16:58] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:16:58] [INFO ] Invariant cache hit.
[2023-03-09 04:16:58] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
[2023-03-09 04:16:58] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:16:58] [INFO ] Invariant cache hit.
[2023-03-09 04:16:58] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-09 04:16:58] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:16:58] [INFO ] Invariant cache hit.
[2023-03-09 04:16:58] [INFO ] State equation strengthened by 161 read => feed constraints.
[2023-03-09 04:16:59] [INFO ] Implicit Places using invariants and state equation in 846 ms returned []
Implicit Place search using SMT with State Equation took 902 ms to find 0 implicit places.
[2023-03-09 04:16:59] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-09 04:16:59] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:16:59] [INFO ] Invariant cache hit.
[2023-03-09 04:16:59] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1230 ms. Remains : 43/43 places, 490/490 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : DNAwalker-PT-16redondantChoiceR-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s34 s3), p1:(LEQ s29 s5), p2:(LEQ s16 s34)], 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 0 reset in 111 ms.
Product exploration explored 100000 steps with 0 reset in 74 ms.
Computed a total of 43 stabilizing places and 488 stable transitions
Computed a total of 43 stabilizing places and 488 stable transitions
Detected a total of 43/43 stabilizing places and 488/490 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))))]
Knowledge based reduction with 7 factoid took 337 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Finished random walk after 2898 steps, including 112 resets, run visited all 2 properties in 16 ms. (steps per millisecond=181 )
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (OR (AND p0 (NOT p2)) (AND (NOT p2) p1)))]
Knowledge based reduction with 7 factoid took 383 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 5 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 6 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2023-03-09 04:17:00] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:17:00] [INFO ] Invariant cache hit.
[2023-03-09 04:17:00] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
[2023-03-09 04:17:00] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:17:00] [INFO ] Invariant cache hit.
[2023-03-09 04:17:00] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-09 04:17:00] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:17:00] [INFO ] Invariant cache hit.
[2023-03-09 04:17:00] [INFO ] State equation strengthened by 161 read => feed constraints.
[2023-03-09 04:17:01] [INFO ] Implicit Places using invariants and state equation in 777 ms returned []
Implicit Place search using SMT with State Equation took 835 ms to find 0 implicit places.
[2023-03-09 04:17:01] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-09 04:17:01] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:17:01] [INFO ] Invariant cache hit.
[2023-03-09 04:17:01] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1162 ms. Remains : 43/43 places, 490/490 transitions.
Computed a total of 43 stabilizing places and 488 stable transitions
Computed a total of 43 stabilizing places and 488 stable transitions
Detected a total of 43/43 stabilizing places and 488/490 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (OR (AND p0 (NOT p2)) (AND (NOT p2) p1)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1)))))]
Knowledge based reduction with 7 factoid took 301 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Finished random walk after 3655 steps, including 141 resets, run visited all 2 properties in 27 ms. (steps per millisecond=135 )
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (OR (AND p0 (NOT p2)) (AND (NOT p2) p1)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))))), (F (AND (NOT p2) (NOT p1) (NOT p0))), (F (OR (AND (NOT p2) p1) (AND (NOT p2) p0)))]
Knowledge based reduction with 7 factoid took 324 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 58 ms.
Product exploration explored 100000 steps with 0 reset in 81 ms.
Built C files in :
/tmp/ltsmin13445522979290521730
[2023-03-09 04:17:03] [INFO ] Computing symmetric may disable matrix : 490 transitions.
[2023-03-09 04:17:03] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 04:17:03] [INFO ] Computing symmetric may enable matrix : 490 transitions.
[2023-03-09 04:17:03] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 04:17:03] [INFO ] Computing Do-Not-Accords matrix : 490 transitions.
[2023-03-09 04:17:03] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 04:17:03] [INFO ] Built C files in 106ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13445522979290521730
Running compilation step : cd /tmp/ltsmin13445522979290521730;'/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 1067 ms.
Running link step : cd /tmp/ltsmin13445522979290521730;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin13445522979290521730;'/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/stateBased26381342639597399.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 26 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2023-03-09 04:17:18] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:17:18] [INFO ] Invariant cache hit.
[2023-03-09 04:17:18] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
[2023-03-09 04:17:18] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:17:18] [INFO ] Invariant cache hit.
[2023-03-09 04:17:18] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-09 04:17:18] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:17:18] [INFO ] Invariant cache hit.
[2023-03-09 04:17:18] [INFO ] State equation strengthened by 161 read => feed constraints.
[2023-03-09 04:17:19] [INFO ] Implicit Places using invariants and state equation in 873 ms returned []
Implicit Place search using SMT with State Equation took 918 ms to find 0 implicit places.
[2023-03-09 04:17:19] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-09 04:17:19] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:17:19] [INFO ] Invariant cache hit.
[2023-03-09 04:17:19] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1238 ms. Remains : 43/43 places, 490/490 transitions.
Built C files in :
/tmp/ltsmin12335787293097637089
[2023-03-09 04:17:19] [INFO ] Computing symmetric may disable matrix : 490 transitions.
[2023-03-09 04:17:19] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 04:17:19] [INFO ] Computing symmetric may enable matrix : 490 transitions.
[2023-03-09 04:17:19] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 04:17:19] [INFO ] Computing Do-Not-Accords matrix : 490 transitions.
[2023-03-09 04:17:19] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 04:17:19] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12335787293097637089
Running compilation step : cd /tmp/ltsmin12335787293097637089;'/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 994 ms.
Running link step : cd /tmp/ltsmin12335787293097637089;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin12335787293097637089;'/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/stateBased4203713974014444165.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-09 04:17:34] [INFO ] Flatten gal took : 20 ms
[2023-03-09 04:17:34] [INFO ] Flatten gal took : 19 ms
[2023-03-09 04:17:34] [INFO ] Time to serialize gal into /tmp/LTL12617649324460053506.gal : 4 ms
[2023-03-09 04:17:34] [INFO ] Time to serialize properties into /tmp/LTL2113830109065346849.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/LTL12617649324460053506.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6926470429669427111.hoa' '-atoms' '/tmp/LTL2113830109065346849.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/LTL2113830109065346849.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6926470429669427111.hoa
Detected timeout of ITS tools.
[2023-03-09 04:17:49] [INFO ] Flatten gal took : 16 ms
[2023-03-09 04:17:49] [INFO ] Flatten gal took : 16 ms
[2023-03-09 04:17:49] [INFO ] Time to serialize gal into /tmp/LTL15860899342989396212.gal : 4 ms
[2023-03-09 04:17:49] [INFO ] Time to serialize properties into /tmp/LTL10371909165556945057.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15860899342989396212.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10371909165556945057.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...277
Read 1 LTL properties
Checking formula 0 : !((F(G((((X((G("(B28<=A4)"))&&("(A24<=B5)")))U("(A24<=B5)"))||(F("(A14<=B28)")))||("(B28<=A4)")))))
Formula 0 simplified : G(F(!"(A24<=B5)" & !"(B28<=A4)" & X(!"(A24<=B5)" | F!"(B28<=A4)")) & FG!"(A14<=B28)")
Detected timeout of ITS tools.
[2023-03-09 04:18:04] [INFO ] Flatten gal took : 16 ms
[2023-03-09 04:18:04] [INFO ] Applying decomposition
[2023-03-09 04:18:04] [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/graph16902319940899557373.txt' '-o' '/tmp/graph16902319940899557373.bin' '-w' '/tmp/graph16902319940899557373.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16902319940899557373.bin' '-l' '-1' '-v' '-w' '/tmp/graph16902319940899557373.weights' '-q' '0' '-e' '0.001'
[2023-03-09 04:18:04] [INFO ] Decomposing Gal with order
[2023-03-09 04:18:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 04:18:04] [INFO ] Removed a total of 864 redundant transitions.
[2023-03-09 04:18:05] [INFO ] Flatten gal took : 57 ms
[2023-03-09 04:18:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2023-03-09 04:18:05] [INFO ] Time to serialize gal into /tmp/LTL8936895834175686960.gal : 2 ms
[2023-03-09 04:18:05] [INFO ] Time to serialize properties into /tmp/LTL12756687744648707493.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/LTL8936895834175686960.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12756687744648707493.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 : !((F(G((((X((G("(gu3.B28<=gu3.A4)"))&&("(gu4.A24<=gu4.B5)")))U("(gu4.A24<=gu4.B5)"))||(F("(gu3.A14<=gu3.B28)")))||("(gu3.B28<=gu3.A4)"...160
Formula 0 simplified : G(F(!"(gu3.B28<=gu3.A4)" & !"(gu4.A24<=gu4.B5)" & X(!"(gu4.A24<=gu4.B5)" | F!"(gu3.B28<=gu3.A4)")) & FG!"(gu3.A14<=gu3.B28)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7807194164864685537
[2023-03-09 04:18:20] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7807194164864685537
Running compilation step : cd /tmp/ltsmin7807194164864685537;'/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 636 ms.
Running link step : cd /tmp/ltsmin7807194164864685537;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin7807194164864685537;'/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))) U (LTLAPp1==true))||<>((LTLAPp2==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DNAwalker-PT-16redondantChoiceR-LTLCardinality-02 finished in 97045 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 5 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2023-03-09 04:18:35] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:18:35] [INFO ] Invariant cache hit.
[2023-03-09 04:18:35] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
[2023-03-09 04:18:35] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:18:35] [INFO ] Invariant cache hit.
[2023-03-09 04:18:35] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-09 04:18:35] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:18:35] [INFO ] Invariant cache hit.
[2023-03-09 04:18:35] [INFO ] State equation strengthened by 161 read => feed constraints.
[2023-03-09 04:18:36] [INFO ] Implicit Places using invariants and state equation in 863 ms returned []
Implicit Place search using SMT with State Equation took 927 ms to find 0 implicit places.
[2023-03-09 04:18:36] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:18:36] [INFO ] Invariant cache hit.
[2023-03-09 04:18:36] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1319 ms. Remains : 43/43 places, 490/490 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DNAwalker-PT-16redondantChoiceR-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s7 s20)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 32 steps with 2 reset in 1 ms.
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-16redondantChoiceR-LTLCardinality-07 finished in 1418 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)||(p1&&F(p2)))))'
Support contains 6 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 2 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2023-03-09 04:18:36] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:18:36] [INFO ] Invariant cache hit.
[2023-03-09 04:18:36] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
[2023-03-09 04:18:36] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:18:36] [INFO ] Invariant cache hit.
[2023-03-09 04:18:36] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-09 04:18:36] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:18:36] [INFO ] Invariant cache hit.
[2023-03-09 04:18:36] [INFO ] State equation strengthened by 161 read => feed constraints.
[2023-03-09 04:18:37] [INFO ] Implicit Places using invariants and state equation in 921 ms returned []
Implicit Place search using SMT with State Equation took 976 ms to find 0 implicit places.
[2023-03-09 04:18:37] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:18:37] [INFO ] Invariant cache hit.
[2023-03-09 04:18:37] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1286 ms. Remains : 43/43 places, 490/490 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DNAwalker-PT-16redondantChoiceR-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT s36 s7), p1:(GT s22 s18), p2:(LEQ s20 s15)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 45 steps with 9 reset in 1 ms.
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-16redondantChoiceR-LTLCardinality-08 finished in 1463 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 14 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2023-03-09 04:18:38] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:18:38] [INFO ] Invariant cache hit.
[2023-03-09 04:18:38] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
[2023-03-09 04:18:38] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:18:38] [INFO ] Invariant cache hit.
[2023-03-09 04:18:38] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-09 04:18:38] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:18:38] [INFO ] Invariant cache hit.
[2023-03-09 04:18:38] [INFO ] State equation strengthened by 161 read => feed constraints.
[2023-03-09 04:18:39] [INFO ] Implicit Places using invariants and state equation in 698 ms returned []
Implicit Place search using SMT with State Equation took 743 ms to find 0 implicit places.
[2023-03-09 04:18:39] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-09 04:18:39] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:18:39] [INFO ] Invariant cache hit.
[2023-03-09 04:18:39] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1139 ms. Remains : 43/43 places, 490/490 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DNAwalker-PT-16redondantChoiceR-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s8 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2 reset in 142 ms.
Product exploration explored 100000 steps with 0 reset in 97 ms.
Computed a total of 43 stabilizing places and 488 stable transitions
Computed a total of 43 stabilizing places and 488 stable transitions
Detected a total of 43/43 stabilizing places and 488/490 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 146 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0)]
Finished random walk after 23 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=23 )
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 182 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 13 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2023-03-09 04:18:40] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:18:40] [INFO ] Invariant cache hit.
[2023-03-09 04:18:40] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
[2023-03-09 04:18:40] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:18:40] [INFO ] Invariant cache hit.
[2023-03-09 04:18:40] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-09 04:18:40] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:18:40] [INFO ] Invariant cache hit.
[2023-03-09 04:18:40] [INFO ] State equation strengthened by 161 read => feed constraints.
[2023-03-09 04:18:41] [INFO ] Implicit Places using invariants and state equation in 675 ms returned []
Implicit Place search using SMT with State Equation took 723 ms to find 0 implicit places.
[2023-03-09 04:18:41] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 04:18:41] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:18:41] [INFO ] Invariant cache hit.
[2023-03-09 04:18:41] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1013 ms. Remains : 43/43 places, 490/490 transitions.
Computed a total of 43 stabilizing places and 488 stable transitions
Computed a total of 43 stabilizing places and 488 stable transitions
Detected a total of 43/43 stabilizing places and 488/490 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 132 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Finished random walk after 28 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=28 )
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 173 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 64 ms.
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 0 ms.
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-16redondantChoiceR-LTLCardinality-12 finished in 3792 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)) U G(p1))))'
Support contains 3 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 2 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2023-03-09 04:18:41] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:18:41] [INFO ] Invariant cache hit.
[2023-03-09 04:18:42] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
[2023-03-09 04:18:42] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:18:42] [INFO ] Invariant cache hit.
[2023-03-09 04:18:42] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-09 04:18:42] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:18:42] [INFO ] Invariant cache hit.
[2023-03-09 04:18:42] [INFO ] State equation strengthened by 161 read => feed constraints.
[2023-03-09 04:18:43] [INFO ] Implicit Places using invariants and state equation in 1010 ms returned []
Implicit Place search using SMT with State Equation took 1070 ms to find 0 implicit places.
[2023-03-09 04:18:43] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:18:43] [INFO ] Invariant cache hit.
[2023-03-09 04:18:43] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1342 ms. Remains : 43/43 places, 490/490 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Running random walk in product with property : DNAwalker-PT-16redondantChoiceR-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 4}, { cond=(AND p1 p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ s21 s17), p0:(LEQ 2 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 17 steps with 2 reset in 1 ms.
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-16redondantChoiceR-LTLCardinality-13 finished in 1551 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 4 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 3 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2023-03-09 04:18:43] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:18:43] [INFO ] Invariant cache hit.
[2023-03-09 04:18:43] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
[2023-03-09 04:18:43] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:18:43] [INFO ] Invariant cache hit.
[2023-03-09 04:18:43] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-09 04:18:43] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:18:43] [INFO ] Invariant cache hit.
[2023-03-09 04:18:43] [INFO ] State equation strengthened by 161 read => feed constraints.
[2023-03-09 04:18:44] [INFO ] Implicit Places using invariants and state equation in 988 ms returned []
Implicit Place search using SMT with State Equation took 1040 ms to find 0 implicit places.
[2023-03-09 04:18:44] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:18:44] [INFO ] Invariant cache hit.
[2023-03-09 04:18:44] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1317 ms. Remains : 43/43 places, 490/490 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DNAwalker-PT-16redondantChoiceR-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(GT s14 s41), p0:(LEQ s28 s0)], 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 0 ms.
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-16redondantChoiceR-LTLCardinality-15 finished in 1454 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(((X((G(p0)&&p1)) U p1)||F(p2)||p0))))'
[2023-03-09 04:18:45] [INFO ] Flatten gal took : 22 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5204133178337114804
[2023-03-09 04:18:45] [INFO ] Computing symmetric may disable matrix : 490 transitions.
[2023-03-09 04:18:45] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 04:18:45] [INFO ] Computing symmetric may enable matrix : 490 transitions.
[2023-03-09 04:18:45] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 04:18:45] [INFO ] Applying decomposition
[2023-03-09 04:18:45] [INFO ] Computing Do-Not-Accords matrix : 490 transitions.
[2023-03-09 04:18:45] [INFO ] Flatten gal took : 25 ms
[2023-03-09 04:18:45] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 04:18:45] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5204133178337114804
Running compilation step : cd /tmp/ltsmin5204133178337114804;'/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/graph17777746208842255373.txt' '-o' '/tmp/graph17777746208842255373.bin' '-w' '/tmp/graph17777746208842255373.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17777746208842255373.bin' '-l' '-1' '-v' '-w' '/tmp/graph17777746208842255373.weights' '-q' '0' '-e' '0.001'
[2023-03-09 04:18:45] [INFO ] Decomposing Gal with order
[2023-03-09 04:18:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 04:18:45] [INFO ] Removed a total of 864 redundant transitions.
[2023-03-09 04:18:45] [INFO ] Flatten gal took : 25 ms
[2023-03-09 04:18:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-09 04:18:45] [INFO ] Time to serialize gal into /tmp/LTLCardinality13729353224968768447.gal : 2 ms
[2023-03-09 04:18:45] [INFO ] Time to serialize properties into /tmp/LTLCardinality18316885516668990138.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/LTLCardinality13729353224968768447.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality18316885516668990138.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 : !((F(G((((X((G("(gu3.B28<=gu3.A4)"))&&("(gu21.A24<=gu21.B5)")))U("(gu21.A24<=gu21.B5)"))||(F("(gu3.A14<=gu3.B28)")))||("(gu3.B28<=gu3....164
Formula 0 simplified : G(F(!"(gu3.B28<=gu3.A4)" & !"(gu21.A24<=gu21.B5)" & X(!"(gu21.A24<=gu21.B5)" | F!"(gu3.B28<=gu3.A4)")) & FG!"(gu3.A14<=gu3.B28)")
Compilation finished in 1088 ms.
Running link step : cd /tmp/ltsmin5204133178337114804;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin5204133178337114804;'/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))) U (LTLAPp1==true))||<>((LTLAPp2==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions gu3.t6, gu3.t7, gu3.t12, gu3.t13, gu3.t54, gu3.t410, gu4.t2, gu4.t3, gu11.t4, gu11.t5, gu12.t...3035
Computing Next relation with stutter on 1.04294e+07 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.015: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.030: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.030: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.030: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.030: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.031: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.031: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.031: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.031: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.033: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.034: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.033: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.034: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.135: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.135: LTL layer: formula: <>([](((X(([]((LTLAPp0==true))&&(LTLAPp1==true))) U (LTLAPp1==true))||<>((LTLAPp2==true))||(LTLAPp0==true))))
pins2lts-mc-linux64( 5/ 8), 0.135: "<>([](((X(([]((LTLAPp0==true))&&(LTLAPp1==true))) U (LTLAPp1==true))||<>((LTLAPp2==true))||(LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.135: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.145: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.147: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.153: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.195: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.195: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.197: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.207: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.233: There are 494 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.233: State length is 44, there are 498 groups
pins2lts-mc-linux64( 0/ 8), 0.233: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.233: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.233: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.233: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.279: [Blue] ~32 levels ~960 states ~4520 transitions
pins2lts-mc-linux64( 6/ 8), 0.300: [Blue] ~33 levels ~1920 states ~7320 transitions
pins2lts-mc-linux64( 6/ 8), 0.341: [Blue] ~33 levels ~3840 states ~13624 transitions
pins2lts-mc-linux64( 1/ 8), 0.436: [Blue] ~37 levels ~7680 states ~20072 transitions
pins2lts-mc-linux64( 1/ 8), 0.602: [Blue] ~37 levels ~15360 states ~37784 transitions
pins2lts-mc-linux64( 1/ 8), 0.988: [Blue] ~37 levels ~30720 states ~78912 transitions
pins2lts-mc-linux64( 6/ 8), 2.064: [Blue] ~36 levels ~61440 states ~209816 transitions
pins2lts-mc-linux64( 7/ 8), 7.552: [Blue] ~37 levels ~122880 states ~485296 transitions
pins2lts-mc-linux64( 7/ 8), 13.578: [Blue] ~37 levels ~245760 states ~1094016 transitions
pins2lts-mc-linux64( 5/ 8), 20.889: [Blue] ~38 levels ~491520 states ~1485680 transitions
pins2lts-mc-linux64( 5/ 8), 32.626: [Blue] ~38 levels ~983040 states ~3168872 transitions
pins2lts-mc-linux64( 5/ 8), 52.000: [Blue] ~38 levels ~1966080 states ~6957880 transitions
pins2lts-mc-linux64( 0/ 8), 69.719: [Blue] ~37 levels ~3932160 states ~12716024 transitions
pins2lts-mc-linux64( 0/ 8), 97.971: [Blue] ~37 levels ~7864320 states ~27575112 transitions
pins2lts-mc-linux64( 3/ 8), 147.952: [Blue] ~36 levels ~15728640 states ~55413144 transitions
pins2lts-mc-linux64( 0/ 8), 251.425: [Blue] ~37 levels ~31457280 states ~131992944 transitions
pins2lts-mc-linux64( 0/ 8), 463.904: [Blue] ~37 levels ~62914560 states ~266653576 transitions
pins2lts-mc-linux64( 0/ 8), 900.238: [Blue] ~37 levels ~125829120 states ~544202696 transitions
pins2lts-mc-linux64( 1/ 8), 1025.094: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1025.115:
pins2lts-mc-linux64( 0/ 8), 1025.115: Explored 134214132 states 721839805 transitions, fanout: 5.378
pins2lts-mc-linux64( 0/ 8), 1025.115: Total exploration time 1024.880 sec (1024.830 sec minimum, 1024.851 sec on average)
pins2lts-mc-linux64( 0/ 8), 1025.115: States per second: 130956, Transitions per second: 704316
pins2lts-mc-linux64( 0/ 8), 1025.115:
pins2lts-mc-linux64( 0/ 8), 1025.115: State space has 134213686 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 1025.115: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1025.115: blue states: 134214132 (100.00%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1025.115: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1025.115: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1025.115:
pins2lts-mc-linux64( 0/ 8), 1025.115: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 1025.115:
pins2lts-mc-linux64( 0/ 8), 1025.115: Queue width: 8B, total height: 296, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 1025.115: Tree memory: 1037.0MB, 8.1 B/state, compr.: 4.6%
pins2lts-mc-linux64( 0/ 8), 1025.115: Tree fill ratio (roots/leafs): 99.0%/5.0%
pins2lts-mc-linux64( 0/ 8), 1025.115: Stored 492 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1025.115: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1025.115: Est. total memory use: 1037.0MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5204133178337114804;'/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))) U (LTLAPp1==true))||<>((LTLAPp2==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5204133178337114804;'/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))) U (LTLAPp1==true))||<>((LTLAPp2==true))||(LTLAPp0==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-09 04:39:59] [INFO ] Flatten gal took : 12 ms
[2023-03-09 04:39:59] [INFO ] Time to serialize gal into /tmp/LTLCardinality2688498287597583316.gal : 2 ms
[2023-03-09 04:39:59] [INFO ] Time to serialize properties into /tmp/LTLCardinality3105608722588892665.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/LTLCardinality2688498287597583316.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3105608722588892665.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...297
Read 1 LTL properties
Checking formula 0 : !((F(G((((X((G("(B28<=A4)"))&&("(A24<=B5)")))U("(A24<=B5)"))||(F("(A14<=B28)")))||("(B28<=A4)")))))
Formula 0 simplified : G(F(!"(A24<=B5)" & !"(B28<=A4)" & X(!"(A24<=B5)" | F!"(B28<=A4)")) & FG!"(A14<=B28)")
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...2923
Computing Next relation with stutter on 1.04294e+07 deadlock states
75 unique states visited
0 strongly connected components in search stack
80 transitions explored
42 items max in DFS search stack
87082 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,870.88,5542696,1,0,1458,2.10705e+07,30,724,1723,4.19737e+07,2711
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Total runtime 2403393 ms.
BK_STOP 1678337704864
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DNAwalker-PT-16redondantChoiceR"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is DNAwalker-PT-16redondantChoiceR, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r101-tall-167814476100995"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DNAwalker-PT-16redondantChoiceR.tgz
mv DNAwalker-PT-16redondantChoiceR execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;