Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r114-tall-174876423000595.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-2, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-tall-174876423000595
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K 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.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 176K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K 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 38K 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-2-LTLCardinality-00
FORMULA_NAME LamportFastMutEx-COL-2-LTLCardinality-01
FORMULA_NAME LamportFastMutEx-COL-2-LTLCardinality-02
FORMULA_NAME LamportFastMutEx-COL-2-LTLCardinality-03
FORMULA_NAME LamportFastMutEx-COL-2-LTLCardinality-04
FORMULA_NAME LamportFastMutEx-COL-2-LTLCardinality-05
FORMULA_NAME LamportFastMutEx-COL-2-LTLCardinality-06
FORMULA_NAME LamportFastMutEx-COL-2-LTLCardinality-07
FORMULA_NAME LamportFastMutEx-COL-2-LTLCardinality-08
FORMULA_NAME LamportFastMutEx-COL-2-LTLCardinality-09
FORMULA_NAME LamportFastMutEx-COL-2-LTLCardinality-10
FORMULA_NAME LamportFastMutEx-COL-2-LTLCardinality-11
FORMULA_NAME LamportFastMutEx-COL-2-LTLCardinality-12
FORMULA_NAME LamportFastMutEx-COL-2-LTLCardinality-13
FORMULA_NAME LamportFastMutEx-COL-2-LTLCardinality-14
FORMULA_NAME LamportFastMutEx-COL-2-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748871447520

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-2
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202505121319
[2025-06-02 13:37:28] [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 13:37:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 13:37:29] [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 13:37:29] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-02 13:37:29] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 640 ms
[2025-06-02 13:37:29] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 69 PT places and 117.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2025-06-02 13:37:29] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 6 ms.
[2025-06-02 13:37:29] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 4 formulas.
FORMULA LamportFastMutEx-COL-2-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-2-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-2-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-2-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 0 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40002 steps (8 resets) in 874 ms. (45 steps per ms) remains 4/24 properties
BEST_FIRST walk for 40003 steps (8 resets) in 368 ms. (108 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 364 ms. (109 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 207 ms. (192 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 4/4 properties
// Phase 1: matrix 17 rows 15 cols
[2025-06-02 13:37:30] [INFO ] Computed 2 invariants in 7 ms
[2025-06-02 13:37:30] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp19 is UNSAT
After SMT solving in domain Real declared 15/32 variables, and 2 constraints, problems are : Problem set: 4 solved, 0 unsolved in 162 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/15 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 198ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 4 atomic propositions for a total of 11 simplifications.
FORMULA LamportFastMutEx-COL-2-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-2-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 13:37:30] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2025-06-02 13:37:30] [INFO ] Flatten gal took : 15 ms
FORMULA LamportFastMutEx-COL-2-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 13:37:30] [INFO ] Flatten gal took : 2 ms
Domain [pid(3), pid(3)] 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 13:37:30] [INFO ] Unfolded HLPN to a Petri net with 69 places and 96 transitions 402 arcs in 19 ms.
[2025-06-02 13:37:30] [INFO ] Unfolded 9 HLPN properties in 0 ms.
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 34 transitions.
Support contains 32 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 62/62 transitions.
Applied a total of 0 rules in 6 ms. Remains 44 /44 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2025-06-02 13:37:30] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
// Phase 1: matrix 56 rows 44 cols
[2025-06-02 13:37:30] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:37:31] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-06-02 13:37:31] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
[2025-06-02 13:37:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:37:31] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-02 13:37:31] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2025-06-02 13:37:31] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
[2025-06-02 13:37:31] [INFO ] Invariant cache hit.
[2025-06-02 13:37:31] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:31] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:31] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 4 ms to minimize.
Problem TDEAD10 is UNSAT
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:31] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 2 ms to minimize.
Problem TDEAD14 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:31] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 3 ms to minimize.
Problem TDEAD15 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:31] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:31] [INFO ] Deduced a trap composed of 11 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 13:37:31] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 2 ms to minimize.
Problem TDEAD24 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:31] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:31] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 3 ms to minimize.
Problem TDEAD27 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:31] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
Problem TDEAD28 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:31] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Problem TDEAD29 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:31] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:31] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:32] [INFO ] Deduced a trap composed of 10 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 13:37:32] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:32] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:32] [INFO ] Deduced a trap composed of 4 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 13:37:32] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 3 ms to minimize.
Problem TDEAD3 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 18/28 constraints. Problems are: Problem set: 11 solved, 49 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:32] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 1/29 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/29 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 56/100 variables, 44/73 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 16/89 constraints. Problems are: Problem set: 12 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:32] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 1/90 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/90 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 0/100 variables, 0/90 constraints. Problems are: Problem set: 12 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/100 variables, and 90 constraints, problems are : Problem set: 12 solved, 48 unsolved in 2217 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 48 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 4/4 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 11/15 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/15 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 2/44 variables, 6/21 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 9/30 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/30 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 56/100 variables, 44/74 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 16/90 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 48/138 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 0/138 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 10 (OVERLAPS) 0/100 variables, 0/138 constraints. Problems are: Problem set: 12 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/100 variables, and 138 constraints, problems are : Problem set: 12 solved, 48 unsolved in 1295 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 48/60 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3535ms problems are : Problem set: 12 solved, 48 unsolved
Search for dead transitions found 12 dead transitions in 3539ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in LTL mode, iteration 1 : 44/44 places, 50/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3734 ms. Remains : 44/44 places, 50/62 transitions.
Support contains 32 out of 44 places after structural reductions.
[2025-06-02 13:37:34] [INFO ] Flatten gal took : 7 ms
[2025-06-02 13:37:34] [INFO ] Flatten gal took : 7 ms
[2025-06-02 13:37:34] [INFO ] Input system was already deterministic with 50 transitions.
RANDOM walk for 40000 steps (8 resets) in 648 ms. (61 steps per ms) remains 2/18 properties
BEST_FIRST walk for 40004 steps (8 resets) in 296 ms. (134 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 147 ms. (270 steps per ms) remains 2/2 properties
[2025-06-02 13:37:35] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
// Phase 1: matrix 48 rows 44 cols
[2025-06-02 13:37:35] [INFO ] Computed 10 invariants in 1 ms
[2025-06-02 13:37:35] [INFO ] State equation strengthened by 14 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 28/34 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 48/82 variables, 34/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 10/92 variables, 10/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/92 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 92/92 variables, and 68 constraints, problems are : Problem set: 0 solved, 2 unsolved in 72 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 28/34 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 48/82 variables, 34/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 10/92 variables, 10/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:35] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:35] [INFO ] Deduced a trap composed of 9 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 13:37:35] [INFO ] Deduced a trap composed of 7 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 13:37:35] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:35] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:35] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 2 ms to minimize.
Problem AtomicPropp11 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 6/76 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:35] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 1/77 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/92 variables, 0/77 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/92 variables, 0/77 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 92/92 variables, and 77 constraints, problems are : Problem set: 1 solved, 1 unsolved in 406 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 486ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 2 out of 44 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 44/44 places, 50/50 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 42 transition count 48
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 42 transition count 46
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 40 transition count 46
Applied a total of 8 rules in 16 ms. Remains 40 /44 variables (removed 4) and now considering 46/50 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 40/44 places, 46/50 transitions.
RANDOM walk for 40000 steps (8 resets) in 355 ms. (112 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
Probably explored full state space saw : 324 states, properties seen :0
Probabilistic random walk after 932 steps, saw 324 distinct states, run finished after 10 ms. (steps per millisecond=93 ) properties seen :0
Explored full state space saw : 324 states, properties seen :0
Exhaustive walk after 932 steps, saw 324 distinct states, run finished after 4 ms. (steps per millisecond=233 ) properties seen :0
FORMULA LamportFastMutEx-COL-2-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 8 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA LamportFastMutEx-COL-2-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-2-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 2 stable transitions
FORMULA LamportFastMutEx-COL-2-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 4 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 42 transition count 48
Applied a total of 4 rules in 4 ms. Remains 42 /44 variables (removed 2) and now considering 48/50 (removed 2) transitions.
[2025-06-02 13:37:36] [INFO ] Flow matrix only has 46 transitions (discarded 2 similar events)
// Phase 1: matrix 46 rows 42 cols
[2025-06-02 13:37:36] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:37:36] [INFO ] Implicit Places using invariants in 45 ms returned [28, 29]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 46 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/44 places, 48/50 transitions.
Applied a total of 0 rules in 3 ms. Remains 40 /40 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 53 ms. Remains : 40/44 places, 48/50 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-2-LTLCardinality-01
Product exploration explored 100000 steps with 0 reset in 239 ms.
Stack based approach found an accepted trace after 20 steps with 0 reset with depth 21 and stack size 21 in 5 ms.
FORMULA LamportFastMutEx-COL-2-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-2-LTLCardinality-01 finished in 547 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(G((X(X(p1))||G(p2))))))'
Support contains 8 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2025-06-02 13:37:36] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
// Phase 1: matrix 48 rows 44 cols
[2025-06-02 13:37:36] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:37:36] [INFO ] Implicit Places using invariants in 46 ms returned [30, 31]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 48 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 42/44 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 42 /42 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51 ms. Remains : 42/44 places, 50/50 transitions.
Stuttering acceptance computed with spot in 306 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) p1)]
Running random walk in product with property : LamportFastMutEx-COL-2-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 896 steps with 173 reset in 16 ms.
FORMULA LamportFastMutEx-COL-2-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-2-LTLCardinality-02 finished in 402 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((G(p0) U p1)))'
Support contains 12 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2025-06-02 13:37:36] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
[2025-06-02 13:37:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:37:36] [INFO ] Implicit Places using invariants in 44 ms returned [30, 31]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 46 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 42/44 places, 50/50 transitions.
Applied a total of 0 rules in 0 ms. Remains 42 /42 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 48 ms. Remains : 42/44 places, 50/50 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-2-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 1 ms.
FORMULA LamportFastMutEx-COL-2-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-2-LTLCardinality-07 finished in 164 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(F(p0)))'
Support contains 2 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2025-06-02 13:37:37] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
[2025-06-02 13:37:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:37:37] [INFO ] Implicit Places using invariants in 41 ms returned [30, 31]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 42 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 42/44 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 42 /42 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45 ms. Remains : 42/44 places, 50/50 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-2-LTLCardinality-11
Product exploration explored 100000 steps with 19536 reset in 139 ms.
Product exploration explored 100000 steps with 19531 reset in 138 ms.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 15 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
[2025-06-02 13:37:38] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
// Phase 1: matrix 48 rows 42 cols
[2025-06-02 13:37:38] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 13:37:38] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-02 13:37:38] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-02 13:37:38] [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 13:37:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-02 13:37:38] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-02 13:37:38] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-02 13:37:38] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:38] [INFO ] Deduced a trap composed of 4 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 13:37:38] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
[2025-06-02 13:37:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 108 ms
[2025-06-02 13:37:38] [INFO ] Computed and/alt/rep : 48/124/46 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 13:37:38] [INFO ] Added : 24 causal constraints over 5 iterations in 55 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 42 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 42/42 places, 50/50 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 42 transition count 48
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 40 transition count 48
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 38 transition count 46
Applied a total of 8 rules in 10 ms. Remains 38 /42 variables (removed 4) and now considering 46/50 (removed 4) transitions.
[2025-06-02 13:37:38] [INFO ] Flow matrix only has 44 transitions (discarded 2 similar events)
// Phase 1: matrix 44 rows 38 cols
[2025-06-02 13:37:38] [INFO ] Computed 8 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:37:38] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-02 13:37:38] [INFO ] Flow matrix only has 44 transitions (discarded 2 similar events)
[2025-06-02 13:37:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:37:38] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-02 13:37:38] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 13:37:38] [INFO ] Redundant transitions in 0 ms returned []
Running 44 sub problems to find dead transitions.
[2025-06-02 13:37:38] [INFO ] Flow matrix only has 44 transitions (discarded 2 similar events)
[2025-06-02 13:37:38] [INFO ] Invariant cache hit.
[2025-06-02 13:37:38] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 2/38 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:38] [INFO ] Deduced a trap composed of 4 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 13:37:38] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:38] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:38] [INFO ] Deduced a trap composed of 7 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 13:37:38] [INFO ] Deduced a trap composed of 11 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 13:37:38] [INFO ] Deduced a trap composed of 11 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 13:37:38] [INFO ] Deduced a trap composed of 7 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 13:37:38] [INFO ] Deduced a trap composed of 9 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 13:37:38] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:38] [INFO ] Deduced a trap composed of 9 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 13:37:39] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:39] [INFO ] Deduced a trap composed of 10 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 13:37:39] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:39] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:39] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:39] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:39] [INFO ] Deduced a trap composed of 9 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 13:37:39] [INFO ] Deduced a trap composed of 10 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 13:37:39] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 19/27 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 44/82 variables, 38/65 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 10/75 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/82 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 82/82 variables, and 75 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1517 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 38/38 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 2/38 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 44/82 variables, 38/65 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 10/75 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 44/119 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:40] [INFO ] Deduced a trap along path composed of 2 places in 31 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/82 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:40] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:40] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/82 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/82 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 12 (OVERLAPS) 0/82 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 82/82 variables, and 122 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1984 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 38/38 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 3510ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 3511ms
Starting structural reductions in SI_LTL mode, iteration 1 : 38/42 places, 46/50 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3635 ms. Remains : 38/42 places, 46/50 transitions.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 16 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
[2025-06-02 13:37:42] [INFO ] Flow matrix only has 44 transitions (discarded 2 similar events)
[2025-06-02 13:37:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 13:37:42] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-02 13:37:42] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2025-06-02 13:37:42] [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 13:37:42] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-02 13:37:42] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-06-02 13:37:42] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-02 13:37:42] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2025-06-02 13:37:42] [INFO ] Computed and/alt/rep : 44/124/42 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 13:37:42] [INFO ] Added : 2 causal constraints over 1 iterations in 11 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 19530 reset in 92 ms.
Product exploration explored 100000 steps with 19480 reset in 155 ms.
Built C files in :
/tmp/ltsmin3248162418481146144
[2025-06-02 13:37:42] [INFO ] Computing symmetric may disable matrix : 46 transitions.
[2025-06-02 13:37:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 13:37:42] [INFO ] Computing symmetric may enable matrix : 46 transitions.
[2025-06-02 13:37:42] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 13:37:42] [INFO ] Computing Do-Not-Accords matrix : 46 transitions.
[2025-06-02 13:37:42] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 13:37:42] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3248162418481146144
Running compilation step : cd /tmp/ltsmin3248162418481146144;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 450 ms.
Running link step : cd /tmp/ltsmin3248162418481146144;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin3248162418481146144;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6000658980928920121.hoa' '--buchi-type=spotba'
LTSmin run took 83 ms.
FORMULA LamportFastMutEx-COL-2-LTLCardinality-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property LamportFastMutEx-COL-2-LTLCardinality-11 finished in 6442 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||G(p1))) U G((p2 U X(X(p3))))))'
Support contains 14 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2025-06-02 13:37:43] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
// Phase 1: matrix 48 rows 44 cols
[2025-06-02 13:37:43] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:37:43] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-02 13:37:43] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
[2025-06-02 13:37:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:37:43] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-02 13:37:43] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Running 48 sub problems to find dead transitions.
[2025-06-02 13:37:43] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
[2025-06-02 13:37:43] [INFO ] Invariant cache hit.
[2025-06-02 13:37:43] [INFO ] State equation strengthened by 14 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 2/44 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:43] [INFO ] Deduced a trap composed of 4 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 13:37:43] [INFO ] Deduced a trap composed of 4 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 13:37:43] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:44] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:44] [INFO ] Deduced a trap composed of 8 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 13:37:44] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:44] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:44] [INFO ] Deduced a trap composed of 11 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 13:37:44] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:44] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:44] [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 13:37:44] [INFO ] Deduced a trap composed of 9 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 13:37:44] [INFO ] Deduced a trap composed of 9 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 13:37:44] [INFO ] Deduced a trap composed of 10 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 13:37:44] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:44] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:44] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:44] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:44] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:44] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 48/92 variables, 44/74 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 14/88 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/92 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 92/92 variables, and 88 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1985 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 2/44 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 48/92 variables, 44/74 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 14/88 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 48/136 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:46] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:46] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/92 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 12 (OVERLAPS) 0/92 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 92/92 variables, and 138 constraints, problems are : Problem set: 0 solved, 48 unsolved in 2085 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 4082ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 4083ms
Finished structural reductions in LTL mode , in 1 iterations and 4189 ms. Remains : 44/44 places, 50/50 transitions.
Stuttering acceptance computed with spot in 1173 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1)), (NOT p3), (AND p0 (NOT p1) (NOT p3)), (NOT p3), (AND p0 (NOT p1) (NOT p3)), (NOT p3), (NOT p3), true, (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1) (NOT p0)), (NOT p3), (AND p0 (NOT p1) (NOT p3)), (NOT p3), (NOT p3), (AND p0 (NOT p1) (NOT p3)), (NOT p3), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : LamportFastMutEx-COL-2-LTLCardinality-12
Product exploration explored 100000 steps with 31907 reset in 258 ms.
Product exploration explored 100000 steps with 31728 reset in 272 ms.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2 p3), (X p2), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (X (OR (AND p2 p0) (AND p2 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND p0 p1))), (X (AND p2 (NOT p0) p1)), (X (AND (NOT p0) p1)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (OR p0 p1)), (X (NOT (AND p2 p0 p1))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND p2 p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) p0 (NOT p3))))), (X (X (OR p0 p1))), (X (X (NOT (AND p2 (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (OR (AND p2 p0) (AND p2 p1)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) p0 (NOT p3)) (AND (NOT p2) p1 (NOT p3)))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) p0 p1 (NOT p3))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND p2 (NOT p0) p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X p1))]
False Knowledge obtained : [(X (X (OR (AND p0 (NOT p3)) (AND p1 (NOT p3))))), (X (X (NOT (OR (AND p0 (NOT p3)) (AND p1 (NOT p3)))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND p2 (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p2 p0 p1 (NOT p3)))), (X (X (NOT (AND p2 p0 p1 (NOT p3))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND p0 p1 (NOT p3)))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (OR (AND p2 p0 (NOT p3)) (AND p2 p1 (NOT p3))))), (X (X (NOT (OR (AND p2 p0 (NOT p3)) (AND p2 p1 (NOT p3)))))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND p2 p0 p1))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT p3))), (X (X p3)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 48 factoid took 1436 ms. Reduced automaton from 26 states, 108 edges and 4 AP (stutter sensitive) to 26 states, 108 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1166 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1)), (NOT p3), (AND p0 (NOT p1) (NOT p3)), (NOT p3), (AND p0 (NOT p1) (NOT p3)), (NOT p3), (NOT p3), true, (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1) (NOT p0)), (NOT p3), (AND p0 (NOT p1) (NOT p3)), (NOT p3), (NOT p3), (AND p0 (NOT p1) (NOT p3)), (NOT p3), (NOT p1), (AND (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 41 to 28
RANDOM walk for 40000 steps (8 resets) in 492 ms. (81 steps per ms) remains 5/28 properties
BEST_FIRST walk for 40000 steps (8 resets) in 244 ms. (163 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 242 ms. (164 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 199 ms. (200 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (8 resets) in 105 ms. (377 steps per ms) remains 5/5 properties
[2025-06-02 13:37:52] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
[2025-06-02 13:37:52] [INFO ] Invariant cache hit.
[2025-06-02 13:37:52] [INFO ] State equation strengthened by 14 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf8 is UNSAT
Problem apf16 is UNSAT
Problem apf37 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 20/34 variables, 6/6 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 48/82 variables, 34/40 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 14/54 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/54 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 10/92 variables, 10/64 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 4/68 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 0/68 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/92 variables, 0/68 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 92/92 variables, and 68 constraints, problems are : Problem set: 3 solved, 2 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 2 unsolved
Problem apf13 is UNSAT
At refinement iteration 1 (OVERLAPS) 20/34 variables, 6/6 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/6 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 48/82 variables, 34/40 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 14/54 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/54 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/92 variables, 10/64 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 4/68 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 1/69 constraints. Problems are: Problem set: 4 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:52] [INFO ] Deduced a trap composed of 9 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 13:37:52] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:52] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:52] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:52] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 3 ms to minimize.
Problem apf4 is UNSAT
After SMT solving in domain Int declared 92/92 variables, and 74 constraints, problems are : Problem set: 5 solved, 0 unsolved in 295 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/5 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 366ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 7 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2 p3), (X p2), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (X (OR (AND p2 p0) (AND p2 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND p0 p1))), (X (AND p2 (NOT p0) p1)), (X (AND (NOT p0) p1)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (OR p0 p1)), (X (NOT (AND p2 p0 p1))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND p2 p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) p0 (NOT p3))))), (X (X (OR p0 p1))), (X (X (NOT (AND p2 (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (OR (AND p2 p0) (AND p2 p1)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) p0 (NOT p3)) (AND (NOT p2) p1 (NOT p3)))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) p0 p1 (NOT p3))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND p2 (NOT p0) p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X p1)), (G (OR p0 p2 p1 p3)), (G (OR p0 p2 (NOT p1) p3)), (G (OR p0 p2 p1)), (G (OR p0 (NOT p1) p3)), (G (OR (NOT p0) p2 p1 p3)), (G (OR (NOT p0) p2 p1)), (G (OR p0 (NOT p2) (NOT p1) p3))]
False Knowledge obtained : [(X (X (OR (AND p0 (NOT p3)) (AND p1 (NOT p3))))), (X (X (NOT (OR (AND p0 (NOT p3)) (AND p1 (NOT p3)))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND p2 (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p2 p0 p1 (NOT p3)))), (X (X (NOT (AND p2 p0 p1 (NOT p3))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND p0 p1 (NOT p3)))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (OR (AND p2 p0 (NOT p3)) (AND p2 p1 (NOT p3))))), (X (X (NOT (OR (AND p2 p0 (NOT p3)) (AND p2 p1 (NOT p3)))))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND p2 p0 p1))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT p3))), (X (X p3)), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR p0 (NOT p2) p1 p3))), (F (NOT (OR (NOT p2) p3))), (F (NOT (OR p1 p3))), (F (NOT (OR p2 p3))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) (NOT p2) p1 p3))), (F (NOT (OR (NOT p0) p3))), (F (NOT p2)), (F (NOT (OR (NOT p0) (NOT p1) p3))), (F (NOT (OR (NOT p0) p1 p3))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (AND p0 p2) (AND p2 p1)))), (F (NOT (AND (OR (NOT p0) p3) (OR (NOT p1) p3)))), (F (NOT p1)), (F (NOT (OR p0 p1 p3))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (AND (OR (NOT p0) p2 p3) (OR p2 (NOT p1) p3)))), (F (NOT (AND (OR (NOT p0) p2) (OR p2 (NOT p1))))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT p3)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (OR (NOT p0) p2 p3))), (F (NOT (AND (NOT p0) p1))), (F (NOT (AND (NOT p0) p2 p1))), (F (NOT (OR p0 p2 (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p2 (NOT p1) p3))), (F (NOT (OR (NOT p1) p3))), (F (NOT (AND (OR (NOT p0) (NOT p2) p3) (OR (NOT p2) (NOT p1) p3)))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1) p3))), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 55 factoid took 3720 ms. Reduced automaton from 26 states, 108 edges and 4 AP (stutter sensitive) to 26 states, 88 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1190 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1)), (NOT p3), (AND p0 (NOT p1) (NOT p3)), (NOT p3), (AND p0 (NOT p1) (NOT p3)), (NOT p3), (NOT p3), true, (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p3)), (NOT p3), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p3))), (NOT p3), (NOT p3), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p3))), (NOT p3), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 1186 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1)), (NOT p3), (AND p0 (NOT p1) (NOT p3)), (NOT p3), (AND p0 (NOT p1) (NOT p3)), (NOT p3), (NOT p3), true, (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p3)), (NOT p3), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p3))), (NOT p3), (NOT p3), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p3))), (NOT p3), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 14 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2025-06-02 13:37:59] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
[2025-06-02 13:37:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:37:59] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-02 13:37:59] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
[2025-06-02 13:37:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:37:59] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-02 13:37:59] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Running 48 sub problems to find dead transitions.
[2025-06-02 13:37:59] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
[2025-06-02 13:37:59] [INFO ] Invariant cache hit.
[2025-06-02 13:37:59] [INFO ] State equation strengthened by 14 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 2/44 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:59] [INFO ] Deduced a trap composed of 4 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 13:37:59] [INFO ] Deduced a trap composed of 4 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 13:37:59] [INFO ] Deduced a trap composed of 8 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 13:37:59] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:59] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:59] [INFO ] Deduced a trap composed of 8 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 13:37:59] [INFO ] Deduced a trap composed of 7 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 13:37:59] [INFO ] Deduced a trap composed of 11 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 13:37:59] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:59] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:37:59] [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 13:37:59] [INFO ] Deduced a trap composed of 9 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 13:38:00] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:00] [INFO ] Deduced a trap composed of 10 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 13:38:00] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:00] [INFO ] Deduced a trap composed of 10 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 13:38:00] [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 13:38:00] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:00] [INFO ] Deduced a trap composed of 11 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 13:38:00] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 48/92 variables, 44/74 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 14/88 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/92 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 92/92 variables, and 88 constraints, problems are : Problem set: 0 solved, 48 unsolved in 2016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 2/44 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 48/92 variables, 44/74 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 14/88 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 48/136 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:01] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:02] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/92 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 12 (OVERLAPS) 0/92 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 92/92 variables, and 138 constraints, problems are : Problem set: 0 solved, 48 unsolved in 2141 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 4165ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 4166ms
Finished structural reductions in LTL mode , in 1 iterations and 4274 ms. Remains : 44/44 places, 50/50 transitions.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2 p3), (X p2), (X (OR (AND p0 p2) (AND p1 p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (AND (NOT p0) p1 p2)), (X (OR p0 p1)), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (OR (AND p0 p2) (AND p1 p2)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR p0 p1))), (X (X p1))]
False Knowledge obtained : [(X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3))))), (X (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3)))))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND p1 p2 (NOT p3)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT p3))), (X (X p3)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 26 factoid took 1801 ms. Reduced automaton from 26 states, 88 edges and 4 AP (stutter sensitive) to 26 states, 88 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1233 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1)), (NOT p3), (AND p0 (NOT p1) (NOT p3)), (NOT p3), (AND p0 (NOT p1) (NOT p3)), (NOT p3), (NOT p3), true, (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p3)), (NOT p3), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p3))), (NOT p3), (NOT p3), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p3))), (NOT p3), (NOT p1), (AND (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 23 to 19
RANDOM walk for 368 steps (0 resets) in 5 ms. (61 steps per ms) remains 0/19 properties
Knowledge obtained : [(AND (NOT p0) p1 p2 p3), (X p2), (X (OR (AND p0 p2) (AND p1 p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (AND (NOT p0) p1 p2)), (X (OR p0 p1)), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (OR (AND p0 p2) (AND p1 p2)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR p0 p1))), (X (X p1))]
False Knowledge obtained : [(X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3))))), (X (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3)))))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND p1 p2 (NOT p3)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT p3))), (X (X p3)), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR (AND p0 p2) (AND p2 p1)))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p3))), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR (NOT p0) p3))), (F (NOT (AND (OR (NOT p0) (NOT p2) p3) (OR (NOT p2) (NOT p1) p3)))), (F (NOT (AND (NOT p0) p2 p1))), (F (NOT (OR (NOT p2) (NOT p1) p3))), (F (NOT (OR (NOT p2) p3))), (F (NOT (OR p0 p2))), (F (NOT (OR p2 p3))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT p2)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p1) p3))), (F (NOT (OR p1 p3))), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR (NOT p0) p1 p3))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT p3))]
Knowledge based reduction with 26 factoid took 3014 ms. Reduced automaton from 26 states, 88 edges and 4 AP (stutter sensitive) to 26 states, 88 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1253 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1)), (NOT p3), (AND p0 (NOT p1) (NOT p3)), (NOT p3), (AND p0 (NOT p1) (NOT p3)), (NOT p3), (NOT p3), true, (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p3)), (NOT p3), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p3))), (NOT p3), (NOT p3), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p3))), (NOT p3), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 1258 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1)), (NOT p3), (AND p0 (NOT p1) (NOT p3)), (NOT p3), (AND p0 (NOT p1) (NOT p3)), (NOT p3), (NOT p3), true, (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p3)), (NOT p3), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p3))), (NOT p3), (NOT p3), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p3))), (NOT p3), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 1209 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1)), (NOT p3), (AND p0 (NOT p1) (NOT p3)), (NOT p3), (AND p0 (NOT p1) (NOT p3)), (NOT p3), (NOT p3), true, (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p3)), (NOT p3), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p3))), (NOT p3), (NOT p3), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p3))), (NOT p3), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 31915 reset in 198 ms.
Product exploration explored 100000 steps with 31935 reset in 213 ms.
Applying partial POR strategy [false, false, false, false, false, false, false, false, false, false, true, true, true, true, false, false, false, false, false, true, false, false, false, false, true, true, true, true, true, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 1738 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1)), (NOT p3), (AND p0 (NOT p1) (NOT p3)), (NOT p3), (AND p0 (NOT p1) (NOT p3)), (NOT p3), (NOT p3), true, (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p3)), (NOT p3), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p3))), (NOT p3), (NOT p3), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p3))), (NOT p3), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p3), (AND (NOT p3) (NOT p1)), (AND p0 (NOT p1) (NOT p3)), (NOT p3), (AND p0 (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1)), (NOT p3), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p3))), (NOT p3), (NOT p3)]
Support contains 14 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Applied a total of 0 rules in 5 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 13:38:16] [INFO ] Redundant transitions in 1 ms returned []
Running 48 sub problems to find dead transitions.
[2025-06-02 13:38:16] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
[2025-06-02 13:38:16] [INFO ] Invariant cache hit.
[2025-06-02 13:38:16] [INFO ] State equation strengthened by 14 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 2/44 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:16] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:16] [INFO ] Deduced a trap composed of 4 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 13:38:16] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:16] [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 13:38:16] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:16] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:16] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:16] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:16] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:16] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:16] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:16] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:16] [INFO ] Deduced a trap composed of 9 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 13:38:16] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:16] [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 13:38:16] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:16] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:17] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:17] [INFO ] Deduced a trap composed of 11 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 13:38:17] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 48/92 variables, 44/74 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 14/88 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/92 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 92/92 variables, and 88 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1957 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 2/44 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 48/92 variables, 44/74 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 14/88 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 48/136 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:18] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:38:18] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/92 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 12 (OVERLAPS) 0/92 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 92/92 variables, and 138 constraints, problems are : Problem set: 0 solved, 48 unsolved in 2076 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 4046ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 4046ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4061 ms. Remains : 44/44 places, 50/50 transitions.
Built C files in :
/tmp/ltsmin2703124687043414326
[2025-06-02 13:38:20] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2703124687043414326
Running compilation step : cd /tmp/ltsmin2703124687043414326;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 136 ms.
Running link step : cd /tmp/ltsmin2703124687043414326;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin2703124687043414326;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3977263399477556935.hoa' '--buchi-type=spotba'
LTSmin run took 76 ms.
FORMULA LamportFastMutEx-COL-2-LTLCardinality-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property LamportFastMutEx-COL-2-LTLCardinality-12 finished in 36852 ms.
All properties solved by simple procedures.
Total runtime 51507 ms.

BK_STOP 1748871500452

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-2"
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-2, 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-174876423000595"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-2.tgz
mv LamportFastMutEx-COL-2 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;