About the Execution of ITS-Tools for LamportFastMutEx-COL-5
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 299822.00 | 0.00 | 0.00 | FFFFFFFTFTFFFTTF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r114-tall-174876423000619.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is LamportFastMutEx-COL-5, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-tall-174876423000619
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 41K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME LamportFastMutEx-COL-5-LTLCardinality-00
FORMULA_NAME LamportFastMutEx-COL-5-LTLCardinality-01
FORMULA_NAME LamportFastMutEx-COL-5-LTLCardinality-02
FORMULA_NAME LamportFastMutEx-COL-5-LTLCardinality-03
FORMULA_NAME LamportFastMutEx-COL-5-LTLCardinality-04
FORMULA_NAME LamportFastMutEx-COL-5-LTLCardinality-05
FORMULA_NAME LamportFastMutEx-COL-5-LTLCardinality-06
FORMULA_NAME LamportFastMutEx-COL-5-LTLCardinality-07
FORMULA_NAME LamportFastMutEx-COL-5-LTLCardinality-08
FORMULA_NAME LamportFastMutEx-COL-5-LTLCardinality-09
FORMULA_NAME LamportFastMutEx-COL-5-LTLCardinality-10
FORMULA_NAME LamportFastMutEx-COL-5-LTLCardinality-11
FORMULA_NAME LamportFastMutEx-COL-5-LTLCardinality-12
FORMULA_NAME LamportFastMutEx-COL-5-LTLCardinality-13
FORMULA_NAME LamportFastMutEx-COL-5-LTLCardinality-14
FORMULA_NAME LamportFastMutEx-COL-5-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1748873156425
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-5
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202505121319
[2025-06-02 14:05:57] [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]
[2025-06-02 14:05:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 14:05:58] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-02 14:05:58] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-02 14:05:58] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 675 ms
[2025-06-02 14:05:58] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 174 PT places and 396.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2025-06-02 14:05:58] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 8 ms.
[2025-06-02 14:05:58] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA LamportFastMutEx-COL-5-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-5-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-5-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
FORMULA LamportFastMutEx-COL-5-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-5-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 910 steps (0 resets) in 48 ms. (18 steps per ms) remains 0/23 properties
[2025-06-02 14:05:59] [INFO ] Flatten gal took : 15 ms
[2025-06-02 14:05:59] [INFO ] Flatten gal took : 3 ms
Domain [pid(6), pid(6)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2025-06-02 14:05:59] [INFO ] Unfolded HLPN to a Petri net with 174 places and 318 transitions 1380 arcs in 31 ms.
[2025-06-02 14:05:59] [INFO ] Unfolded 11 HLPN properties in 0 ms.
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 58 transitions.
Support contains 115 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 8 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2025-06-02 14:05:59] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2025-06-02 14:05:59] [INFO ] Computed 37 invariants in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:05:59] [INFO ] Implicit Places using invariants in 256 ms returned []
[2025-06-02 14:05:59] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
[2025-06-02 14:05:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:05:59] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-06-02 14:05:59] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2025-06-02 14:05:59] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
[2025-06-02 14:05:59] [INFO ] Invariant cache hit.
[2025-06-02 14:05:59] [INFO ] State equation strengthened by 55 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 255 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:00] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 28 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:00] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 6 ms to minimize.
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:00] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 10 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:01] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 7 ms to minimize.
Problem TDEAD8 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:01] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 6 ms to minimize.
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:01] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:01] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:01] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:01] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:01] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:01] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:01] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:01] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:01] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:01] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:02] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:02] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:02] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 4 ms to minimize.
Problem TDEAD40 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD52 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:02] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 4 ms to minimize.
Problem TDEAD58 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:02] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 20/57 constraints. Problems are: Problem set: 24 solved, 231 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:02] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:02] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:02] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:02] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:02] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:02] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 2 ms to minimize.
Problem TDEAD68 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:02] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 3 ms to minimize.
Problem TDEAD69 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:03] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:03] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:03] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:03] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:03] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:03] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:03] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:03] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:03] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:03] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:03] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:03] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 4 ms to minimize.
Problem TDEAD120 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:04] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 7 ms to minimize.
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 20/77 constraints. Problems are: Problem set: 30 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:04] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:04] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:04] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:04] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:04] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:04] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:05] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:05] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:05] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:05] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:05] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:05] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:05] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:05] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:05] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:05] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:06] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:06] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:06] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 19/96 constraints. Problems are: Problem set: 30 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:07] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:07] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:07] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:07] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:07] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:07] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 6/102 constraints. Problems are: Problem set: 30 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:08] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:08] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 2/104 constraints. Problems are: Problem set: 30 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:08] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:09] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:09] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 3/107 constraints. Problems are: Problem set: 30 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:11] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:11] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:11] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:11] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 4/111 constraints. Problems are: Problem set: 30 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:12] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:12] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:12] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:12] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:12] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 5/116 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 0/116 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 10 (OVERLAPS) 200/337 variables, 137/253 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/337 variables, 55/308 constraints. Problems are: Problem set: 30 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:14] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:15] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:15] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:15] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:15] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:15] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/337 variables, 6/314 constraints. Problems are: Problem set: 30 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:18] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:18] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:18] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:18] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:19] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:19] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:19] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 8 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/337 variables, 7/321 constraints. Problems are: Problem set: 30 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:19] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 6 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/337 variables, 1/322 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/337 variables, 0/322 constraints. Problems are: Problem set: 30 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:25] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:25] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:25] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 10 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/337 variables, 3/325 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/337 variables, 0/325 constraints. Problems are: Problem set: 30 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 337/337 variables, and 325 constraints, problems are : Problem set: 30 solved, 225 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 137/137 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 96/96 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 30 solved, 225 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 7/7 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 68/75 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/75 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 3 (OVERLAPS) 5/137 variables, 30/105 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 28/133 constraints. Problems are: Problem set: 30 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:30] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:30] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:31] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:31] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 4/137 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/137 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 7 (OVERLAPS) 200/337 variables, 137/274 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/337 variables, 55/329 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/337 variables, 225/554 constraints. Problems are: Problem set: 30 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:36] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:36] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:37] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:37] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:37] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:37] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:37] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 10 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/337 variables, 7/561 constraints. Problems are: Problem set: 30 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:41] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:42] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:42] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/337 variables, 3/564 constraints. Problems are: Problem set: 30 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:48] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:06:48] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 9 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/337 variables, 2/566 constraints. Problems are: Problem set: 30 solved, 225 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/337 variables, 0/566 constraints. Problems are: Problem set: 30 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 337/337 variables, and 566 constraints, problems are : Problem set: 30 solved, 225 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 137/137 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 225/255 constraints, Known Traps: 112/112 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60167ms problems are : Problem set: 30 solved, 225 unsolved
Search for dead transitions found 30 dead transitions in 60187ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in LTL mode, iteration 1 : 137/137 places, 230/260 transitions.
Applied a total of 0 rules in 3 ms. Remains 137 /137 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60680 ms. Remains : 137/137 places, 230/260 transitions.
Support contains 115 out of 137 places after structural reductions.
[2025-06-02 14:06:59] [INFO ] Flatten gal took : 25 ms
[2025-06-02 14:06:59] [INFO ] Flatten gal took : 21 ms
[2025-06-02 14:06:59] [INFO ] Input system was already deterministic with 230 transitions.
RANDOM walk for 40000 steps (8 resets) in 933 ms. (42 steps per ms) remains 1/23 properties
BEST_FIRST walk for 40002 steps (8 resets) in 145 ms. (273 steps per ms) remains 1/1 properties
[2025-06-02 14:07:00] [INFO ] Flow matrix only has 180 transitions (discarded 50 similar events)
// Phase 1: matrix 180 rows 137 cols
[2025-06-02 14:07:00] [INFO ] Computed 37 invariants in 3 ms
[2025-06-02 14:07:00] [INFO ] State equation strengthened by 50 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 110/115 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 180/295 variables, 115/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 50/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 22/317 variables, 22/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 7/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/317 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 224 constraints, problems are : Problem set: 0 solved, 1 unsolved in 134 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 137/137 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 110/115 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 180/295 variables, 115/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 50/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 22/317 variables, 22/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 7/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:00] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:00] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:00] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:00] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:00] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:01] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:01] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:01] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:01] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:01] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 5 ms to minimize.
Problem AtomicPropp22 is UNSAT
After SMT solving in domain Int declared 317/317 variables, and 235 constraints, problems are : Problem set: 1 solved, 0 unsolved in 950 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 137/137 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1092ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
FORMULA LamportFastMutEx-COL-5-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 5 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0 U (p1&&X(!p0))))))'
Support contains 15 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 230/230 transitions.
Applied a total of 0 rules in 5 ms. Remains 137 /137 variables (removed 0) and now considering 230/230 (removed 0) transitions.
[2025-06-02 14:07:01] [INFO ] Flow matrix only has 180 transitions (discarded 50 similar events)
[2025-06-02 14:07:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:07:01] [INFO ] Implicit Places using invariants in 100 ms returned []
[2025-06-02 14:07:01] [INFO ] Flow matrix only has 180 transitions (discarded 50 similar events)
[2025-06-02 14:07:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:07:01] [INFO ] State equation strengthened by 50 read => feed constraints.
[2025-06-02 14:07:02] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2025-06-02 14:07:02] [INFO ] Flow matrix only has 180 transitions (discarded 50 similar events)
[2025-06-02 14:07:02] [INFO ] Invariant cache hit.
[2025-06-02 14:07:02] [INFO ] State equation strengthened by 50 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (OVERLAPS) 5/137 variables, 30/37 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:03] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:03] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:04] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:04] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:04] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:04] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:04] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:04] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:04] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:04] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:04] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:04] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:04] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:04] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:05] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:05] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:05] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:05] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:05] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:05] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:05] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:05] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:06] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:06] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:06] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:06] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:06] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:06] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:06] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:06] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:06] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:06] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:07] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:07] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:07] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:07] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:07] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:07] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:07] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:07] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:07] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:08] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:08] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:08] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:08] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:08] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:08] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:08] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:08] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:08] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:08] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:08] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:08] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:08] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:09] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:09] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:09] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:09] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:09] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:09] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:10] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:10] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:10] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:10] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 4/101 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:11] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:11] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (OVERLAPS) 180/317 variables, 137/240 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 50/290 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:14] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:15] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 8 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/317 variables, 2/292 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:16] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/317 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:18] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:18] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:19] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:19] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:19] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:19] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 11 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/317 variables, 6/299 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:20] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 8 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/317 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/317 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 16 (OVERLAPS) 0/317 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 300 constraints, problems are : Problem set: 0 solved, 225 unsolved in 23975 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 137/137 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 76/76 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 48/55 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (OVERLAPS) 5/137 variables, 30/85 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 28/113 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:27] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:27] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (OVERLAPS) 180/317 variables, 137/252 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 50/302 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 225/527 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:31] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:32] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:32] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:32] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 9 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 4/531 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:37] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 9 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/317 variables, 1/532 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:43] [INFO ] Deduced a trap along path composed of 5 places in 35 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/317 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:55] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:55] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:55] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:55] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:55] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 317/317 variables, and 538 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 137/137 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 88/88 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 54029ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 54031ms
Finished structural reductions in LTL mode , in 1 iterations and 54339 ms. Remains : 137/137 places, 230/230 transitions.
Stuttering acceptance computed with spot in 295 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), true, (OR (NOT p1) p0)]
Running random walk in product with property : LamportFastMutEx-COL-5-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 41 steps with 0 reset in 5 ms.
FORMULA LamportFastMutEx-COL-5-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-5-LTLCardinality-00 finished in 54711 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 15 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 230/230 transitions.
Applied a total of 0 rules in 14 ms. Remains 137 /137 variables (removed 0) and now considering 230/230 (removed 0) transitions.
[2025-06-02 14:07:56] [INFO ] Flow matrix only has 180 transitions (discarded 50 similar events)
[2025-06-02 14:07:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:07:56] [INFO ] Implicit Places using invariants in 111 ms returned [87, 88, 89, 90, 91]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 114 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/137 places, 230/230 transitions.
Applied a total of 0 rules in 10 ms. Remains 132 /132 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 138 ms. Remains : 132/137 places, 230/230 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-5-LTLCardinality-01
Product exploration explored 100000 steps with 1762 reset in 353 ms.
Stack based approach found an accepted trace after 1666 steps with 29 reset with depth 158 and stack size 158 in 5 ms.
FORMULA LamportFastMutEx-COL-5-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-5-LTLCardinality-01 finished in 582 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((p0&&(X((p1||X(p2)))||G(p3))))))))'
Support contains 45 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 230/230 transitions.
Applied a total of 0 rules in 3 ms. Remains 137 /137 variables (removed 0) and now considering 230/230 (removed 0) transitions.
[2025-06-02 14:07:57] [INFO ] Flow matrix only has 180 transitions (discarded 50 similar events)
[2025-06-02 14:07:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:07:57] [INFO ] Implicit Places using invariants in 80 ms returned [87, 88, 89, 90, 91]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 82 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/137 places, 230/230 transitions.
Applied a total of 0 rules in 2 ms. Remains 132 /132 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 87 ms. Remains : 132/137 places, 230/230 transitions.
Stuttering acceptance computed with spot in 433 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3) (NOT p1)), (NOT p2), (AND (NOT p3) (NOT p2)), (NOT p3)]
Running random walk in product with property : LamportFastMutEx-COL-5-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 24 steps with 4 reset in 1 ms.
FORMULA LamportFastMutEx-COL-5-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-5-LTLCardinality-02 finished in 539 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G(p1)))'
Support contains 40 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 230/230 transitions.
Applied a total of 0 rules in 4 ms. Remains 137 /137 variables (removed 0) and now considering 230/230 (removed 0) transitions.
[2025-06-02 14:07:57] [INFO ] Flow matrix only has 180 transitions (discarded 50 similar events)
[2025-06-02 14:07:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:07:57] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-02 14:07:57] [INFO ] Flow matrix only has 180 transitions (discarded 50 similar events)
[2025-06-02 14:07:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:07:57] [INFO ] State equation strengthened by 50 read => feed constraints.
[2025-06-02 14:07:57] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2025-06-02 14:07:57] [INFO ] Flow matrix only has 180 transitions (discarded 50 similar events)
[2025-06-02 14:07:57] [INFO ] Invariant cache hit.
[2025-06-02 14:07:57] [INFO ] State equation strengthened by 50 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (OVERLAPS) 5/137 variables, 30/37 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:59] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:59] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:59] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:59] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:07:59] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:00] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:00] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:00] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:00] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:00] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:00] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:00] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:00] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:00] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:00] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:00] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:01] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:01] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:01] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:01] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:01] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:01] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:01] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:02] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:02] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:02] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:02] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:02] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:02] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:02] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:02] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:02] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:02] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:02] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:03] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:03] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:03] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:03] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:03] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:03] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:03] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:03] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:03] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:04] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:04] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:04] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:04] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:04] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:04] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:04] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:04] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:04] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:04] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:04] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:04] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:05] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:05] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:05] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:05] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:05] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:06] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:06] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:06] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:06] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 4/101 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:07] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:07] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (OVERLAPS) 180/317 variables, 137/240 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 50/290 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:10] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:11] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 8 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/317 variables, 2/292 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:12] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/317 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:14] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:14] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:15] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:15] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:15] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:15] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 9 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/317 variables, 6/299 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:16] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 8 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/317 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/317 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 16 (OVERLAPS) 0/317 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 300 constraints, problems are : Problem set: 0 solved, 225 unsolved in 24345 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 137/137 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 76/76 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 48/55 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (OVERLAPS) 5/137 variables, 30/85 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 28/113 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:23] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:23] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (OVERLAPS) 180/317 variables, 137/252 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 50/302 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 225/527 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:27] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:28] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:28] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:29] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 9 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 4/531 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:33] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 9 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/317 variables, 1/532 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:39] [INFO ] Deduced a trap along path composed of 5 places in 36 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/317 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:51] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:51] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:51] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:51] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:52] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 317/317 variables, and 538 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 137/137 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 88/88 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 54412ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 54413ms
Finished structural reductions in LTL mode , in 1 iterations and 54702 ms. Remains : 137/137 places, 230/230 transitions.
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : LamportFastMutEx-COL-5-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-COL-5-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-5-LTLCardinality-03 finished in 54889 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)||(X(F(p2))&&p1)))))'
Support contains 40 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 230/230 transitions.
Applied a total of 0 rules in 5 ms. Remains 137 /137 variables (removed 0) and now considering 230/230 (removed 0) transitions.
[2025-06-02 14:08:52] [INFO ] Flow matrix only has 180 transitions (discarded 50 similar events)
[2025-06-02 14:08:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:08:52] [INFO ] Implicit Places using invariants in 104 ms returned [87, 88, 89, 90, 91]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 106 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/137 places, 230/230 transitions.
Applied a total of 0 rules in 2 ms. Remains 132 /132 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 114 ms. Remains : 132/137 places, 230/230 transitions.
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-5-LTLCardinality-05
Product exploration explored 100000 steps with 5205 reset in 200 ms.
Stack based approach found an accepted trace after 68099 steps with 3562 reset with depth 71 and stack size 71 in 157 ms.
FORMULA LamportFastMutEx-COL-5-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-5-LTLCardinality-05 finished in 714 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X((G(p1)||X(X(F(p2)))))))))'
Support contains 45 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 230/230 transitions.
Applied a total of 0 rules in 3 ms. Remains 137 /137 variables (removed 0) and now considering 230/230 (removed 0) transitions.
[2025-06-02 14:08:53] [INFO ] Flow matrix only has 180 transitions (discarded 50 similar events)
[2025-06-02 14:08:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:08:53] [INFO ] Implicit Places using invariants in 96 ms returned [87, 88, 89, 90, 91]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 99 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/137 places, 230/230 transitions.
Applied a total of 0 rules in 2 ms. Remains 132 /132 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 105 ms. Remains : 132/137 places, 230/230 transitions.
Stuttering acceptance computed with spot in 260 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : LamportFastMutEx-COL-5-LTLCardinality-06
Product exploration explored 100000 steps with 3993 reset in 234 ms.
Product exploration explored 100000 steps with 4013 reset in 290 ms.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 125 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 275 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
RANDOM walk for 220 steps (0 resets) in 13 ms. (15 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p2), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F p1), (F p0)]
Knowledge based reduction with 2 factoid took 279 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 321 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 303 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
[2025-06-02 14:08:55] [INFO ] Flow matrix only has 180 transitions (discarded 50 similar events)
// Phase 1: matrix 180 rows 132 cols
[2025-06-02 14:08:55] [INFO ] Computed 32 invariants in 5 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 14:08:55] [INFO ] [Real]Absence check using 32 positive place invariants in 14 ms returned sat
[2025-06-02 14:08:55] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2025-06-02 14:08:55] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 14:08:55] [INFO ] [Nat]Absence check using 32 positive place invariants in 16 ms returned sat
[2025-06-02 14:08:56] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2025-06-02 14:08:56] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-06-02 14:08:56] [INFO ] [Nat]Added 25 Read/Feed constraints in 17 ms returned sat
[2025-06-02 14:08:56] [INFO ] Computed and/alt/rep : 155/675/155 causal constraints (skipped 20 transitions) in 14 ms.
[2025-06-02 14:08:56] [INFO ] Added : 25 causal constraints over 5 iterations in 165 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p2))
Support contains 45 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 230/230 transitions.
Applied a total of 0 rules in 3 ms. Remains 132 /132 variables (removed 0) and now considering 230/230 (removed 0) transitions.
[2025-06-02 14:08:56] [INFO ] Flow matrix only has 180 transitions (discarded 50 similar events)
[2025-06-02 14:08:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:08:56] [INFO ] Implicit Places using invariants in 84 ms returned []
[2025-06-02 14:08:56] [INFO ] Flow matrix only has 180 transitions (discarded 50 similar events)
[2025-06-02 14:08:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:08:56] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-06-02 14:08:56] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2025-06-02 14:08:56] [INFO ] Flow matrix only has 180 transitions (discarded 50 similar events)
[2025-06-02 14:08:56] [INFO ] Invariant cache hit.
[2025-06-02 14:08:56] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (OVERLAPS) 5/132 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:58] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:58] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:58] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:58] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:58] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:58] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:58] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:58] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:58] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:58] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:58] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:58] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:59] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:59] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:59] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:59] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:59] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:59] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:59] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:08:59] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:00] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:00] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:00] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:00] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:00] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:00] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:00] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:00] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:00] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:00] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:00] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:01] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:01] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:01] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:01] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:01] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:01] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:01] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:01] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:01] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:02] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:02] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:02] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:02] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:02] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:02] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:02] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:02] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:02] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:02] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:02] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:02] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:03] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:03] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:03] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:03] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:03] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:03] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:03] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:03] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:03] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:04] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:04] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:04] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:04] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:04] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:04] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:04] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:04] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:04] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:05] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:05] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 12/104 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (OVERLAPS) 180/312 variables, 132/236 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 25/261 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:08] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:08] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:08] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:08] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:08] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:09] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:09] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:09] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:09] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 9/270 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:10] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:10] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 7 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/312 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/312 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:15] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:15] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 8 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/312 variables, 2/274 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:16] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/312 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/312 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:21] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:21] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:22] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 7 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/312 variables, 3/278 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/312 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:26] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 8 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/312 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 312/312 variables, and 279 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, State Equation: 132/132 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 90/90 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 62/69 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (OVERLAPS) 5/132 variables, 25/94 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 28/122 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:27] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:28] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:28] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:28] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:28] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:28] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:28] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:28] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:28] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 9/131 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (OVERLAPS) 180/312 variables, 132/263 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 25/288 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 225/513 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:33] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:33] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:33] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:33] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:33] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:33] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:33] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:33] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:34] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:34] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:34] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 11/524 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:38] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:39] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:39] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:39] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/312 variables, 4/528 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:44] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:45] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:45] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:45] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:45] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:45] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:46] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:46] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 8 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/312 variables, 8/536 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:49] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/312 variables, 1/537 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 312/312 variables, and 537 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, State Equation: 132/132 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 123/123 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60077ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 60080ms
Finished structural reductions in LTL mode , in 1 iterations and 60332 ms. Remains : 132/132 places, 230/230 transitions.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 126 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 303 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
RANDOM walk for 98 steps (0 resets) in 6 ms. (14 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p2), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F p1), (F p0)]
Knowledge based reduction with 2 factoid took 255 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 301 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 286 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
[2025-06-02 14:09:57] [INFO ] Flow matrix only has 180 transitions (discarded 50 similar events)
[2025-06-02 14:09:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 14:09:58] [INFO ] [Real]Absence check using 32 positive place invariants in 11 ms returned sat
[2025-06-02 14:09:58] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2025-06-02 14:09:58] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 14:09:58] [INFO ] [Nat]Absence check using 32 positive place invariants in 20 ms returned sat
[2025-06-02 14:09:58] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2025-06-02 14:09:58] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-06-02 14:09:58] [INFO ] [Nat]Added 25 Read/Feed constraints in 13 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:58] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:58] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:58] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:58] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:09:58] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 4 ms to minimize.
[2025-06-02 14:09:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 346 ms
[2025-06-02 14:09:58] [INFO ] Computed and/alt/rep : 155/675/155 causal constraints (skipped 20 transitions) in 11 ms.
[2025-06-02 14:09:59] [INFO ] Added : 87 causal constraints over 18 iterations in 301 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 310 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 4006 reset in 206 ms.
Stack based approach found an accepted trace after 73530 steps with 2933 reset with depth 31 and stack size 31 in 247 ms.
FORMULA LamportFastMutEx-COL-5-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-5-LTLCardinality-06 finished in 66668 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((F(G(!p0))&&(p1||X((G(p2) U (p1&&G(p2))))))))))'
Support contains 25 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 230/230 transitions.
Applied a total of 0 rules in 4 ms. Remains 137 /137 variables (removed 0) and now considering 230/230 (removed 0) transitions.
[2025-06-02 14:09:59] [INFO ] Flow matrix only has 180 transitions (discarded 50 similar events)
// Phase 1: matrix 180 rows 137 cols
[2025-06-02 14:09:59] [INFO ] Computed 37 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:09:59] [INFO ] Implicit Places using invariants in 105 ms returned [87, 88, 89, 90, 91]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 105 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/137 places, 230/230 transitions.
Applied a total of 0 rules in 2 ms. Remains 132 /132 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 111 ms. Remains : 132/137 places, 230/230 transitions.
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), p0, (OR (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : LamportFastMutEx-COL-5-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 1 ms.
FORMULA LamportFastMutEx-COL-5-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-5-LTLCardinality-08 finished in 392 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(!p0)||F(G(p1))))))'
Support contains 35 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 230/230 transitions.
Applied a total of 0 rules in 2 ms. Remains 137 /137 variables (removed 0) and now considering 230/230 (removed 0) transitions.
[2025-06-02 14:10:00] [INFO ] Flow matrix only has 180 transitions (discarded 50 similar events)
[2025-06-02 14:10:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:10:00] [INFO ] Implicit Places using invariants in 110 ms returned [87, 88, 89, 90, 91]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 110 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/137 places, 230/230 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 113 ms. Remains : 132/137 places, 230/230 transitions.
Stuttering acceptance computed with spot in 146 ms :[(AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : LamportFastMutEx-COL-5-LTLCardinality-10
Product exploration explored 100000 steps with 0 reset in 259 ms.
Stack based approach found an accepted trace after 227 steps with 0 reset with depth 228 and stack size 228 in 1 ms.
FORMULA LamportFastMutEx-COL-5-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-5-LTLCardinality-10 finished in 543 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 5 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 230/230 transitions.
Applied a total of 0 rules in 14 ms. Remains 137 /137 variables (removed 0) and now considering 230/230 (removed 0) transitions.
[2025-06-02 14:10:00] [INFO ] Flow matrix only has 180 transitions (discarded 50 similar events)
[2025-06-02 14:10:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:10:01] [INFO ] Implicit Places using invariants in 201 ms returned [87, 88, 89, 90, 91]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 202 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/137 places, 230/230 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 132 transition count 225
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 127 transition count 225
Applied a total of 10 rules in 18 ms. Remains 127 /132 variables (removed 5) and now considering 225/230 (removed 5) transitions.
[2025-06-02 14:10:01] [INFO ] Flow matrix only has 175 transitions (discarded 50 similar events)
// Phase 1: matrix 175 rows 127 cols
[2025-06-02 14:10:01] [INFO ] Computed 32 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:10:01] [INFO ] Implicit Places using invariants in 104 ms returned []
[2025-06-02 14:10:01] [INFO ] Flow matrix only has 175 transitions (discarded 50 similar events)
[2025-06-02 14:10:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:10:01] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-06-02 14:10:01] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 127/137 places, 225/230 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 544 ms. Remains : 127/137 places, 225/230 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-5-LTLCardinality-11
Product exploration explored 100000 steps with 0 reset in 199 ms.
Stack based approach found an accepted trace after 219 steps with 0 reset with depth 220 and stack size 220 in 1 ms.
FORMULA LamportFastMutEx-COL-5-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-5-LTLCardinality-11 finished in 804 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&X(p0)))&&X(X(G((p1&&X(p2)))))))'
Support contains 10 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 230/230 transitions.
Applied a total of 0 rules in 3 ms. Remains 137 /137 variables (removed 0) and now considering 230/230 (removed 0) transitions.
[2025-06-02 14:10:01] [INFO ] Flow matrix only has 180 transitions (discarded 50 similar events)
// Phase 1: matrix 180 rows 137 cols
[2025-06-02 14:10:01] [INFO ] Computed 37 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:10:01] [INFO ] Implicit Places using invariants in 99 ms returned []
[2025-06-02 14:10:01] [INFO ] Flow matrix only has 180 transitions (discarded 50 similar events)
[2025-06-02 14:10:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:10:01] [INFO ] State equation strengthened by 50 read => feed constraints.
[2025-06-02 14:10:01] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2025-06-02 14:10:01] [INFO ] Flow matrix only has 180 transitions (discarded 50 similar events)
[2025-06-02 14:10:01] [INFO ] Invariant cache hit.
[2025-06-02 14:10:01] [INFO ] State equation strengthened by 50 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (OVERLAPS) 5/137 variables, 30/37 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:03] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:03] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:03] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:03] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:04] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:04] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:04] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:04] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:04] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:04] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:04] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:04] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:04] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:04] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:04] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:04] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:05] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:05] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:05] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:05] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:05] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:05] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:06] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:06] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:06] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:06] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:06] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:06] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:06] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:06] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:06] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:06] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:06] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:07] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:07] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:07] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:07] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:07] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:07] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:07] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:07] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:07] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:08] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:08] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:08] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:08] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:08] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:08] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:08] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:08] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:08] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:08] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:08] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:08] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:08] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:09] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:09] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:09] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:09] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:09] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:10] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:10] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:10] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:10] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 4/101 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:11] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:11] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (OVERLAPS) 180/317 variables, 137/240 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 50/290 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:14] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:15] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 8 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/317 variables, 2/292 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:16] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/317 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:18] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:18] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:18] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:18] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:19] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:19] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 9 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/317 variables, 6/299 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:20] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 8 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/317 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/317 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 16 (OVERLAPS) 0/317 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 300 constraints, problems are : Problem set: 0 solved, 225 unsolved in 23923 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 137/137 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 76/76 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 48/55 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (OVERLAPS) 5/137 variables, 30/85 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 28/113 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:27] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:27] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (OVERLAPS) 180/317 variables, 137/252 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 50/302 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 225/527 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:30] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:31] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:32] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:32] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 9 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 4/531 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:36] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 10 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/317 variables, 1/532 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:42] [INFO ] Deduced a trap along path composed of 5 places in 31 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/317 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:54] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:54] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:54] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:55] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 14:10:55] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 8 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/317 variables, 5/538 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 317/317 variables, and 538 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 137/137 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 88/88 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 53982ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 53983ms
Finished structural reductions in LTL mode , in 1 iterations and 54310 ms. Remains : 137/137 places, 230/230 transitions.
Stuttering acceptance computed with spot in 279 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p2) (NOT p1)), (NOT p0), (OR (NOT p1) (NOT p2)), true, (AND p1 (NOT p2))]
Running random walk in product with property : LamportFastMutEx-COL-5-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 232 steps with 3 reset in 1 ms.
FORMULA LamportFastMutEx-COL-5-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-5-LTLCardinality-12 finished in 54616 ms.
All properties solved by simple procedures.
Total runtime 298320 ms.
BK_STOP 1748873456247
--------------------
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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="LamportFastMutEx-COL-5"
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-5832"
echo " Executing tool itstools"
echo " Input is LamportFastMutEx-COL-5, 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 r114-tall-174876423000619"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-5.tgz
mv LamportFastMutEx-COL-5 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.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 ;