Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 9.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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 5.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K 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 16K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K 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 108K 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 NeoElection-COL-7-LTLCardinality-00
FORMULA_NAME NeoElection-COL-7-LTLCardinality-01
FORMULA_NAME NeoElection-COL-7-LTLCardinality-02
FORMULA_NAME NeoElection-COL-7-LTLCardinality-03
FORMULA_NAME NeoElection-COL-7-LTLCardinality-04
FORMULA_NAME NeoElection-COL-7-LTLCardinality-05
FORMULA_NAME NeoElection-COL-7-LTLCardinality-06
FORMULA_NAME NeoElection-COL-7-LTLCardinality-07
FORMULA_NAME NeoElection-COL-7-LTLCardinality-08
FORMULA_NAME NeoElection-COL-7-LTLCardinality-09
FORMULA_NAME NeoElection-COL-7-LTLCardinality-10
FORMULA_NAME NeoElection-COL-7-LTLCardinality-11
FORMULA_NAME NeoElection-COL-7-LTLCardinality-12
FORMULA_NAME NeoElection-COL-7-LTLCardinality-13
FORMULA_NAME NeoElection-COL-7-LTLCardinality-14
FORMULA_NAME NeoElection-COL-7-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748799597989

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeoElection-COL-7
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202505121319
[2025-06-01 17:39:59] [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-01 17:39:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 17:39:59] [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-01 17:39:59] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-01 17:39:59] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 647 ms
[2025-06-01 17:39:59] [INFO ] Detected 6 constant HL places corresponding to 3552 PT places.
[2025-06-01 17:39:59] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 7128 PT places and 22272.0 transition bindings in 30 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2025-06-01 17:40:00] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 5 ms.
[2025-06-01 17:40:00] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA NeoElection-COL-7-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 14 stabilizing places and 8 stable transitions
Graph (complete) has 56 edges and 18 vertex of which 15 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Remains 13 properties that can be checked using skeleton over-approximation.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 12 places and 7 transitions.
Ensure Unique test removed 8 transitions
Reduce redundant transitions removed 8 transitions.
FORMULA NeoElection-COL-7-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 2 stable transitions
RANDOM walk for 24477 steps (602 resets) in 176 ms. (138 steps per ms) remains 0/9 properties
[2025-06-01 17:40:00] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2025-06-01 17:40:00] [INFO ] Flatten gal took : 16 ms
FORMULA NeoElection-COL-7-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-01 17:40:00] [INFO ] Flatten gal took : 2 ms
Domain [M(8), POS(7), M(8)] of place P_masterList breaks symmetries in sort M
Arc [15:1*[$m, (MOD (ADD $i 1) 7)]] contains successor/predecessor on variables of sort POS
Symmetric sort wr.t. initial and guards and successors and join/free detected :MT
Arc [9:1*[$m, $s, 3, 0]] contains constants of sort MT
Transition T_poll__handleAI1 : constants on arcs in [[9:1*[$m, $s, 3, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 2 subsets.
Arc [9:1*[$m, $s, 3, 0]] contains constants of sort MT
Transition T_poll__handleAI2 : constants on arcs in [[9:1*[$m, $s, 3, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 2 subsets.
Arc [9:1*[$m, $s, 4, 0]] contains constants of sort MT
Transition T_poll__handleAnnP1 : constants on arcs in [[9:1*[$m, $s, 4, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 3 subsets.
Arc [9:1*[$m, $s, 4, 0]] contains constants of sort MT
Transition T_poll__handleAnnP2 : constants on arcs in [[9:1*[$m, $s, 4, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 3 subsets.
Arc [9:1*[$m, $s, 1, 0]] contains constants of sort MT
Transition T_poll__handleAnsP1 : constants on arcs in [[9:1*[$m, $s, 1, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 4 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP1 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP2 : constants on arcs in [[9:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP2 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP3 : constants on arcs in [[9:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [11:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP4 : constants on arcs in [[11:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP4 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 0, 0]] contains constants of sort MT
Transition T_poll__handleAskP : constants on arcs in [[9:1*[$m, $s, 0, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 6 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :STAGE
Arc [16:1*[$m, 0]] contains constants of sort STAGE
Transition T_poll__iAmPrimary : constants on arcs in [[16:1*[$m, 0]]] introduces in STAGE(3) partition with 1 elements that refines current partition to 2 subsets.
Arc [16:1*[$m, 1]] contains constants of sort STAGE
Transition T_poll__iAmPrimary : constants on arcs in [[16:1*[$m, 1]]] introduces in STAGE(3) partition with 1 elements that refines current partition to 3 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :NEGSTEP
Arc [8:1*[$m, $r, 1]] contains constants of sort NEGSTEP
Transition T_poll__handleAI1 : constants on arcs in [[8:1*[$m, $r, 1]]] introduces in NEGSTEP(3) partition with 1 elements that refines current partition to 2 subsets.
Arc [8:1*[$m, $r, 2]] contains constants of sort NEGSTEP
Transition T_poll__handleAI1 : constants on arcs in [[8:1*[$m, $r, 2]]] introduces in NEGSTEP(3) partition with 1 elements that refines current partition to 3 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :BOOL
Arc [7:1*[$m, 0, $pm]] contains constants of sort BOOL
Transition T_poll__handleAI2 : constants on arcs in [[7:1*[$m, 0, $pm]]] introduces in BOOL(2) partition with 1 elements that refines current partition to 2 subsets.
[2025-06-01 17:40:00] [INFO ] Unfolded HLPN to a Petri net with 7128 places and 12460 transitions 70880 arcs in 228 ms.
[2025-06-01 17:40:00] [INFO ] Unfolded 6 HLPN properties in 2 ms.
Deduced a syphon composed of 6688 places in 37 ms
Reduce places removed 6737 places and 11850 transitions.
Reduce places removed 8 places and 0 transitions.
Support contains 245 out of 383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 383/383 places, 610/610 transitions.
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 341 transition count 610
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 77 place count 306 transition count 295
Iterating global reduction 1 with 35 rules applied. Total rules applied 112 place count 306 transition count 295
Applied a total of 112 rules in 42 ms. Remains 306 /383 variables (removed 77) and now considering 295/610 (removed 315) transitions.
[2025-06-01 17:40:00] [INFO ] Flow matrix only has 259 transitions (discarded 36 similar events)
// Phase 1: matrix 259 rows 306 cols
[2025-06-01 17:40:00] [INFO ] Computed 62 invariants in 24 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:40:04] [INFO ] Implicit Places using invariants in 4043 ms returned [19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67]
Discarding 49 places :
Implicit Place search using SMT only with invariants took 4112 ms to find 49 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 257/383 places, 295/610 transitions.
Applied a total of 0 rules in 2 ms. Remains 257 /257 variables (removed 0) and now considering 295/295 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4163 ms. Remains : 257/383 places, 295/610 transitions.
Support contains 245 out of 257 places after structural reductions.
[2025-06-01 17:40:04] [INFO ] Flatten gal took : 33 ms
[2025-06-01 17:40:04] [INFO ] Flatten gal took : 32 ms
[2025-06-01 17:40:05] [INFO ] Input system was already deterministic with 295 transitions.
RANDOM walk for 40000 steps (68 resets) in 1043 ms. (38 steps per ms) remains 1/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 217 ms. (183 steps per ms) remains 1/1 properties
[2025-06-01 17:40:05] [INFO ] Flow matrix only has 259 transitions (discarded 36 similar events)
// Phase 1: matrix 259 rows 257 cols
[2025-06-01 17:40:05] [INFO ] Computed 13 invariants in 3 ms
[2025-06-01 17:40:05] [INFO ] State equation strengthened by 21 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp2 is UNSAT
After SMT solving in domain Real declared 7/516 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 19 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, State Equation: 0/257 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
Computed a total of 257 stabilizing places and 295 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 257 transition count 295
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X(G(p0))) U G(!p0)))'
Support contains 7 out of 257 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 257/257 places, 295/295 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 257 transition count 288
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 250 transition count 288
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 14 place count 250 transition count 281
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 28 place count 243 transition count 281
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 65 place count 206 transition count 229
Iterating global reduction 2 with 37 rules applied. Total rules applied 102 place count 206 transition count 229
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 102 place count 206 transition count 222
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 116 place count 199 transition count 222
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 186 place count 164 transition count 187
Applied a total of 186 rules in 77 ms. Remains 164 /257 variables (removed 93) and now considering 187/295 (removed 108) transitions.
[2025-06-01 17:40:05] [INFO ] Flow matrix only has 151 transitions (discarded 36 similar events)
// Phase 1: matrix 151 rows 164 cols
[2025-06-01 17:40:05] [INFO ] Computed 13 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:40:05] [INFO ] Implicit Places using invariants in 126 ms returned []
[2025-06-01 17:40:05] [INFO ] Flow matrix only has 151 transitions (discarded 36 similar events)
[2025-06-01 17:40:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:40:05] [INFO ] State equation strengthened by 144 read => feed constraints.
[2025-06-01 17:40:06] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 17:40:06] [INFO ] Redundant transitions in 5 ms returned []
Running 180 sub problems to find dead transitions.
[2025-06-01 17:40:06] [INFO ] Flow matrix only has 151 transitions (discarded 36 similar events)
[2025-06-01 17:40:06] [INFO ] Invariant cache hit.
[2025-06-01 17:40:06] [INFO ] State equation strengthened by 144 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 7/164 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Problem TDEAD142 is UNSAT
At refinement iteration 4 (OVERLAPS) 151/315 variables, 164/177 constraints. Problems are: Problem set: 1 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 144/321 constraints. Problems are: Problem set: 1 solved, 179 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 0/321 constraints. Problems are: Problem set: 1 solved, 179 unsolved
At refinement iteration 7 (OVERLAPS) 0/315 variables, 0/321 constraints. Problems are: Problem set: 1 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 315/315 variables, and 321 constraints, problems are : Problem set: 1 solved, 179 unsolved in 6094 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 164/164 constraints, ReadFeed: 144/144 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 179 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 7/164 variables, 7/13 constraints. Problems are: Problem set: 1 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 151/315 variables, 164/177 constraints. Problems are: Problem set: 1 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 144/321 constraints. Problems are: Problem set: 1 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 179/500 constraints. Problems are: Problem set: 1 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 0/500 constraints. Problems are: Problem set: 1 solved, 179 unsolved
At refinement iteration 8 (OVERLAPS) 0/315 variables, 0/500 constraints. Problems are: Problem set: 1 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Int declared 315/315 variables, and 500 constraints, problems are : Problem set: 1 solved, 179 unsolved in 8747 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 164/164 constraints, ReadFeed: 144/144 constraints, PredecessorRefiner: 179/180 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14886ms problems are : Problem set: 1 solved, 179 unsolved
Search for dead transitions found 1 dead transitions in 14888ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 164/257 places, 186/295 transitions.
Applied a total of 0 rules in 9 ms. Remains 164 /164 variables (removed 0) and now considering 186/186 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 17:40:21] [INFO ] Redundant transitions in 5 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 15434 ms. Remains : 164/257 places, 186/295 transitions.
Stuttering acceptance computed with spot in 212 ms :[p0, true, p0]
Running random walk in product with property : NeoElection-COL-7-LTLCardinality-01
Product exploration explored 100000 steps with 568 reset in 460 ms.
Product exploration explored 100000 steps with 568 reset in 388 ms.
Computed a total of 164 stabilizing places and 186 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 164 transition count 186
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 81 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[p0, true, p0]
RANDOM walk for 301 steps (0 resets) in 9 ms. (30 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 121 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[p0, true, p0]
Stuttering acceptance computed with spot in 103 ms :[p0, true, p0]
[2025-06-01 17:40:22] [INFO ] Flow matrix only has 150 transitions (discarded 36 similar events)
// Phase 1: matrix 150 rows 164 cols
[2025-06-01 17:40:22] [INFO ] Computed 14 invariants in 1 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 17:40:22] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 17:40:22] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2025-06-01 17:40:23] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 17:40:23] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 17:40:23] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2025-06-01 17:40:23] [INFO ] State equation strengthened by 143 read => feed constraints.
[2025-06-01 17:40:23] [INFO ] [Nat]Added 143 Read/Feed constraints in 38 ms returned sat
[2025-06-01 17:40:23] [INFO ] Computed and/alt/rep : 179/444/143 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-01 17:40:23] [INFO ] Added : 104 causal constraints over 21 iterations in 357 ms. Result :sat
Could not prove EG p0
Support contains 7 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 186/186 transitions.
Applied a total of 0 rules in 13 ms. Remains 164 /164 variables (removed 0) and now considering 186/186 (removed 0) transitions.
[2025-06-01 17:40:23] [INFO ] Flow matrix only has 150 transitions (discarded 36 similar events)
[2025-06-01 17:40:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:40:23] [INFO ] Implicit Places using invariants in 101 ms returned []
[2025-06-01 17:40:23] [INFO ] Flow matrix only has 150 transitions (discarded 36 similar events)
[2025-06-01 17:40:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:40:23] [INFO ] State equation strengthened by 143 read => feed constraints.
[2025-06-01 17:40:24] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 17:40:24] [INFO ] Redundant transitions in 4 ms returned []
Running 179 sub problems to find dead transitions.
[2025-06-01 17:40:24] [INFO ] Flow matrix only has 150 transitions (discarded 36 similar events)
[2025-06-01 17:40:24] [INFO ] Invariant cache hit.
[2025-06-01 17:40:24] [INFO ] State equation strengthened by 143 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 7/164 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 150/314 variables, 164/178 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 143/321 constraints. Problems are: Problem set: 0 solved, 179 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (OVERLAPS) 0/314 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 321 constraints, problems are : Problem set: 0 solved, 179 unsolved in 5662 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 164/164 constraints, ReadFeed: 143/143 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 7/164 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 150/314 variables, 164/178 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 143/321 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 179/500 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (OVERLAPS) 0/314 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 500 constraints, problems are : Problem set: 0 solved, 179 unsolved in 8575 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 164/164 constraints, ReadFeed: 143/143 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14257ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 14259ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14676 ms. Remains : 164/164 places, 186/186 transitions.
Computed a total of 164 stabilizing places and 186 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 164 transition count 186
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 101 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[p0, true, p0]
RANDOM walk for 262 steps (0 resets) in 8 ms. (29 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 115 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[p0, true, p0]
Stuttering acceptance computed with spot in 94 ms :[p0, true, p0]
[2025-06-01 17:40:38] [INFO ] Flow matrix only has 150 transitions (discarded 36 similar events)
[2025-06-01 17:40:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 17:40:38] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 17:40:39] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2025-06-01 17:40:39] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 17:40:39] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 17:40:39] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2025-06-01 17:40:39] [INFO ] State equation strengthened by 143 read => feed constraints.
[2025-06-01 17:40:39] [INFO ] [Nat]Added 143 Read/Feed constraints in 17 ms returned sat
[2025-06-01 17:40:39] [INFO ] Computed and/alt/rep : 179/444/143 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-01 17:40:39] [INFO ] Added : 104 causal constraints over 21 iterations in 338 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 78 ms :[p0, true, p0]
Product exploration explored 100000 steps with 568 reset in 350 ms.
Product exploration explored 100000 steps with 568 reset in 360 ms.
Built C files in :
/tmp/ltsmin5856883061254595541
[2025-06-01 17:40:40] [INFO ] Computing symmetric may disable matrix : 186 transitions.
[2025-06-01 17:40:40] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 17:40:40] [INFO ] Computing symmetric may enable matrix : 186 transitions.
[2025-06-01 17:40:40] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 17:40:40] [INFO ] Computing Do-Not-Accords matrix : 186 transitions.
[2025-06-01 17:40:40] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 17:40:40] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5856883061254595541
Running compilation step : cd /tmp/ltsmin5856883061254595541;'/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 469 ms.
Running link step : cd /tmp/ltsmin5856883061254595541;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 440 ms.
Running LTSmin : cd /tmp/ltsmin5856883061254595541;'/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/stateBased5472291820104232875.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 186/186 transitions.
Applied a total of 0 rules in 13 ms. Remains 164 /164 variables (removed 0) and now considering 186/186 (removed 0) transitions.
[2025-06-01 17:40:55] [INFO ] Flow matrix only has 150 transitions (discarded 36 similar events)
[2025-06-01 17:40:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:40:55] [INFO ] Implicit Places using invariants in 116 ms returned []
[2025-06-01 17:40:55] [INFO ] Flow matrix only has 150 transitions (discarded 36 similar events)
[2025-06-01 17:40:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:40:55] [INFO ] State equation strengthened by 143 read => feed constraints.
[2025-06-01 17:40:55] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 17:40:56] [INFO ] Redundant transitions in 4 ms returned []
Running 179 sub problems to find dead transitions.
[2025-06-01 17:40:56] [INFO ] Flow matrix only has 150 transitions (discarded 36 similar events)
[2025-06-01 17:40:56] [INFO ] Invariant cache hit.
[2025-06-01 17:40:56] [INFO ] State equation strengthened by 143 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 7/164 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 150/314 variables, 164/178 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 143/321 constraints. Problems are: Problem set: 0 solved, 179 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (OVERLAPS) 0/314 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 321 constraints, problems are : Problem set: 0 solved, 179 unsolved in 5572 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 164/164 constraints, ReadFeed: 143/143 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 7/164 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 150/314 variables, 164/178 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 143/321 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 179/500 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (OVERLAPS) 0/314 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 500 constraints, problems are : Problem set: 0 solved, 179 unsolved in 8590 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 164/164 constraints, ReadFeed: 143/143 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14185ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 14187ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14607 ms. Remains : 164/164 places, 186/186 transitions.
Built C files in :
/tmp/ltsmin2377964162873879753
[2025-06-01 17:41:10] [INFO ] Computing symmetric may disable matrix : 186 transitions.
[2025-06-01 17:41:10] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 17:41:10] [INFO ] Computing symmetric may enable matrix : 186 transitions.
[2025-06-01 17:41:10] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 17:41:10] [INFO ] Computing Do-Not-Accords matrix : 186 transitions.
[2025-06-01 17:41:10] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 17:41:10] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2377964162873879753
Running compilation step : cd /tmp/ltsmin2377964162873879753;'/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 370 ms.
Running link step : cd /tmp/ltsmin2377964162873879753;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin2377964162873879753;'/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/stateBased4051313688654441326.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-01 17:41:25] [INFO ] Flatten gal took : 12 ms
[2025-06-01 17:41:25] [INFO ] Flatten gal took : 11 ms
[2025-06-01 17:41:25] [INFO ] Time to serialize gal into /tmp/LTL15577041639610733198.gal : 4 ms
[2025-06-01 17:41:25] [INFO ] Time to serialize properties into /tmp/LTL13746852266539416648.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15577041639610733198.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10657784876304678594.hoa' '-atoms' '/tmp/LTL13746852266539416648.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL13746852266539416648.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10657784876304678594.hoa
Detected timeout of ITS tools.
[2025-06-01 17:41:40] [INFO ] Flatten gal took : 10 ms
[2025-06-01 17:41:40] [INFO ] Flatten gal took : 11 ms
[2025-06-01 17:41:40] [INFO ] Time to serialize gal into /tmp/LTL9568729113766863986.gal : 2 ms
[2025-06-01 17:41:40] [INFO ] Time to serialize properties into /tmp/LTL78644105415061934.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9568729113766863986.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL78644105415061934.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...273
Read 1 LTL properties
Checking formula 0 : !(((("((((P_electionInit_1+P_electionInit_2)+(P_electionInit_3+P_electionInit_4))+((P_electionInit_5+P_electionInit_6)+P_electionInit_...455
Formula 0 simplified : (!"((((P_electionInit_1+P_electionInit_2)+(P_electionInit_3+P_electionInit_4))+((P_electionInit_5+P_electionInit_6)+P_electionInit_7...446
Detected timeout of ITS tools.
[2025-06-01 17:41:55] [INFO ] Flatten gal took : 16 ms
[2025-06-01 17:41:55] [INFO ] Applying decomposition
[2025-06-01 17:41:55] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph18081305053548853624.txt' '-o' '/tmp/graph18081305053548853624.bin' '-w' '/tmp/graph18081305053548853624.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18081305053548853624.bin' '-l' '-1' '-v' '-w' '/tmp/graph18081305053548853624.weights' '-q' '0' '-e' '0.001'
[2025-06-01 17:41:55] [INFO ] Decomposing Gal with order
[2025-06-01 17:41:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 17:41:55] [INFO ] Removed a total of 210 redundant transitions.
[2025-06-01 17:41:55] [INFO ] Flatten gal took : 35 ms
[2025-06-01 17:41:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 11 ms.
[2025-06-01 17:41:55] [INFO ] Time to serialize gal into /tmp/LTL15144722158759251429.gal : 5 ms
[2025-06-01 17:41:55] [INFO ] Time to serialize properties into /tmp/LTL14862508771006600924.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15144722158759251429.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14862508771006600924.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((("((((gu0.P_electionInit_1+gu0.P_electionInit_2)+(gu0.P_electionInit_3+gu0.P_electionInit_4))+((gu0.P_electionInit_5+gu0.P_electio...539
Formula 0 simplified : (!"((((gu0.P_electionInit_1+gu0.P_electionInit_2)+(gu0.P_electionInit_3+gu0.P_electionInit_4))+((gu0.P_electionInit_5+gu0.P_election...530
Detected timeout of ITS tools.
Treatment of property NeoElection-COL-7-LTLCardinality-01 finished in 125291 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))'
Support contains 217 out of 257 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 257/257 places, 295/295 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 257 transition count 288
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 250 transition count 288
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 243 transition count 281
Applied a total of 28 rules in 23 ms. Remains 243 /257 variables (removed 14) and now considering 281/295 (removed 14) transitions.
[2025-06-01 17:42:10] [INFO ] Flow matrix only has 245 transitions (discarded 36 similar events)
// Phase 1: matrix 245 rows 243 cols
[2025-06-01 17:42:10] [INFO ] Computed 13 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:42:11] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-01 17:42:11] [INFO ] Flow matrix only has 245 transitions (discarded 36 similar events)
[2025-06-01 17:42:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:42:11] [INFO ] State equation strengthened by 189 read => feed constraints.
[2025-06-01 17:42:11] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 17:42:11] [INFO ] Redundant transitions in 4 ms returned []
Running 274 sub problems to find dead transitions.
[2025-06-01 17:42:11] [INFO ] Flow matrix only has 245 transitions (discarded 36 similar events)
[2025-06-01 17:42:11] [INFO ] Invariant cache hit.
[2025-06-01 17:42:11] [INFO ] State equation strengthened by 189 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (OVERLAPS) 7/243 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:42:14] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:42:14] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Problem TDEAD231 is UNSAT
At refinement iteration 5 (OVERLAPS) 245/488 variables, 243/258 constraints. Problems are: Problem set: 1 solved, 273 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 189/447 constraints. Problems are: Problem set: 1 solved, 273 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 0/447 constraints. Problems are: Problem set: 1 solved, 273 unsolved
At refinement iteration 8 (OVERLAPS) 0/488 variables, 0/447 constraints. Problems are: Problem set: 1 solved, 273 unsolved
No progress, stopping.
After SMT solving in domain Real declared 488/488 variables, and 447 constraints, problems are : Problem set: 1 solved, 273 unsolved in 14772 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 243/243 constraints, ReadFeed: 189/189 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 273 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 273 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 2/8 constraints. Problems are: Problem set: 1 solved, 273 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 273 unsolved
At refinement iteration 3 (OVERLAPS) 7/243 variables, 7/15 constraints. Problems are: Problem set: 1 solved, 273 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 273 unsolved
At refinement iteration 5 (OVERLAPS) 245/488 variables, 243/258 constraints. Problems are: Problem set: 1 solved, 273 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 189/447 constraints. Problems are: Problem set: 1 solved, 273 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 273/720 constraints. Problems are: Problem set: 1 solved, 273 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 0/720 constraints. Problems are: Problem set: 1 solved, 273 unsolved
At refinement iteration 9 (OVERLAPS) 0/488 variables, 0/720 constraints. Problems are: Problem set: 1 solved, 273 unsolved
No progress, stopping.
After SMT solving in domain Int declared 488/488 variables, and 720 constraints, problems are : Problem set: 1 solved, 273 unsolved in 20645 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 243/243 constraints, ReadFeed: 189/189 constraints, PredecessorRefiner: 273/274 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35445ms problems are : Problem set: 1 solved, 273 unsolved
Search for dead transitions found 1 dead transitions in 35450ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 243/257 places, 280/295 transitions.
Applied a total of 0 rules in 15 ms. Remains 243 /243 variables (removed 0) and now considering 280/280 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 17:42:46] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 35775 ms. Remains : 243/257 places, 280/295 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-COL-7-LTLCardinality-03
Product exploration explored 100000 steps with 31600 reset in 424 ms.
Product exploration explored 100000 steps with 31628 reset in 416 ms.
Computed a total of 243 stabilizing places and 280 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 243 transition count 280
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
RANDOM walk for 9 steps (0 resets) in 7 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 184 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2025-06-01 17:42:48] [INFO ] Flow matrix only has 244 transitions (discarded 36 similar events)
// Phase 1: matrix 244 rows 243 cols
[2025-06-01 17:42:48] [INFO ] Computed 14 invariants in 1 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 17:42:57] [INFO ] [Real]Absence check using 14 positive place invariants in 365 ms returned sat
[2025-06-01 17:43:02] [INFO ] [Real]Absence check using state equation in 4657 ms returned sat
[2025-06-01 17:43:02] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 17:43:03] [INFO ] [Nat]Absence check using 14 positive place invariants in 355 ms returned sat
[2025-06-01 17:43:08] [INFO ] [Nat]Absence check using state equation in 4428 ms returned sat
[2025-06-01 17:43:08] [INFO ] State equation strengthened by 188 read => feed constraints.
[2025-06-01 17:43:08] [INFO ] [Nat]Added 188 Read/Feed constraints in 69 ms returned sat
[2025-06-01 17:43:08] [INFO ] Computed and/alt/rep : 261/653/231 causal constraints (skipped 6 transitions) in 14 ms.
[2025-06-01 17:43:08] [INFO ] Added : 2 causal constraints over 1 iterations in 68 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 217 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 280/280 transitions.
Applied a total of 0 rules in 8 ms. Remains 243 /243 variables (removed 0) and now considering 280/280 (removed 0) transitions.
[2025-06-01 17:43:08] [INFO ] Flow matrix only has 244 transitions (discarded 36 similar events)
[2025-06-01 17:43:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:43:08] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-01 17:43:08] [INFO ] Flow matrix only has 244 transitions (discarded 36 similar events)
[2025-06-01 17:43:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:43:08] [INFO ] State equation strengthened by 188 read => feed constraints.
[2025-06-01 17:43:08] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 17:43:08] [INFO ] Redundant transitions in 1 ms returned []
Running 273 sub problems to find dead transitions.
[2025-06-01 17:43:08] [INFO ] Flow matrix only has 244 transitions (discarded 36 similar events)
[2025-06-01 17:43:08] [INFO ] Invariant cache hit.
[2025-06-01 17:43:08] [INFO ] State equation strengthened by 188 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (OVERLAPS) 7/243 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:43:11] [INFO ] Deduced a trap composed of 2 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-01 17:43:11] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:43:11] [INFO ] Deduced a trap composed of 10 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-01 17:43:12] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 5 (OVERLAPS) 244/487 variables, 243/261 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/487 variables, 188/449 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/487 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 8 (OVERLAPS) 0/487 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 273 unsolved
No progress, stopping.
After SMT solving in domain Real declared 487/487 variables, and 449 constraints, problems are : Problem set: 0 solved, 273 unsolved in 14498 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 243/243 constraints, ReadFeed: 188/188 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (OVERLAPS) 7/243 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 6 (OVERLAPS) 244/487 variables, 243/261 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/487 variables, 188/449 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/487 variables, 273/722 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/487 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 10 (OVERLAPS) 0/487 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 273 unsolved
No progress, stopping.
After SMT solving in domain Int declared 487/487 variables, and 722 constraints, problems are : Problem set: 0 solved, 273 unsolved in 19397 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 243/243 constraints, ReadFeed: 188/188 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33926ms problems are : Problem set: 0 solved, 273 unsolved
Search for dead transitions found 0 dead transitions in 33928ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 34226 ms. Remains : 243/243 places, 280/280 transitions.
Computed a total of 243 stabilizing places and 280 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 243 transition count 280
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 165 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 9 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 194 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
[2025-06-01 17:43:43] [INFO ] Flow matrix only has 244 transitions (discarded 36 similar events)
[2025-06-01 17:43:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 17:43:52] [INFO ] [Real]Absence check using 14 positive place invariants in 358 ms returned sat
[2025-06-01 17:43:56] [INFO ] [Real]Absence check using state equation in 4533 ms returned sat
[2025-06-01 17:43:56] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 17:43:58] [INFO ] [Nat]Absence check using 14 positive place invariants in 268 ms returned sat
[2025-06-01 17:44:02] [INFO ] [Nat]Absence check using state equation in 4459 ms returned sat
[2025-06-01 17:44:02] [INFO ] State equation strengthened by 188 read => feed constraints.
[2025-06-01 17:44:03] [INFO ] [Nat]Added 188 Read/Feed constraints in 192 ms returned sat
[2025-06-01 17:44:03] [INFO ] Computed and/alt/rep : 261/653/231 causal constraints (skipped 6 transitions) in 14 ms.
[2025-06-01 17:44:03] [INFO ] Added : 2 causal constraints over 1 iterations in 269 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Product exploration explored 100000 steps with 31651 reset in 373 ms.
Product exploration explored 100000 steps with 31605 reset in 359 ms.
Built C files in :
/tmp/ltsmin15653874651182956399
[2025-06-01 17:44:04] [INFO ] Computing symmetric may disable matrix : 280 transitions.
[2025-06-01 17:44:04] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 17:44:04] [INFO ] Computing symmetric may enable matrix : 280 transitions.
[2025-06-01 17:44:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 17:44:04] [INFO ] Computing Do-Not-Accords matrix : 280 transitions.
[2025-06-01 17:44:04] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 17:44:04] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15653874651182956399
Running compilation step : cd /tmp/ltsmin15653874651182956399;'/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 586 ms.
Running link step : cd /tmp/ltsmin15653874651182956399;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin15653874651182956399;'/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/stateBased13454607486185051361.hoa' '--buchi-type=spotba'
LTSmin run took 694 ms.
FORMULA NeoElection-COL-7-LTLCardinality-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property NeoElection-COL-7-LTLCardinality-03 finished in 114593 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) U X(p1)))'
Support contains 217 out of 257 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 295/295 transitions.
Applied a total of 0 rules in 2 ms. Remains 257 /257 variables (removed 0) and now considering 295/295 (removed 0) transitions.
[2025-06-01 17:44:05] [INFO ] Flow matrix only has 259 transitions (discarded 36 similar events)
// Phase 1: matrix 259 rows 257 cols
[2025-06-01 17:44:05] [INFO ] Computed 13 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:44:05] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-01 17:44:05] [INFO ] Flow matrix only has 259 transitions (discarded 36 similar events)
[2025-06-01 17:44:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:44:05] [INFO ] State equation strengthened by 21 read => feed constraints.
[2025-06-01 17:44:05] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Running 288 sub problems to find dead transitions.
[2025-06-01 17:44:05] [INFO ] Flow matrix only has 259 transitions (discarded 36 similar events)
[2025-06-01 17:44:05] [INFO ] Invariant cache hit.
[2025-06-01 17:44:05] [INFO ] State equation strengthened by 21 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (OVERLAPS) 7/257 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 288 unsolved
Problem TDEAD47 is UNSAT
At refinement iteration 4 (OVERLAPS) 259/516 variables, 257/270 constraints. Problems are: Problem set: 1 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/516 variables, 21/291 constraints. Problems are: Problem set: 1 solved, 287 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:13] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:13] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:13] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:13] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:13] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:13] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:15] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:15] [INFO ] Deduced a trap composed of 6 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-01 17:44:15] [INFO ] Deduced a trap composed of 6 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-01 17:44:15] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:15] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:15] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:15] [INFO ] Deduced a trap composed of 7 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-01 17:44:15] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:15] [INFO ] Deduced a trap composed of 9 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-01 17:44:15] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:15] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:15] [INFO ] Deduced a trap composed of 12 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-01 17:44:15] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:15] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 20/311 constraints. Problems are: Problem set: 1 solved, 287 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:19] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:19] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:19] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:19] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:20] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:20] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:20] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:20] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:20] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:20] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:20] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:20] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:20] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/516 variables, 13/324 constraints. Problems are: Problem set: 1 solved, 287 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:21] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:21] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:21] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:21] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:21] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:21] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:23] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:23] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:23] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:23] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:23] [INFO ] Deduced a trap composed of 12 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-01 17:44:23] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:23] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:23] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:23] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:23] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:24] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:24] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:24] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:24] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/516 variables, 20/344 constraints. Problems are: Problem set: 1 solved, 287 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:24] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:24] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:24] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:26] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:26] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:26] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:26] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:26] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:26] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:27] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:27] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:27] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/516 variables, 12/356 constraints. Problems are: Problem set: 1 solved, 287 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:29] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:31] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:31] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:31] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:31] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:31] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:32] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:32] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:32] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/516 variables, 9/365 constraints. Problems are: Problem set: 1 solved, 287 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:32] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:32] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:44:32] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/516 variables, 3/368 constraints. Problems are: Problem set: 1 solved, 287 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 516/516 variables, and 368 constraints, problems are : Problem set: 1 solved, 287 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 257/257 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 77/77 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 287 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 287 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 287 unsolved
At refinement iteration 2 (OVERLAPS) 7/257 variables, 7/13 constraints. Problems are: Problem set: 1 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 77/90 constraints. Problems are: Problem set: 1 solved, 287 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 0/90 constraints. Problems are: Problem set: 1 solved, 287 unsolved
At refinement iteration 5 (OVERLAPS) 259/516 variables, 257/347 constraints. Problems are: Problem set: 1 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 21/368 constraints. Problems are: Problem set: 1 solved, 287 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/516 variables, 287/655 constraints. Problems are: Problem set: 1 solved, 287 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/516 variables, 0/655 constraints. Problems are: Problem set: 1 solved, 287 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:02] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:02] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 4 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/516 variables, 2/657 constraints. Problems are: Problem set: 1 solved, 287 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 516/516 variables, and 657 constraints, problems are : Problem set: 1 solved, 287 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 257/257 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 287/288 constraints, Known Traps: 79/79 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60097ms problems are : Problem set: 1 solved, 287 unsolved
Search for dead transitions found 1 dead transitions in 60099ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 257/257 places, 294/295 transitions.
Applied a total of 0 rules in 1 ms. Remains 257 /257 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60330 ms. Remains : 257/257 places, 294/295 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : NeoElection-COL-7-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 259 ms.
Product exploration explored 100000 steps with 50000 reset in 269 ms.
Computed a total of 257 stabilizing places and 294 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 257 transition count 294
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 19 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-7-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-7-LTLCardinality-05 finished in 61227 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 7 out of 257 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 295/295 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 220 transition count 243
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 220 transition count 243
Applied a total of 74 rules in 14 ms. Remains 220 /257 variables (removed 37) and now considering 243/295 (removed 52) transitions.
[2025-06-01 17:45:06] [INFO ] Flow matrix only has 207 transitions (discarded 36 similar events)
// Phase 1: matrix 207 rows 220 cols
[2025-06-01 17:45:06] [INFO ] Computed 13 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:45:06] [INFO ] Implicit Places using invariants in 94 ms returned []
[2025-06-01 17:45:06] [INFO ] Flow matrix only has 207 transitions (discarded 36 similar events)
[2025-06-01 17:45:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:45:06] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-01 17:45:07] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
Running 236 sub problems to find dead transitions.
[2025-06-01 17:45:07] [INFO ] Flow matrix only has 207 transitions (discarded 36 similar events)
[2025-06-01 17:45:07] [INFO ] Invariant cache hit.
[2025-06-01 17:45:07] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/213 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (OVERLAPS) 7/220 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 236 unsolved
Problem TDEAD18 is UNSAT
At refinement iteration 4 (OVERLAPS) 207/427 variables, 220/233 constraints. Problems are: Problem set: 1 solved, 235 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/427 variables, 6/239 constraints. Problems are: Problem set: 1 solved, 235 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:12] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:12] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:12] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:12] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:12] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:12] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:12] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:12] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:12] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:13] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:13] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:13] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:13] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:14] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:14] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:14] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:14] [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-01 17:45:14] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:14] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:14] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/427 variables, 20/259 constraints. Problems are: Problem set: 1 solved, 235 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:17] [INFO ] Deduced a trap composed of 8 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-01 17:45:17] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:17] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:17] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:17] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:17] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:17] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:17] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:17] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:17] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:17] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:18] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:18] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/427 variables, 13/272 constraints. Problems are: Problem set: 1 solved, 235 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:19] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:19] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:19] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:19] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:19] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:20] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:20] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:20] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:20] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/427 variables, 9/281 constraints. Problems are: Problem set: 1 solved, 235 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:20] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:20] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:20] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:20] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:20] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:20] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:20] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:20] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:21] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/427 variables, 9/290 constraints. Problems are: Problem set: 1 solved, 235 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:23] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:23] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:23] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:23] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:24] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:24] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:24] [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-01 17:45:24] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/427 variables, 8/298 constraints. Problems are: Problem set: 1 solved, 235 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/427 variables, 0/298 constraints. Problems are: Problem set: 1 solved, 235 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:29] [INFO ] Deduced a trap along path composed of 5 places in 39 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:30] [INFO ] Deduced a trap along path composed of 5 places in 43 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/427 variables, 2/300 constraints. Problems are: Problem set: 1 solved, 235 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/427 variables, 0/300 constraints. Problems are: Problem set: 1 solved, 235 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:35] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:36] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:36] [INFO ] Deduced a trap composed of 10 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-01 17:45:36] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:36] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 5 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/427 variables, 5/305 constraints. Problems are: Problem set: 1 solved, 235 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 427/427 variables, and 305 constraints, problems are : Problem set: 1 solved, 235 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 220/220 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 64/64 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 1 solved, 235 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 235 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/213 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 235 unsolved
At refinement iteration 2 (OVERLAPS) 7/220 variables, 7/13 constraints. Problems are: Problem set: 1 solved, 235 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 64/77 constraints. Problems are: Problem set: 1 solved, 235 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/77 constraints. Problems are: Problem set: 1 solved, 235 unsolved
At refinement iteration 5 (OVERLAPS) 207/427 variables, 220/297 constraints. Problems are: Problem set: 1 solved, 235 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/427 variables, 6/303 constraints. Problems are: Problem set: 1 solved, 235 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/427 variables, 235/538 constraints. Problems are: Problem set: 1 solved, 235 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:42] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:42] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:45:42] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/427 variables, 3/541 constraints. Problems are: Problem set: 1 solved, 235 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/427 variables, 2/543 constraints. Problems are: Problem set: 1 solved, 235 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/427 variables, 0/543 constraints. Problems are: Problem set: 1 solved, 235 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 427/427 variables, and 543 constraints, problems are : Problem set: 1 solved, 235 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 220/220 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 235/236 constraints, Known Traps: 67/67 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60084ms problems are : Problem set: 1 solved, 235 unsolved
Search for dead transitions found 1 dead transitions in 60085ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 220/257 places, 242/295 transitions.
Applied a total of 0 rules in 2 ms. Remains 220 /220 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60399 ms. Remains : 220/257 places, 242/295 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-7-LTLCardinality-07
Product exploration explored 100000 steps with 2582 reset in 188 ms.
Product exploration explored 100000 steps with 2569 reset in 198 ms.
Computed a total of 220 stabilizing places and 242 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 220 transition count 242
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 77 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 81 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 140 steps (0 resets) in 5 ms. (23 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 121 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 66 ms :[(NOT p0), (NOT p0)]
[2025-06-01 17:46:08] [INFO ] Flow matrix only has 206 transitions (discarded 36 similar events)
// Phase 1: matrix 206 rows 220 cols
[2025-06-01 17:46:08] [INFO ] Computed 14 invariants in 2 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 17:46:08] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 17:46:08] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2025-06-01 17:46:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 17:46:08] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 17:46:08] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2025-06-01 17:46:08] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-01 17:46:08] [INFO ] [Nat]Added 5 Read/Feed constraints in 8 ms returned sat
[2025-06-01 17:46:08] [INFO ] Computed and/alt/rep : 228/493/192 causal constraints (skipped 7 transitions) in 12 ms.
[2025-06-01 17:46:09] [INFO ] Added : 108 causal constraints over 22 iterations in 543 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 7 out of 220 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 220/220 places, 242/242 transitions.
Reduce places removed 7 places and 7 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 213 transition count 228
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 206 transition count 228
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 0 with 70 rules applied. Total rules applied 84 place count 171 transition count 193
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 91 place count 164 transition count 186
Applied a total of 91 rules in 25 ms. Remains 164 /220 variables (removed 56) and now considering 186/242 (removed 56) transitions.
[2025-06-01 17:46:09] [INFO ] Flow matrix only has 150 transitions (discarded 36 similar events)
// Phase 1: matrix 150 rows 164 cols
[2025-06-01 17:46:09] [INFO ] Computed 14 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:46:09] [INFO ] Implicit Places using invariants in 84 ms returned []
[2025-06-01 17:46:09] [INFO ] Flow matrix only has 150 transitions (discarded 36 similar events)
[2025-06-01 17:46:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:46:09] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-01 17:46:09] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 17:46:09] [INFO ] Redundant transitions in 0 ms returned []
Running 179 sub problems to find dead transitions.
[2025-06-01 17:46:09] [INFO ] Flow matrix only has 150 transitions (discarded 36 similar events)
[2025-06-01 17:46:09] [INFO ] Invariant cache hit.
[2025-06-01 17:46:09] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 7/164 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 150/314 variables, 164/178 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 5/183 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (OVERLAPS) 0/314 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 183 constraints, problems are : Problem set: 0 solved, 179 unsolved in 6741 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 164/164 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 7/164 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 150/314 variables, 164/178 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 5/183 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 179/362 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (OVERLAPS) 0/314 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 362 constraints, problems are : Problem set: 0 solved, 179 unsolved in 8463 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 164/164 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15240ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 15241ms
Starting structural reductions in SI_LTL mode, iteration 1 : 164/220 places, 186/242 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15492 ms. Remains : 164/220 places, 186/242 transitions.
Computed a total of 164 stabilizing places and 186 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 164 transition count 186
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p0), (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 20 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-7-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-7-LTLCardinality-07 finished in 78050 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(!p0))))))'
Support contains 7 out of 257 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 295/295 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 220 transition count 243
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 220 transition count 243
Applied a total of 74 rules in 8 ms. Remains 220 /257 variables (removed 37) and now considering 243/295 (removed 52) transitions.
[2025-06-01 17:46:24] [INFO ] Flow matrix only has 207 transitions (discarded 36 similar events)
// Phase 1: matrix 207 rows 220 cols
[2025-06-01 17:46:24] [INFO ] Computed 13 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:46:24] [INFO ] Implicit Places using invariants in 96 ms returned []
[2025-06-01 17:46:24] [INFO ] Flow matrix only has 207 transitions (discarded 36 similar events)
[2025-06-01 17:46:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:46:24] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-01 17:46:25] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
Running 236 sub problems to find dead transitions.
[2025-06-01 17:46:25] [INFO ] Flow matrix only has 207 transitions (discarded 36 similar events)
[2025-06-01 17:46:25] [INFO ] Invariant cache hit.
[2025-06-01 17:46:25] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/213 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (OVERLAPS) 7/220 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 236 unsolved
Problem TDEAD18 is UNSAT
At refinement iteration 4 (OVERLAPS) 207/427 variables, 220/233 constraints. Problems are: Problem set: 1 solved, 235 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/427 variables, 6/239 constraints. Problems are: Problem set: 1 solved, 235 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:30] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:30] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:30] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:30] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:30] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:30] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:30] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:30] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:30] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:31] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:31] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:31] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:31] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:32] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:32] [INFO ] Deduced a trap composed of 7 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-01 17:46:32] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:32] [INFO ] Deduced a trap composed of 7 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-01 17:46:32] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:32] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:32] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/427 variables, 20/259 constraints. Problems are: Problem set: 1 solved, 235 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:35] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:35] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:35] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:35] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:35] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:35] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:35] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:35] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:35] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:35] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:35] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:36] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:36] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/427 variables, 13/272 constraints. Problems are: Problem set: 1 solved, 235 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:37] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:37] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:37] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:37] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:37] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:38] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:38] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:38] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:38] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/427 variables, 9/281 constraints. Problems are: Problem set: 1 solved, 235 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:38] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:38] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:38] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:38] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:38] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:38] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:38] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:38] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:39] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/427 variables, 9/290 constraints. Problems are: Problem set: 1 solved, 235 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:41] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:41] [INFO ] Deduced a trap composed of 9 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-01 17:46:41] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:41] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:41] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:42] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:42] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:42] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/427 variables, 8/298 constraints. Problems are: Problem set: 1 solved, 235 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/427 variables, 0/298 constraints. Problems are: Problem set: 1 solved, 235 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:47] [INFO ] Deduced a trap along path composed of 5 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:48] [INFO ] Deduced a trap along path composed of 5 places in 32 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/427 variables, 2/300 constraints. Problems are: Problem set: 1 solved, 235 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/427 variables, 0/300 constraints. Problems are: Problem set: 1 solved, 235 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:53] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:53] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:53] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:53] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:46:53] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 3 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/427 variables, 5/305 constraints. Problems are: Problem set: 1 solved, 235 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 427/427 variables, and 305 constraints, problems are : Problem set: 1 solved, 235 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 220/220 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 64/64 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 1 solved, 235 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 235 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/213 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 235 unsolved
At refinement iteration 2 (OVERLAPS) 7/220 variables, 7/13 constraints. Problems are: Problem set: 1 solved, 235 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 64/77 constraints. Problems are: Problem set: 1 solved, 235 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/77 constraints. Problems are: Problem set: 1 solved, 235 unsolved
At refinement iteration 5 (OVERLAPS) 207/427 variables, 220/297 constraints. Problems are: Problem set: 1 solved, 235 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/427 variables, 6/303 constraints. Problems are: Problem set: 1 solved, 235 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/427 variables, 235/538 constraints. Problems are: Problem set: 1 solved, 235 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:00] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:00] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:00] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/427 variables, 3/541 constraints. Problems are: Problem set: 1 solved, 235 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/427 variables, 2/543 constraints. Problems are: Problem set: 1 solved, 235 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/427 variables, 0/543 constraints. Problems are: Problem set: 1 solved, 235 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 427/427 variables, and 543 constraints, problems are : Problem set: 1 solved, 235 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 220/220 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 235/236 constraints, Known Traps: 67/67 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60068ms problems are : Problem set: 1 solved, 235 unsolved
Search for dead transitions found 1 dead transitions in 60069ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 220/257 places, 242/295 transitions.
Applied a total of 0 rules in 4 ms. Remains 220 /220 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60370 ms. Remains : 220/257 places, 242/295 transitions.
Stuttering acceptance computed with spot in 217 ms :[p0, p0, p0, p0, p0]
Running random walk in product with property : NeoElection-COL-7-LTLCardinality-09
Product exploration explored 100000 steps with 5228 reset in 156 ms.
Product exploration explored 100000 steps with 5209 reset in 172 ms.
Computed a total of 220 stabilizing places and 242 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 220 transition count 242
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p0, (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 15 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-7-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-7-LTLCardinality-09 finished in 61026 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) U X(p1))&&F(G(p0))))'
Support contains 14 out of 257 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 295/295 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 227 transition count 250
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 227 transition count 250
Applied a total of 60 rules in 10 ms. Remains 227 /257 variables (removed 30) and now considering 250/295 (removed 45) transitions.
[2025-06-01 17:47:25] [INFO ] Flow matrix only has 214 transitions (discarded 36 similar events)
// Phase 1: matrix 214 rows 227 cols
[2025-06-01 17:47:25] [INFO ] Computed 13 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:47:25] [INFO ] Implicit Places using invariants in 92 ms returned []
[2025-06-01 17:47:25] [INFO ] Flow matrix only has 214 transitions (discarded 36 similar events)
[2025-06-01 17:47:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:47:26] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-01 17:47:26] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Running 243 sub problems to find dead transitions.
[2025-06-01 17:47:26] [INFO ] Flow matrix only has 214 transitions (discarded 36 similar events)
[2025-06-01 17:47:26] [INFO ] Invariant cache hit.
[2025-06-01 17:47:26] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (OVERLAPS) 7/227 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 243 unsolved
Problem TDEAD18 is UNSAT
At refinement iteration 4 (OVERLAPS) 214/441 variables, 227/240 constraints. Problems are: Problem set: 1 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 6/246 constraints. Problems are: Problem set: 1 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:32] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:32] [INFO ] Deduced a trap composed of 6 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-01 17:47:32] [INFO ] Deduced a trap composed of 6 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-01 17:47:32] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:32] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:32] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:32] [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-01 17:47:32] [INFO ] Deduced a trap composed of 8 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-01 17:47:32] [INFO ] Deduced a trap composed of 9 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-01 17:47:32] [INFO ] Deduced a trap composed of 10 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-01 17:47:33] [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-01 17:47:33] [INFO ] Deduced a trap composed of 12 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-01 17:47:33] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:33] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:33] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:33] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:33] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:33] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:33] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:33] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 20/266 constraints. Problems are: Problem set: 1 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:35] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:35] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:35] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:35] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:35] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:36] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:36] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:36] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:36] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:36] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:36] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:36] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:36] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:36] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:36] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:36] [INFO ] Deduced a trap composed of 10 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-01 17:47:36] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:36] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:36] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:36] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 20/286 constraints. Problems are: Problem set: 1 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:37] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:37] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:37] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:37] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:37] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:37] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:37] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:37] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:37] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:37] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:37] [INFO ] Deduced a trap composed of 8 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-01 17:47:37] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:37] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:39] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:39] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:39] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:39] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:39] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:39] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:39] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/441 variables, 20/306 constraints. Problems are: Problem set: 1 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:41] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:41] [INFO ] Deduced a trap composed of 9 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-01 17:47:41] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:41] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/441 variables, 4/310 constraints. Problems are: Problem set: 1 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:43] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:43] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:43] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:43] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:44] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:44] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/441 variables, 6/316 constraints. Problems are: Problem set: 1 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:45] [INFO ] Deduced a trap along path composed of 9 places in 29 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/441 variables, 1/317 constraints. Problems are: Problem set: 1 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:47] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/441 variables, 1/318 constraints. Problems are: Problem set: 1 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:51] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:51] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/441 variables, 2/320 constraints. Problems are: Problem set: 1 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:51] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:51] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:47:52] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/441 variables, 3/323 constraints. Problems are: Problem set: 1 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 441/441 variables, and 323 constraints, problems are : Problem set: 1 solved, 242 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 227/227 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 76/76 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 242 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 7/227 variables, 7/13 constraints. Problems are: Problem set: 1 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 76/89 constraints. Problems are: Problem set: 1 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/89 constraints. Problems are: Problem set: 1 solved, 242 unsolved
At refinement iteration 5 (OVERLAPS) 214/441 variables, 227/316 constraints. Problems are: Problem set: 1 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 6/322 constraints. Problems are: Problem set: 1 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 242/564 constraints. Problems are: Problem set: 1 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:48:02] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:48:02] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/441 variables, 2/566 constraints. Problems are: Problem set: 1 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:48:09] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:48:09] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:48:09] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/441 variables, 3/569 constraints. Problems are: Problem set: 1 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:48:16] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/441 variables, 1/570 constraints. Problems are: Problem set: 1 solved, 242 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/441 variables, 1/571 constraints. Problems are: Problem set: 1 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 441/441 variables, and 571 constraints, problems are : Problem set: 1 solved, 242 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 227/227 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 242/243 constraints, Known Traps: 82/82 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60072ms problems are : Problem set: 1 solved, 242 unsolved
Search for dead transitions found 1 dead transitions in 60073ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 227/257 places, 249/295 transitions.
Applied a total of 0 rules in 2 ms. Remains 227 /227 variables (removed 0) and now considering 249/249 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60341 ms. Remains : 227/257 places, 249/295 transitions.
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : NeoElection-COL-7-LTLCardinality-10
Stuttering criterion allowed to conclude after 753 steps with 4 reset in 4 ms.
FORMULA NeoElection-COL-7-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-7-LTLCardinality-10 finished in 60586 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' '!(((p0||X(G(p0))) U G(!p0)))'
[2025-06-01 17:48:26] [INFO ] Flatten gal took : 20 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14184358567840050450
[2025-06-01 17:48:26] [INFO ] Computing symmetric may disable matrix : 295 transitions.
[2025-06-01 17:48:26] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 17:48:26] [INFO ] Computing symmetric may enable matrix : 295 transitions.
[2025-06-01 17:48:26] [INFO ] Applying decomposition
[2025-06-01 17:48:26] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 17:48:26] [INFO ] Computing Do-Not-Accords matrix : 295 transitions.
[2025-06-01 17:48:26] [INFO ] Flatten gal took : 16 ms
[2025-06-01 17:48:26] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 17:48:26] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14184358567840050450
Running compilation step : cd /tmp/ltsmin14184358567840050450;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' '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'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6814794819947672449.txt' '-o' '/tmp/graph6814794819947672449.bin' '-w' '/tmp/graph6814794819947672449.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6814794819947672449.bin' '-l' '-1' '-v' '-w' '/tmp/graph6814794819947672449.weights' '-q' '0' '-e' '0.001'
[2025-06-01 17:48:26] [INFO ] Decomposing Gal with order
[2025-06-01 17:48:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 17:48:26] [INFO ] Removed a total of 50 redundant transitions.
[2025-06-01 17:48:26] [INFO ] Flatten gal took : 29 ms
[2025-06-01 17:48:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 45 labels/synchronizations in 4 ms.
[2025-06-01 17:48:26] [INFO ] Time to serialize gal into /tmp/LTLCardinality17218543533646297148.gal : 4 ms
[2025-06-01 17:48:26] [INFO ] Time to serialize properties into /tmp/LTLCardinality14653927982511880571.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17218543533646297148.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14653927982511880571.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 1 LTL properties
Checking formula 0 : !(((("((((gu1.P_electionInit_1+gu1.P_electionInit_2)+(gu1.P_electionInit_3+gu1.P_electionInit_4))+((gu1.P_electionInit_5+gu1.P_electio...539
Formula 0 simplified : (!"((((gu1.P_electionInit_1+gu1.P_electionInit_2)+(gu1.P_electionInit_3+gu1.P_electionInit_4))+((gu1.P_electionInit_5+gu1.P_election...530
Compilation finished in 631 ms.
Running link step : cd /tmp/ltsmin14184358567840050450;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin14184358567840050450;'/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' '--ltl' '(((LTLAPp0==true)||X([]((LTLAPp0==true)))) U [](!(LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.009: LTL layer: formula: (((LTLAPp0==true)||X([]((LTLAPp0==true)))) U [](!(LTLAPp0==true)))
pins2lts-mc-linux64( 6/ 8), 0.009: "(((LTLAPp0==true)||X([]((LTLAPp0==true)))) U [](!(LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.010: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.037: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.107: DFS-FIFO for weak LTL, using special progress label 297
pins2lts-mc-linux64( 0/ 8), 0.107: There are 298 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.107: State length is 258, there are 300 groups
pins2lts-mc-linux64( 0/ 8), 0.107: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.107: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.107: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.107: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.246: ~106 levels ~960 states ~8512 transitions
pins2lts-mc-linux64( 0/ 8), 0.354: ~211 levels ~1920 states ~17536 transitions
pins2lts-mc-linux64( 2/ 8), 0.479: ~416 levels ~3840 states ~30728 transitions
pins2lts-mc-linux64( 6/ 8), 0.553: ~416 levels ~7680 states ~46616 transitions
pins2lts-mc-linux64( 6/ 8), 0.689: ~416 levels ~15360 states ~78392 transitions
pins2lts-mc-linux64( 1/ 8), 0.875: ~415 levels ~30720 states ~138936 transitions
pins2lts-mc-linux64( 1/ 8), 1.295: ~415 levels ~61440 states ~288640 transitions
pins2lts-mc-linux64( 1/ 8), 2.134: ~415 levels ~122880 states ~617672 transitions
pins2lts-mc-linux64( 1/ 8), 3.557: ~415 levels ~245760 states ~1278976 transitions
pins2lts-mc-linux64( 5/ 8), 5.732: ~416 levels ~491520 states ~2357480 transitions
pins2lts-mc-linux64( 5/ 8), 9.327: ~416 levels ~983040 states ~4849528 transitions
pins2lts-mc-linux64( 5/ 8), 16.585: ~416 levels ~1966080 states ~9988800 transitions
pins2lts-mc-linux64( 5/ 8), 31.610: ~416 levels ~3932160 states ~20618248 transitions
pins2lts-mc-linux64( 5/ 8), 62.471: ~416 levels ~7864320 states ~44433984 transitions
pins2lts-mc-linux64( 0/ 8), 127.065: ~415 levels ~15728640 states ~94702272 transitions
pins2lts-mc-linux64( 0/ 8), 254.318: ~415 levels ~31457280 states ~194845992 transitions
pins2lts-mc-linux64( 5/ 8), 514.788: ~416 levels ~62914560 states ~391900576 transitions
pins2lts-mc-linux64( 6/ 8), 586.655: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 586.727:
pins2lts-mc-linux64( 0/ 8), 586.727: mean standard work distribution: 2.3% (states) 1.1% (transitions)
pins2lts-mc-linux64( 0/ 8), 586.727:
pins2lts-mc-linux64( 0/ 8), 586.727: Explored 67096984 states 443187114 transitions, fanout: 6.605
pins2lts-mc-linux64( 0/ 8), 586.727: Total exploration time 586.610 sec (586.550 sec minimum, 586.574 sec on average)
pins2lts-mc-linux64( 0/ 8), 586.727: States per second: 114381, Transitions per second: 755506
pins2lts-mc-linux64( 0/ 8), 586.727:
pins2lts-mc-linux64( 0/ 8), 586.727: Progress states detected: 67096414
pins2lts-mc-linux64( 0/ 8), 586.727: Redundant explorations: -50.0087
pins2lts-mc-linux64( 0/ 8), 586.727:
pins2lts-mc-linux64( 0/ 8), 586.727: Queue width: 8B, total height: 67099718, memory: 511.93MB
pins2lts-mc-linux64( 0/ 8), 586.727: Tree memory: 1030.8MB, 8.1 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 586.727: Tree fill ratio (roots/leafs): 99.0%/2.0%
pins2lts-mc-linux64( 0/ 8), 586.727: Stored 301 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 586.727: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 586.727: Est. total memory use: 1542.7MB (~1535.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14184358567840050450;'/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' '--ltl' '(((LTLAPp0==true)||X([]((LTLAPp0==true)))) U [](!(LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14184358567840050450;'/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' '--ltl' '(((LTLAPp0==true)||X([]((LTLAPp0==true)))) U [](!(LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-06-01 18:11:18] [INFO ] Applying decomposition
[2025-06-01 18:11:18] [INFO ] Flatten gal took : 170 ms
[2025-06-01 18:11:19] [INFO ] Decomposing Gal with order
[2025-06-01 18:11:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 18:11:19] [INFO ] Removed a total of 422 redundant transitions.
[2025-06-01 18:11:19] [INFO ] Flatten gal took : 141 ms
[2025-06-01 18:11:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2025-06-01 18:11:19] [INFO ] Time to serialize gal into /tmp/LTLCardinality2297000190187775359.gal : 30 ms
[2025-06-01 18:11:19] [INFO ] Time to serialize properties into /tmp/LTLCardinality14336116156276707613.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2297000190187775359.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14336116156276707613.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !(((("((((gM1.P_electionInit_1+gM2.P_electionInit_2)+(gM3.P_electionInit_3+gM4.P_electionInit_4))+((gM5.P_electionInit_5+gM6.P_electio...539
Formula 0 simplified : (!"((((gM1.P_electionInit_1+gM2.P_electionInit_2)+(gM3.P_electionInit_3+gM4.P_electionInit_4))+((gM5.P_electionInit_5+gM6.P_election...530
Detected timeout of ITS tools.
[2025-06-01 18:34:11] [INFO ] Flatten gal took : 508 ms
[2025-06-01 18:34:12] [INFO ] Input system was already deterministic with 295 transitions.
[2025-06-01 18:34:12] [INFO ] Transformed 257 places.
[2025-06-01 18:34:12] [INFO ] Transformed 295 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-01 18:34:12] [INFO ] Time to serialize gal into /tmp/LTLCardinality1265838564239693780.gal : 14 ms
[2025-06-01 18:34:12] [INFO ] Time to serialize properties into /tmp/LTLCardinality12743223141080365477.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality1265838564239693780.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12743223141080365477.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((("((((P_electionInit_1+P_electionInit_2)+(P_electionInit_3+P_electionInit_4))+((P_electionInit_5+P_electionInit_6)+P_electionInit_...455
Formula 0 simplified : (!"((((P_electionInit_1+P_electionInit_2)+(P_electionInit_3+P_electionInit_4))+((P_electionInit_5+P_electionInit_6)+P_electionInit_7...446

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NeoElection-COL-7"
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 NeoElection-COL-7, 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 r142-tall-174876811900083"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NeoElection-COL-7.tgz
mv NeoElection-COL-7 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 ;