fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r142-tall-174876811900065
Last Updated
June 24, 2025

About the Execution of ITS-Tools for NeoElection-COL-5

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 3600000.00 0.00 0.00 FTTTFTFFFFFT?TTF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K 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 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K 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 89K 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-5-CTLCardinality-2025-00
FORMULA_NAME NeoElection-COL-5-CTLCardinality-2025-01
FORMULA_NAME NeoElection-COL-5-CTLCardinality-2025-02
FORMULA_NAME NeoElection-COL-5-CTLCardinality-2025-03
FORMULA_NAME NeoElection-COL-5-CTLCardinality-2025-04
FORMULA_NAME NeoElection-COL-5-CTLCardinality-2025-05
FORMULA_NAME NeoElection-COL-5-CTLCardinality-2025-06
FORMULA_NAME NeoElection-COL-5-CTLCardinality-2025-07
FORMULA_NAME NeoElection-COL-5-CTLCardinality-2025-08
FORMULA_NAME NeoElection-COL-5-CTLCardinality-2025-09
FORMULA_NAME NeoElection-COL-5-CTLCardinality-2025-10
FORMULA_NAME NeoElection-COL-5-CTLCardinality-2025-11
FORMULA_NAME NeoElection-COL-5-CTLCardinality-2025-12
FORMULA_NAME NeoElection-COL-5-CTLCardinality-2025-13
FORMULA_NAME NeoElection-COL-5-CTLCardinality-2025-14
FORMULA_NAME NeoElection-COL-5-CTLCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748795977855

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeoElection-COL-5
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLCardinality COL
Running Version 202505121319
[2025-06-01 16:39:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 16:39:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 16:39:39] [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 16:39:39] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-01 16:39:39] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 622 ms
[2025-06-01 16:39:39] [INFO ] Detected 6 constant HL places corresponding to 1500 PT places.
[2025-06-01 16:39:39] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 3090 PT places and 7716.0 transition bindings in 27 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
[2025-06-01 16:39:39] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 5 ms.
[2025-06-01 16:39:39] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
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.4 ms
Remains 16 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-5-CTLCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-CTLCardinality-2025-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 2 stable transitions
RANDOM walk for 40000 steps (1228 resets) in 884 ms. (45 steps per ms) remains 11/23 properties
BEST_FIRST walk for 40003 steps (8 resets) in 233 ms. (170 steps per ms) remains 8/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 283 ms. (140 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (214 resets) in 98 ms. (404 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (203 resets) in 86 ms. (459 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (251 resets) in 86 ms. (459 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (240 resets) in 141 ms. (281 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (237 resets) in 78 ms. (506 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (242 resets) in 153 ms. (259 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 8/8 properties
// Phase 1: matrix 7 rows 6 cols
[2025-06-01 16:39:40] [INFO ] Computed 1 invariants in 3 ms
[2025-06-01 16:39:40] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
After SMT solving in domain Real declared 5/13 variables, and 1 constraints, problems are : Problem set: 8 solved, 0 unsolved in 158 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/6 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 209ms problems are : Problem set: 8 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 8 atomic propositions for a total of 12 simplifications.
[2025-06-01 16:39:40] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2025-06-01 16:39:40] [INFO ] Flatten gal took : 12 ms
FORMULA NeoElection-COL-5-CTLCardinality-2025-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-CTLCardinality-2025-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-CTLCardinality-2025-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-CTLCardinality-2025-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-CTLCardinality-2025-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-CTLCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-CTLCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-01 16:39:40] [INFO ] Flatten gal took : 2 ms
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.
Domain [M(6), POS(5), M(6)] of place P_masterList breaks symmetries in sort M
Arc [15:1*[$m, (MOD (ADD $i 1) 5)]] contains successor/predecessor on variables of sort POS
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 16:39:41] [INFO ] Unfolded HLPN to a Petri net with 3090 places and 4024 transitions 22762 arcs in 89 ms.
[2025-06-01 16:39:41] [INFO ] Unfolded 7 HLPN properties in 1 ms.
Deduced a syphon composed of 2866 places in 13 ms
Reduce places removed 2891 places and 3788 transitions.
Reduce places removed 6 places and 0 transitions.
Support contains 125 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 236/236 transitions.
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 173 transition count 236
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 35 place count 158 transition count 146
Iterating global reduction 1 with 15 rules applied. Total rules applied 50 place count 158 transition count 146
Applied a total of 50 rules in 14 ms. Remains 158 /193 variables (removed 35) and now considering 146/236 (removed 90) transitions.
[2025-06-01 16:39:41] [INFO ] Flow matrix only has 130 transitions (discarded 16 similar events)
// Phase 1: matrix 130 rows 158 cols
[2025-06-01 16:39:41] [INFO ] Computed 34 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:39:41] [INFO ] Implicit Places using invariants in 257 ms returned [13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 266 ms to find 25 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/193 places, 146/236 transitions.
Applied a total of 0 rules in 1 ms. Remains 133 /133 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 288 ms. Remains : 133/193 places, 146/236 transitions.
Support contains 125 out of 133 places after structural reductions.
[2025-06-01 16:39:41] [INFO ] Flatten gal took : 20 ms
[2025-06-01 16:39:41] [INFO ] Flatten gal took : 23 ms
[2025-06-01 16:39:41] [INFO ] Input system was already deterministic with 146 transitions.
Support contains 100 out of 133 places (down from 125) after GAL structural reductions.
RANDOM walk for 40000 steps (144 resets) in 798 ms. (50 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40004 steps (12 resets) in 187 ms. (212 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (22 resets) in 134 ms. (296 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (21 resets) in 97 ms. (408 steps per ms) remains 3/3 properties
[2025-06-01 16:39:41] [INFO ] Flow matrix only has 130 transitions (discarded 16 similar events)
// Phase 1: matrix 130 rows 133 cols
[2025-06-01 16:39:41] [INFO ] Computed 9 invariants in 2 ms
[2025-06-01 16:39:41] [INFO ] State equation strengthened by 10 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
At refinement iteration 1 (OVERLAPS) 40/125 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Problem AtomicPropp1 is UNSAT
After SMT solving in domain Real declared 255/263 variables, and 130 constraints, problems are : Problem set: 3 solved, 0 unsolved in 132 ms.
Refiners :[Positive P Invariants (semi-flows): 5/9 constraints, State Equation: 125/133 constraints, ReadFeed: 0/10 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 163ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 5 simplifications.
[2025-06-01 16:39:42] [INFO ] Flatten gal took : 12 ms
[2025-06-01 16:39:42] [INFO ] Flatten gal took : 11 ms
[2025-06-01 16:39:42] [INFO ] Input system was already deterministic with 146 transitions.
Computed a total of 133 stabilizing places and 146 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 133 transition count 146
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 146/146 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 121 transition count 128
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 121 transition count 128
Applied a total of 24 rules in 8 ms. Remains 121 /133 variables (removed 12) and now considering 128/146 (removed 18) transitions.
[2025-06-01 16:39:42] [INFO ] Flow matrix only has 112 transitions (discarded 16 similar events)
// Phase 1: matrix 112 rows 121 cols
[2025-06-01 16:39:42] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:39:42] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-06-01 16:39:42] [INFO ] Flow matrix only has 112 transitions (discarded 16 similar events)
[2025-06-01 16:39:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:39:42] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-01 16:39:42] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2025-06-01 16:39:42] [INFO ] Flow matrix only has 112 transitions (discarded 16 similar events)
[2025-06-01 16:39:42] [INFO ] Invariant cache hit.
[2025-06-01 16:39:42] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 5/121 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 123 unsolved
Problem TDEAD12 is UNSAT
At refinement iteration 4 (OVERLAPS) 112/233 variables, 121/130 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 4/134 constraints. Problems are: Problem set: 1 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:39:44] [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 16:39:44] [INFO ] Deduced a trap composed of 7 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 16:39:44] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:39:44] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:39:44] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:39:44] [INFO ] Deduced a trap composed of 9 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 16:39:44] [INFO ] Deduced a trap composed of 6 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 16:39:44] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:39:45] [INFO ] Deduced a trap composed of 6 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 16:39:45] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:39:45] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:39:45] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:39:45] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:39:45] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:39:45] [INFO ] Deduced a trap composed of 7 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 16:39:45] [INFO ] Deduced a trap composed of 7 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 16:39:45] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:39:45] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:39:45] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:39:45] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 20/154 constraints. Problems are: Problem set: 1 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:39:45] [INFO ] Deduced a trap composed of 6 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 16:39:46] [INFO ] Deduced a trap composed of 8 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 16:39:46] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:39:46] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:39:46] [INFO ] Deduced a trap composed of 4 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 16:39:46] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:39:46] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:39:46] [INFO ] Deduced a trap composed of 9 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 16:39:46] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:39:46] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 10/164 constraints. Problems are: Problem set: 1 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:39:46] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:39:47] [INFO ] Deduced a trap composed of 8 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 16:39:47] [INFO ] Deduced a trap composed of 8 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 16:39:47] [INFO ] Deduced a trap composed of 9 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 16:39:47] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:39:47] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/233 variables, 6/170 constraints. Problems are: Problem set: 1 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:39:47] [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 16:39:47] [INFO ] Deduced a trap composed of 8 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 16:39:47] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:39:47] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/233 variables, 4/174 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 0/174 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 11 (OVERLAPS) 0/233 variables, 0/174 constraints. Problems are: Problem set: 1 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 233/233 variables, and 174 constraints, problems are : Problem set: 1 solved, 122 unsolved in 7908 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 121/121 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 122 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 5/121 variables, 5/10 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 39/49 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/49 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 112/233 variables, 121/170 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 4/174 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/233 variables, 122/296 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/233 variables, 0/296 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/233 variables, 0/296 constraints. Problems are: Problem set: 1 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 233/233 variables, and 296 constraints, problems are : Problem set: 1 solved, 122 unsolved in 7340 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 121/121 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 122/123 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15287ms problems are : Problem set: 1 solved, 122 unsolved
Search for dead transitions found 1 dead transitions in 15289ms
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 : 121/133 places, 127/146 transitions.
Applied a total of 0 rules in 4 ms. Remains 121 /121 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 15556 ms. Remains : 121/133 places, 127/146 transitions.
[2025-06-01 16:39:57] [INFO ] Flatten gal took : 9 ms
[2025-06-01 16:39:57] [INFO ] Flatten gal took : 8 ms
[2025-06-01 16:39:57] [INFO ] Input system was already deterministic with 127 transitions.
[2025-06-01 16:39:57] [INFO ] Flatten gal took : 8 ms
[2025-06-01 16:39:57] [INFO ] Flatten gal took : 7 ms
[2025-06-01 16:39:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality18060417902309203299.gal : 3 ms
[2025-06-01 16:39:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality3817336239432924303.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality18060417902309203299.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3817336239432924303.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.15077e+16,28.84,628884,2,133877,5,2.79679e+06,6,0,597,3.25688e+06,0


Converting to forward existential form...Done !
original formula: (AX(((((P_poll__pollEnd_1+P_poll__pollEnd_2)+(P_poll__pollEnd_3+P_poll__pollEnd_4))+P_poll__pollEnd_5)>=4)) * AX(FALSE))
=> equivalent forward existential formula: ([(EY(Init) * !(((((P_poll__pollEnd_1+P_poll__pollEnd_2)+(P_poll__pollEnd_3+P_poll__pollEnd_4))+P_poll__pollEnd_...207
(forward)formula 0,0,28.8572,628884,1,0,6,2.79679e+06,7,1,848,3.25688e+06,1
FORMULA NeoElection-COL-5-CTLCardinality-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 146/146 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 116 transition count 123
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 116 transition count 123
Applied a total of 34 rules in 12 ms. Remains 116 /133 variables (removed 17) and now considering 123/146 (removed 23) transitions.
[2025-06-01 16:40:26] [INFO ] Flow matrix only has 107 transitions (discarded 16 similar events)
// Phase 1: matrix 107 rows 116 cols
[2025-06-01 16:40:26] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:40:26] [INFO ] Implicit Places using invariants in 81 ms returned []
[2025-06-01 16:40:26] [INFO ] Flow matrix only has 107 transitions (discarded 16 similar events)
[2025-06-01 16:40:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:40:26] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-01 16:40:26] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Running 118 sub problems to find dead transitions.
[2025-06-01 16:40:26] [INFO ] Flow matrix only has 107 transitions (discarded 16 similar events)
[2025-06-01 16:40:26] [INFO ] Invariant cache hit.
[2025-06-01 16:40:26] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 5/116 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 118 unsolved
Problem TDEAD12 is UNSAT
At refinement iteration 4 (OVERLAPS) 107/223 variables, 116/125 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 4/129 constraints. Problems are: Problem set: 1 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:40:28] [INFO ] Deduced a trap composed of 6 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 16:40:28] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:40:28] [INFO ] Deduced a trap composed of 7 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 16:40:28] [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 16:40:28] [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 16:40:28] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:40:28] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:40:29] [INFO ] Deduced a trap composed of 6 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 16:40:29] [INFO ] Deduced a trap composed of 6 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 16:40:29] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:40:29] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:40:29] [INFO ] Deduced a trap composed of 7 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 16:40:29] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:40:29] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:40:29] [INFO ] Deduced a trap composed of 8 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 16:40:29] [INFO ] Deduced a trap composed of 8 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 16:40:29] [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 16:40:29] [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 16:40:29] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 19/148 constraints. Problems are: Problem set: 1 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:40:30] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:40:30] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 2/150 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 0/150 constraints. Problems are: Problem set: 1 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:40:31] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:40:31] [INFO ] Deduced a trap composed of 9 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 16:40:31] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/223 variables, 3/153 constraints. Problems are: Problem set: 1 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:40:32] [INFO ] Deduced a trap composed of 8 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 16:40:32] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 2/155 constraints. Problems are: Problem set: 1 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:40:32] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:40:32] [INFO ] Deduced a trap composed of 8 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 16:40:32] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:40:32] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/223 variables, 4/159 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/223 variables, 0/159 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 13 (OVERLAPS) 0/223 variables, 0/159 constraints. Problems are: Problem set: 1 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/223 variables, and 159 constraints, problems are : Problem set: 1 solved, 117 unsolved in 8159 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 116/116 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 117 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 5/116 variables, 5/9 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 30/39 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/39 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 5 (OVERLAPS) 107/223 variables, 116/155 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 4/159 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 117/276 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 0/276 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 9 (OVERLAPS) 0/223 variables, 0/276 constraints. Problems are: Problem set: 1 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 223/223 variables, and 276 constraints, problems are : Problem set: 1 solved, 117 unsolved in 6711 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 116/116 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 117/118 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14900ms problems are : Problem set: 1 solved, 117 unsolved
Search for dead transitions found 1 dead transitions in 14901ms
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 : 116/133 places, 122/146 transitions.
Applied a total of 0 rules in 10 ms. Remains 116 /116 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 15112 ms. Remains : 116/133 places, 122/146 transitions.
[2025-06-01 16:40:41] [INFO ] Flatten gal took : 7 ms
[2025-06-01 16:40:41] [INFO ] Flatten gal took : 8 ms
[2025-06-01 16:40:41] [INFO ] Input system was already deterministic with 122 transitions.
[2025-06-01 16:40:41] [INFO ] Flatten gal took : 7 ms
[2025-06-01 16:40:41] [INFO ] Flatten gal took : 7 ms
[2025-06-01 16:40:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality15907771110929652322.gal : 2 ms
[2025-06-01 16:40:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality5808627125960020371.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15907771110929652322.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5808627125960020371.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.15077e+16,10.3371,266428,2,65135,5,1.33095e+06,6,0,572,1.29486e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-01 16:41:11] [INFO ] Flatten gal took : 7 ms
[2025-06-01 16:41:11] [INFO ] Applying decomposition
[2025-06-01 16:41:11] [INFO ] Flatten gal took : 7 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/graph13608992935451640518.txt' '-o' '/tmp/graph13608992935451640518.bin' '-w' '/tmp/graph13608992935451640518.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13608992935451640518.bin' '-l' '-1' '-v' '-w' '/tmp/graph13608992935451640518.weights' '-q' '0' '-e' '0.001'
[2025-06-01 16:41:12] [INFO ] Decomposing Gal with order
[2025-06-01 16:41:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 16:41:12] [INFO ] Removed a total of 36 redundant transitions.
[2025-06-01 16:41:12] [INFO ] Flatten gal took : 27 ms
[2025-06-01 16:41:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 5 ms.
[2025-06-01 16:41:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality17351739351834199811.gal : 3 ms
[2025-06-01 16:41:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality786116149424078389.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17351739351834199811.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality786116149424078389.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 146/146 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 116 transition count 123
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 116 transition count 123
Applied a total of 34 rules in 8 ms. Remains 116 /133 variables (removed 17) and now considering 123/146 (removed 23) transitions.
[2025-06-01 16:41:42] [INFO ] Flow matrix only has 107 transitions (discarded 16 similar events)
[2025-06-01 16:41:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:41:42] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-01 16:41:42] [INFO ] Flow matrix only has 107 transitions (discarded 16 similar events)
[2025-06-01 16:41:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:41:42] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-01 16:41:42] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Running 118 sub problems to find dead transitions.
[2025-06-01 16:41:42] [INFO ] Flow matrix only has 107 transitions (discarded 16 similar events)
[2025-06-01 16:41:42] [INFO ] Invariant cache hit.
[2025-06-01 16:41:42] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 5/116 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 118 unsolved
Problem TDEAD12 is UNSAT
At refinement iteration 4 (OVERLAPS) 107/223 variables, 116/125 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 4/129 constraints. Problems are: Problem set: 1 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:41:43] [INFO ] Deduced a trap composed of 6 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 16:41:43] [INFO ] Deduced a trap composed of 7 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 16:41:43] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:41:44] [INFO ] Deduced a trap composed of 7 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 16:41:44] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:41:44] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:41:44] [INFO ] Deduced a trap composed of 9 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 16:41:44] [INFO ] Deduced a trap composed of 6 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 16:41:44] [INFO ] Deduced a trap composed of 6 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 16:41:44] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:41:44] [INFO ] Deduced a trap composed of 6 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 16:41:44] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:41:44] [INFO ] Deduced a trap composed of 7 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 16:41:44] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:41:45] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:41:45] [INFO ] Deduced a trap composed of 8 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 16:41:45] [INFO ] Deduced a trap composed of 9 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 16:41:45] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:41:45] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 19/148 constraints. Problems are: Problem set: 1 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:41:45] [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 16:41:46] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 2/150 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 0/150 constraints. Problems are: Problem set: 1 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:41:46] [INFO ] Deduced a trap composed of 8 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 16:41:46] [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 16:41:47] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/223 variables, 3/153 constraints. Problems are: Problem set: 1 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:41:47] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:41:47] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 2/155 constraints. Problems are: Problem set: 1 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:41:48] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:41:48] [INFO ] Deduced a trap composed of 8 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 16:41:48] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:41:48] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/223 variables, 4/159 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/223 variables, 0/159 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 13 (OVERLAPS) 0/223 variables, 0/159 constraints. Problems are: Problem set: 1 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/223 variables, and 159 constraints, problems are : Problem set: 1 solved, 117 unsolved in 8384 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 116/116 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 117 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 5/116 variables, 5/9 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 30/39 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/39 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 5 (OVERLAPS) 107/223 variables, 116/155 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 4/159 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 117/276 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 0/276 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 9 (OVERLAPS) 0/223 variables, 0/276 constraints. Problems are: Problem set: 1 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 223/223 variables, and 276 constraints, problems are : Problem set: 1 solved, 117 unsolved in 6981 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 116/116 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 117/118 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15388ms problems are : Problem set: 1 solved, 117 unsolved
Search for dead transitions found 1 dead transitions in 15389ms
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 : 116/133 places, 122/146 transitions.
Applied a total of 0 rules in 4 ms. Remains 116 /116 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 15580 ms. Remains : 116/133 places, 122/146 transitions.
[2025-06-01 16:41:57] [INFO ] Flatten gal took : 9 ms
[2025-06-01 16:41:57] [INFO ] Flatten gal took : 6 ms
[2025-06-01 16:41:57] [INFO ] Input system was already deterministic with 122 transitions.
[2025-06-01 16:41:57] [INFO ] Flatten gal took : 9 ms
[2025-06-01 16:41:57] [INFO ] Flatten gal took : 6 ms
[2025-06-01 16:41:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality9075739564183573624.gal : 2 ms
[2025-06-01 16:41:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality7748493515340197127.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9075739564183573624.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7748493515340197127.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.15077e+16,13.8421,265932,2,65135,5,1.33095e+06,6,0,572,1.29486e+06,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,13.8502,265932,1,0,6,1.33095e+06,7,1,819,1.29486e+06,1
FORMULA NeoElection-COL-5-CTLCardinality-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 146/146 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 116 transition count 123
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 116 transition count 123
Applied a total of 34 rules in 7 ms. Remains 116 /133 variables (removed 17) and now considering 123/146 (removed 23) transitions.
[2025-06-01 16:42:11] [INFO ] Flow matrix only has 107 transitions (discarded 16 similar events)
[2025-06-01 16:42:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:42:11] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-01 16:42:11] [INFO ] Flow matrix only has 107 transitions (discarded 16 similar events)
[2025-06-01 16:42:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:42:11] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-01 16:42:11] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Running 118 sub problems to find dead transitions.
[2025-06-01 16:42:11] [INFO ] Flow matrix only has 107 transitions (discarded 16 similar events)
[2025-06-01 16:42:11] [INFO ] Invariant cache hit.
[2025-06-01 16:42:11] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 5/116 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 118 unsolved
Problem TDEAD12 is UNSAT
At refinement iteration 4 (OVERLAPS) 107/223 variables, 116/125 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 4/129 constraints. Problems are: Problem set: 1 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:13] [INFO ] Deduced a trap composed of 6 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 16:42:13] [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 16:42:13] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:13] [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 16:42:13] [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 16:42:13] [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 16:42:13] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:14] [INFO ] Deduced a trap composed of 6 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 16:42:14] [INFO ] Deduced a trap composed of 6 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 16:42:14] [INFO ] Deduced a trap composed of 6 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 16:42:14] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:14] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:14] [INFO ] Deduced a trap composed of 7 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 16:42:14] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:14] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:14] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:14] [INFO ] Deduced a trap composed of 9 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 16:42:14] [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 16:42:14] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 19/148 constraints. Problems are: Problem set: 1 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:15] [INFO ] Deduced a trap composed of 7 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 16:42:15] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 2/150 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 0/150 constraints. Problems are: Problem set: 1 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:16] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:16] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:16] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/223 variables, 3/153 constraints. Problems are: Problem set: 1 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:17] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:17] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 2/155 constraints. Problems are: Problem set: 1 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:17] [INFO ] Deduced a trap composed of 9 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 16:42:17] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:17] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:17] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/223 variables, 4/159 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/223 variables, 0/159 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 13 (OVERLAPS) 0/223 variables, 0/159 constraints. Problems are: Problem set: 1 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/223 variables, and 159 constraints, problems are : Problem set: 1 solved, 117 unsolved in 8036 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 116/116 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 117 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 5/116 variables, 5/9 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 30/39 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/39 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 5 (OVERLAPS) 107/223 variables, 116/155 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 4/159 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 117/276 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 0/276 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 9 (OVERLAPS) 0/223 variables, 0/276 constraints. Problems are: Problem set: 1 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 223/223 variables, and 276 constraints, problems are : Problem set: 1 solved, 117 unsolved in 6882 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 116/116 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 117/118 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14939ms problems are : Problem set: 1 solved, 117 unsolved
Search for dead transitions found 1 dead transitions in 14940ms
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 : 116/133 places, 122/146 transitions.
Applied a total of 0 rules in 5 ms. Remains 116 /116 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 15125 ms. Remains : 116/133 places, 122/146 transitions.
[2025-06-01 16:42:26] [INFO ] Flatten gal took : 9 ms
[2025-06-01 16:42:26] [INFO ] Flatten gal took : 6 ms
[2025-06-01 16:42:26] [INFO ] Input system was already deterministic with 122 transitions.
[2025-06-01 16:42:26] [INFO ] Flatten gal took : 6 ms
[2025-06-01 16:42:26] [INFO ] Flatten gal took : 6 ms
[2025-06-01 16:42:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality12009758386367856810.gal : 1 ms
[2025-06-01 16:42:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality6058786622973916957.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12009758386367856810.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6058786622973916957.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.15077e+16,10.7531,266028,2,65135,5,1.33095e+06,6,0,572,1.29486e+06,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,10.7616,266028,1,0,6,1.33095e+06,7,1,819,1.29486e+06,1
FORMULA NeoElection-COL-5-CTLCardinality-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 146/146 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 116 transition count 123
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 116 transition count 123
Applied a total of 34 rules in 10 ms. Remains 116 /133 variables (removed 17) and now considering 123/146 (removed 23) transitions.
[2025-06-01 16:42:37] [INFO ] Flow matrix only has 107 transitions (discarded 16 similar events)
[2025-06-01 16:42:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:42:37] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-01 16:42:37] [INFO ] Flow matrix only has 107 transitions (discarded 16 similar events)
[2025-06-01 16:42:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:42:37] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-01 16:42:37] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Running 118 sub problems to find dead transitions.
[2025-06-01 16:42:37] [INFO ] Flow matrix only has 107 transitions (discarded 16 similar events)
[2025-06-01 16:42:37] [INFO ] Invariant cache hit.
[2025-06-01 16:42:37] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 5/116 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 118 unsolved
Problem TDEAD12 is UNSAT
At refinement iteration 4 (OVERLAPS) 107/223 variables, 116/125 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 4/129 constraints. Problems are: Problem set: 1 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:39] [INFO ] Deduced a trap composed of 6 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 16:42:39] [INFO ] Deduced a trap composed of 7 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 16:42:39] [INFO ] Deduced a trap composed of 7 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 16:42:39] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:39] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:39] [INFO ] Deduced a trap composed of 7 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 16:42:39] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:40] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:40] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:40] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:40] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:40] [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 16:42:40] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:40] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:40] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:40] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:40] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:40] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:40] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 19/148 constraints. Problems are: Problem set: 1 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:41] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:41] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 2/150 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 0/150 constraints. Problems are: Problem set: 1 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:42] [INFO ] Deduced a trap composed of 8 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 16:42:42] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:42] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/223 variables, 3/153 constraints. Problems are: Problem set: 1 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:43] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:43] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 2/155 constraints. Problems are: Problem set: 1 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:43] [INFO ] Deduced a trap composed of 9 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 16:42:43] [INFO ] Deduced a trap composed of 8 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 16:42:43] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:42:43] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/223 variables, 4/159 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/223 variables, 0/159 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 13 (OVERLAPS) 0/223 variables, 0/159 constraints. Problems are: Problem set: 1 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/223 variables, and 159 constraints, problems are : Problem set: 1 solved, 117 unsolved in 8218 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 116/116 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 117 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 5/116 variables, 5/9 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 30/39 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/39 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 5 (OVERLAPS) 107/223 variables, 116/155 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 4/159 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 117/276 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 0/276 constraints. Problems are: Problem set: 1 solved, 117 unsolved
At refinement iteration 9 (OVERLAPS) 0/223 variables, 0/276 constraints. Problems are: Problem set: 1 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 223/223 variables, and 276 constraints, problems are : Problem set: 1 solved, 117 unsolved in 6891 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 116/116 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 117/118 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15128ms problems are : Problem set: 1 solved, 117 unsolved
Search for dead transitions found 1 dead transitions in 15129ms
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 : 116/133 places, 122/146 transitions.
Applied a total of 0 rules in 1 ms. Remains 116 /116 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 15297 ms. Remains : 116/133 places, 122/146 transitions.
[2025-06-01 16:42:52] [INFO ] Flatten gal took : 21 ms
[2025-06-01 16:42:52] [INFO ] Flatten gal took : 9 ms
[2025-06-01 16:42:52] [INFO ] Input system was already deterministic with 122 transitions.
[2025-06-01 16:42:52] [INFO ] Flatten gal took : 6 ms
[2025-06-01 16:42:53] [INFO ] Flatten gal took : 5 ms
[2025-06-01 16:42:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality14933946502020240823.gal : 1 ms
[2025-06-01 16:42:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality7791021288985032793.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14933946502020240823.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7791021288985032793.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.15077e+16,10.3015,266712,2,65135,5,1.33095e+06,6,0,572,1.29486e+06,0


Converting to forward existential form...Done !
original formula: AG(AX(FALSE))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(FALSE))] = FALSE
(forward)formula 0,0,12.2644,266712,1,0,6,1.33095e+06,7,1,1062,1.29486e+06,1
FORMULA NeoElection-COL-5-CTLCardinality-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 133/133 places, 146/146 transitions.
Reduce places removed 5 places and 5 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 116 transition count 123
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 116 transition count 123
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 54 place count 101 transition count 108
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 59 place count 96 transition count 103
Applied a total of 59 rules in 20 ms. Remains 96 /133 variables (removed 37) and now considering 103/146 (removed 43) transitions.
[2025-06-01 16:43:05] [INFO ] Flow matrix only has 87 transitions (discarded 16 similar events)
// Phase 1: matrix 87 rows 96 cols
[2025-06-01 16:43:05] [INFO ] Computed 9 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:43:05] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-01 16:43:05] [INFO ] Flow matrix only has 87 transitions (discarded 16 similar events)
[2025-06-01 16:43:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:43:05] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-01 16:43:05] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 16:43:05] [INFO ] Redundant transitions in 1 ms returned []
Running 98 sub problems to find dead transitions.
[2025-06-01 16:43:05] [INFO ] Flow matrix only has 87 transitions (discarded 16 similar events)
[2025-06-01 16:43:05] [INFO ] Invariant cache hit.
[2025-06-01 16:43:05] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 5/96 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Problem TDEAD12 is UNSAT
At refinement iteration 4 (OVERLAPS) 87/183 variables, 96/105 constraints. Problems are: Problem set: 1 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 4/109 constraints. Problems are: Problem set: 1 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 0/109 constraints. Problems are: Problem set: 1 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 0/183 variables, 0/109 constraints. Problems are: Problem set: 1 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 109 constraints, problems are : Problem set: 1 solved, 97 unsolved in 2459 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 96/96 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 97 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 5/96 variables, 5/9 constraints. Problems are: Problem set: 1 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 87/183 variables, 96/105 constraints. Problems are: Problem set: 1 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 4/109 constraints. Problems are: Problem set: 1 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 97/206 constraints. Problems are: Problem set: 1 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:08] [INFO ] Deduced a trap composed of 4 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 16:43:08] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 2/208 constraints. Problems are: Problem set: 1 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 0/208 constraints. Problems are: Problem set: 1 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:43:10] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/183 variables, 1/209 constraints. Problems are: Problem set: 1 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/209 constraints. Problems are: Problem set: 1 solved, 97 unsolved
At refinement iteration 11 (OVERLAPS) 0/183 variables, 0/209 constraints. Problems are: Problem set: 1 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 209 constraints, problems are : Problem set: 1 solved, 97 unsolved in 5444 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 96/96 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 97/98 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7922ms problems are : Problem set: 1 solved, 97 unsolved
Search for dead transitions found 1 dead transitions in 7923ms
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_CTL mode, iteration 1 : 96/133 places, 102/146 transitions.
Applied a total of 0 rules in 13 ms. Remains 96 /96 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 16:43:13] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 8100 ms. Remains : 96/133 places, 102/146 transitions.
[2025-06-01 16:43:13] [INFO ] Flatten gal took : 6 ms
[2025-06-01 16:43:13] [INFO ] Flatten gal took : 9 ms
[2025-06-01 16:43:13] [INFO ] Input system was already deterministic with 102 transitions.
[2025-06-01 16:43:13] [INFO ] Flatten gal took : 4 ms
[2025-06-01 16:43:13] [INFO ] Flatten gal took : 4 ms
[2025-06-01 16:43:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality11573921358020236630.gal : 0 ms
[2025-06-01 16:43:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality12154786663145097379.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11573921358020236630.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12154786663145097379.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.15065e+16,15.9139,376000,2,74098,5,1.91433e+06,6,0,452,2.05448e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-01 16:43:43] [INFO ] Flatten gal took : 4 ms
[2025-06-01 16:43:43] [INFO ] Applying decomposition
[2025-06-01 16:43:43] [INFO ] Flatten gal took : 4 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/graph1144967952917555771.txt' '-o' '/tmp/graph1144967952917555771.bin' '-w' '/tmp/graph1144967952917555771.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1144967952917555771.bin' '-l' '-1' '-v' '-w' '/tmp/graph1144967952917555771.weights' '-q' '0' '-e' '0.001'
[2025-06-01 16:43:43] [INFO ] Decomposing Gal with order
[2025-06-01 16:43:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 16:43:43] [INFO ] Removed a total of 108 redundant transitions.
[2025-06-01 16:43:43] [INFO ] Flatten gal took : 15 ms
[2025-06-01 16:43:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 159 labels/synchronizations in 8 ms.
[2025-06-01 16:43:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality17979924485032567608.gal : 2 ms
[2025-06-01 16:43:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality2541799742525435472.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17979924485032567608.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2541799742525435472.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 133/133 places, 146/146 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 133 transition count 141
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 128 transition count 141
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 123 transition count 136
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 123 transition count 136
Applied a total of 20 rules in 19 ms. Remains 123 /133 variables (removed 10) and now considering 136/146 (removed 10) transitions.
[2025-06-01 16:44:13] [INFO ] Flow matrix only has 120 transitions (discarded 16 similar events)
// Phase 1: matrix 120 rows 123 cols
[2025-06-01 16:44:13] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:44:13] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-06-01 16:44:13] [INFO ] Flow matrix only has 120 transitions (discarded 16 similar events)
[2025-06-01 16:44:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:44:13] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-01 16:44:13] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 16:44:13] [INFO ] Redundant transitions in 3 ms returned []
Running 131 sub problems to find dead transitions.
[2025-06-01 16:44:13] [INFO ] Flow matrix only has 120 transitions (discarded 16 similar events)
[2025-06-01 16:44:13] [INFO ] Invariant cache hit.
[2025-06-01 16:44:13] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 5/123 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Problem TDEAD19 is UNSAT
At refinement iteration 4 (OVERLAPS) 120/243 variables, 123/132 constraints. Problems are: Problem set: 1 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 10/142 constraints. Problems are: Problem set: 1 solved, 130 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:15] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:16] [INFO ] Deduced a trap composed of 5 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 16:44:16] [INFO ] Deduced a trap composed of 5 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 16:44:16] [INFO ] Deduced a trap composed of 5 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 16:44:16] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:16] [INFO ] Deduced a trap composed of 6 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 16:44:16] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:16] [INFO ] Deduced a trap composed of 7 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 16:44:16] [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 16:44:16] [INFO ] Deduced a trap composed of 8 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 16:44:16] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:16] [INFO ] Deduced a trap composed of 6 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 16:44:16] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:16] [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 16:44:16] [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 16:44:16] [INFO ] Deduced a trap composed of 7 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 16:44:16] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:16] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:16] [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 16:44:17] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 20/162 constraints. Problems are: Problem set: 1 solved, 130 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:17] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:17] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:17] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:18] [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 16:44:18] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:18] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:18] [INFO ] Deduced a trap composed of 8 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 16:44:18] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:44:18] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 9/171 constraints. Problems are: Problem set: 1 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 0/171 constraints. Problems are: Problem set: 1 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 0/243 variables, 0/171 constraints. Problems are: Problem set: 1 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 171 constraints, problems are : Problem set: 1 solved, 130 unsolved in 6792 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 123/123 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 130 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 5/123 variables, 5/9 constraints. Problems are: Problem set: 1 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 29/38 constraints. Problems are: Problem set: 1 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 120/243 variables, 123/161 constraints. Problems are: Problem set: 1 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 10/171 constraints. Problems are: Problem set: 1 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 130/301 constraints. Problems are: Problem set: 1 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 0/301 constraints. Problems are: Problem set: 1 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 0/243 variables, 0/301 constraints. Problems are: Problem set: 1 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 301 constraints, problems are : Problem set: 1 solved, 130 unsolved in 6687 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 123/123 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 130/131 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13500ms problems are : Problem set: 1 solved, 130 unsolved
Search for dead transitions found 1 dead transitions in 13501ms
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_CTL mode, iteration 1 : 123/133 places, 135/146 transitions.
Applied a total of 0 rules in 12 ms. Remains 123 /123 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 16:44:27] [INFO ] Redundant transitions in 4 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 13660 ms. Remains : 123/133 places, 135/146 transitions.
[2025-06-01 16:44:27] [INFO ] Flatten gal took : 13 ms
[2025-06-01 16:44:27] [INFO ] Flatten gal took : 8 ms
[2025-06-01 16:44:27] [INFO ] Input system was already deterministic with 135 transitions.
[2025-06-01 16:44:27] [INFO ] Flatten gal took : 7 ms
[2025-06-01 16:44:27] [INFO ] Flatten gal took : 6 ms
[2025-06-01 16:44:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality11322119185172034047.gal : 1 ms
[2025-06-01 16:44:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality6766365602570689485.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11322119185172034047.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6766365602570689485.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.05207e+15,5.34541,163764,2,54356,5,872333,6,0,613,679060,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-01 16:44:57] [INFO ] Flatten gal took : 17 ms
[2025-06-01 16:44:57] [INFO ] Applying decomposition
[2025-06-01 16:44:57] [INFO ] Flatten gal took : 7 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/graph16689002206823639787.txt' '-o' '/tmp/graph16689002206823639787.bin' '-w' '/tmp/graph16689002206823639787.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16689002206823639787.bin' '-l' '-1' '-v' '-w' '/tmp/graph16689002206823639787.weights' '-q' '0' '-e' '0.001'
[2025-06-01 16:44:57] [INFO ] Decomposing Gal with order
[2025-06-01 16:44:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 16:44:57] [INFO ] Removed a total of 120 redundant transitions.
[2025-06-01 16:44:57] [INFO ] Flatten gal took : 29 ms
[2025-06-01 16:44:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 87 labels/synchronizations in 5 ms.
[2025-06-01 16:44:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality2248694754600800137.gal : 1 ms
[2025-06-01 16:44:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality8561201681419710421.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2248694754600800137.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8561201681419710421.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-01 16:45:27] [INFO ] Flatten gal took : 5 ms
[2025-06-01 16:45:27] [INFO ] Flatten gal took : 5 ms
[2025-06-01 16:45:27] [INFO ] Applying decomposition
[2025-06-01 16:45:27] [INFO ] Flatten gal took : 5 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/graph1661521420794284198.txt' '-o' '/tmp/graph1661521420794284198.bin' '-w' '/tmp/graph1661521420794284198.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1661521420794284198.bin' '-l' '-1' '-v' '-w' '/tmp/graph1661521420794284198.weights' '-q' '0' '-e' '0.001'
[2025-06-01 16:45:27] [INFO ] Decomposing Gal with order
[2025-06-01 16:45:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 16:45:27] [INFO ] Removed a total of 216 redundant transitions.
[2025-06-01 16:45:27] [INFO ] Flatten gal took : 23 ms
[2025-06-01 16:45:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 79 labels/synchronizations in 3 ms.
[2025-06-01 16:45:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality16568037709581830368.gal : 1 ms
[2025-06-01 16:45:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality18367498710256493528.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16568037709581830368.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18367498710256493528.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 3 CTL formulae.
Detected timeout of ITS tools.
[2025-06-01 17:07:26] [INFO ] Applying decomposition
[2025-06-01 17:07:26] [INFO ] Flatten gal took : 84 ms
[2025-06-01 17:07:26] [INFO ] Decomposing Gal with order
[2025-06-01 17:07:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 17:07:26] [INFO ] Removed a total of 189 redundant transitions.
[2025-06-01 17:07:26] [INFO ] Flatten gal took : 135 ms
[2025-06-01 17:07:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2025-06-01 17:07:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality18090710045680004731.gal : 31 ms
[2025-06-01 17:07:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality17016380322577051240.ctl : 6 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality18090710045680004731.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17016380322577051240.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 3 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.31759e+16,22.5628,590788,2,134599,5,3.08137e+06,6,0,664,2.7294e+06,0


Converting to forward existential form...Done !
original formula: AF(EG(AX(FALSE)))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(EX(!(FALSE))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions gM1.t0, gM2.t1, gM3.t2, gM4.t3, gM5.t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16...367
dead was empty
(forward)formula 0,1,603.102,13976316,1,0,609,8.20952e+07,311,153,4089,7.19765e+07,580
FORMULA NeoElection-COL-5-CTLCardinality-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: EG(((((gM1.P_polling_1+gM2.P_polling_2)+(gM3.P_polling_3+gM4.P_polling_4))+gM5.P_polling_5)<=(((gM1.P_poll__pollEnd_1+gM2.P_poll__pollEnd...230
=> equivalent forward existential formula: [FwdG(Init,((((gM1.P_polling_1+gM2.P_polling_2)+(gM3.P_polling_3+gM4.P_polling_4))+gM5.P_polling_5)<=(((gM1.P_po...273
Hit Full ! (commute/partial/dont) 25/0/121
(forward)formula 1,0,604.857,14036000,1,0,611,8.23901e+07,318,156,4397,7.1986e+07,583
FORMULA NeoElection-COL-5-CTLCardinality-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: EG(E(AG(((((((((gMMMTM288.P_network_288+gMMMTM294.P_network_294)+(gMMMTM300.P_network_300+gMMMTM306.P_network_306))+((gMMMTM324.P_network...2427
Detected timeout of ITS tools.
=> equivalent forward existential formula: [FwdG(Init,E(!(E(TRUE U !(((((((((gMMMTM288.P_network_288+gMMMTM294.P_network_294)+(gMMMTM300.P_network_300+gMMM...1624
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.ensureOpen(BufferedInputStream.java:206)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:411)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-01 17:29:24] [INFO ] Flatten gal took : 155 ms
[2025-06-01 17:29:25] [INFO ] Input system was already deterministic with 146 transitions.
[2025-06-01 17:29:25] [INFO ] Transformed 133 places.
[2025-06-01 17:29:25] [INFO ] Transformed 146 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 17:29:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality18322603637375200825.gal : 5 ms
[2025-06-01 17:29:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality5880488483200342926.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality18322603637375200825.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5880488483200342926.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...329
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.31759e+16,137.285,2456068,2,267298,5,1.53254e+07,6,0,664,6.78479e+06,0


Converting to forward existential form...Done !

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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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-5"
export BK_EXAMINATION="CTLCardinality"
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-5, examination is CTLCardinality"
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-174876811900065"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NeoElection-COL-5.tgz
mv NeoElection-COL-5 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;