Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r246-tall-171654351600441.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is NeoElection-COL-2, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-tall-171654351600441
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 9.0K Apr 11 18:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 11 18:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 11 18:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 11 18:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Apr 23 07:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 23 07:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 18:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 11 18:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 11 18:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Apr 11 18:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 70K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME NeoElection-COL-2-CTLCardinality-2024-00
FORMULA_NAME NeoElection-COL-2-CTLCardinality-2024-01
FORMULA_NAME NeoElection-COL-2-CTLCardinality-2024-02
FORMULA_NAME NeoElection-COL-2-CTLCardinality-2024-03
FORMULA_NAME NeoElection-COL-2-CTLCardinality-2024-04
FORMULA_NAME NeoElection-COL-2-CTLCardinality-2024-05
FORMULA_NAME NeoElection-COL-2-CTLCardinality-2024-06
FORMULA_NAME NeoElection-COL-2-CTLCardinality-2024-07
FORMULA_NAME NeoElection-COL-2-CTLCardinality-2024-08
FORMULA_NAME NeoElection-COL-2-CTLCardinality-2024-09
FORMULA_NAME NeoElection-COL-2-CTLCardinality-2024-10
FORMULA_NAME NeoElection-COL-2-CTLCardinality-2024-11
FORMULA_NAME NeoElection-COL-2-CTLCardinality-2024-12
FORMULA_NAME NeoElection-COL-2-CTLCardinality-2024-13
FORMULA_NAME NeoElection-COL-2-CTLCardinality-2024-14
FORMULA_NAME NeoElection-COL-2-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716679603200

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-2
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLCardinality COL
Running Version 202405141337
[2024-05-25 23:26:44] [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]
[2024-05-25 23:26:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 23:26:44] [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.
[2024-05-25 23:26:44] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 23:26:45] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 575 ms
[2024-05-25 23:26:45] [INFO ] Detected 6 constant HL places corresponding to 192 PT places.
[2024-05-25 23:26:45] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 438 PT places and 672.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
[2024-05-25 23:26:45] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 3 ms.
[2024-05-25 23:26:45] [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-2-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-2-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-2-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 2 stable transitions
RANDOM walk for 40000 steps (1909 resets) in 1350 ms. (29 steps per ms) remains 10/12 properties
BEST_FIRST walk for 40002 steps (557 resets) in 302 ms. (132 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (591 resets) in 240 ms. (165 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 146 ms. (272 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40002 steps (582 resets) in 112 ms. (354 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (697 resets) in 101 ms. (392 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (2500 resets) in 105 ms. (377 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (719 resets) in 120 ms. (330 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (592 resets) in 103 ms. (384 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 9/9 properties
// Phase 1: matrix 7 rows 6 cols
[2024-05-25 23:26:46] [INFO ] Computed 1 invariants in 2 ms
[2024-05-25 23:26:46] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
After SMT solving in domain Real declared 5/13 variables, and 1 constraints, problems are : Problem set: 9 solved, 0 unsolved in 181 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/6 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 209ms problems are : Problem set: 9 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 9 atomic propositions for a total of 6 simplifications.
FORMULA NeoElection-COL-2-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 23:26:46] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2024-05-25 23:26:46] [INFO ] Flatten gal took : 13 ms
[2024-05-25 23:26:46] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA NeoElection-COL-2-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-2-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-2-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-2-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-2-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-2-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 23:26:46] [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.
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.
Domain [M(3), POS(2), M(3)] of place P_masterList breaks symmetries in sort M
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.
Arc [15:1*[$m, (MOD (ADD $i 1) 2)]] contains successor/predecessor on variables of sort POS
[2024-05-25 23:26:46] [INFO ] Unfolded HLPN to a Petri net with 438 places and 295 transitions 1570 arcs in 36 ms.
[2024-05-25 23:26:46] [INFO ] Unfolded 6 HLPN properties in 1 ms.
Deduced a syphon composed of 403 places in 1 ms
Reduce places removed 407 places and 275 transitions.
Reduce places removed 3 places and 0 transitions.
Support contains 2 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 20/20 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 26 transition count 20
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 4 place count 24 transition count 18
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 24 transition count 18
Applied a total of 6 rules in 23 ms. Remains 24 /28 variables (removed 4) and now considering 18/20 (removed 2) transitions.
[2024-05-25 23:26:46] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
// Phase 1: matrix 17 rows 24 cols
[2024-05-25 23:26:46] [INFO ] Computed 7 invariants in 3 ms
[2024-05-25 23:26:46] [INFO ] Implicit Places using invariants in 99 ms returned [4, 5, 6, 7]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 107 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/28 places, 18/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 139 ms. Remains : 20/28 places, 18/20 transitions.
Support contains 2 out of 20 places after structural reductions.
[2024-05-25 23:26:46] [INFO ] Flatten gal took : 3 ms
[2024-05-25 23:26:46] [INFO ] Flatten gal took : 4 ms
[2024-05-25 23:26:46] [INFO ] Input system was already deterministic with 18 transitions.
FORMULA NeoElection-COL-2-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (1212 resets) in 237 ms. (168 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (442 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (439 resets) in 113 ms. (350 steps per ms) remains 2/2 properties
Probably explored full state space saw : 241 states, properties seen :0
Probabilistic random walk after 689 steps, saw 241 distinct states, run finished after 15 ms. (steps per millisecond=45 ) properties seen :0
Explored full state space saw : 241 states, properties seen :0
Exhaustive walk after 689 steps, saw 241 distinct states, run finished after 6 ms. (steps per millisecond=114 ) properties seen :0
Successfully simplified 2 atomic propositions for a total of 1 simplifications.
[2024-05-25 23:26:46] [INFO ] Flatten gal took : 12 ms
[2024-05-25 23:26:46] [INFO ] Flatten gal took : 2 ms
[2024-05-25 23:26:46] [INFO ] Input system was already deterministic with 18 transitions.
Computed a total of 20 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 18
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 : 20/20 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-25 23:26:46] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
// Phase 1: matrix 17 rows 20 cols
[2024-05-25 23:26:46] [INFO ] Computed 3 invariants in 0 ms
[2024-05-25 23:26:46] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-25 23:26:46] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-25 23:26:46] [INFO ] Invariant cache hit.
[2024-05-25 23:26:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 23:26:47] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Running 16 sub problems to find dead transitions.
[2024-05-25 23:26:47] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-25 23:26:47] [INFO ] Invariant cache hit.
[2024-05-25 23:26:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 2/20 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem TDEAD3 is UNSAT
At refinement iteration 4 (OVERLAPS) 17/37 variables, 20/23 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 1/24 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-05-25 23:26:47] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 17 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 1/25 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 0/37 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 37/37 variables, and 25 constraints, problems are : Problem set: 1 solved, 15 unsolved in 354 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 2/20 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 17/37 variables, 20/24 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 1/25 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 15/40 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 0/40 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 0/37 variables, 0/40 constraints. Problems are: Problem set: 1 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 37/37 variables, and 40 constraints, problems are : Problem set: 1 solved, 15 unsolved in 172 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/16 constraints, Known Traps: 1/1 constraints]
After SMT, in 538ms problems are : Problem set: 1 solved, 15 unsolved
Search for dead transitions found 1 dead transitions in 540ms
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 : 20/20 places, 17/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 17/17 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 645 ms. Remains : 20/20 places, 17/18 transitions.
[2024-05-25 23:26:47] [INFO ] Flatten gal took : 2 ms
[2024-05-25 23:26:47] [INFO ] Flatten gal took : 2 ms
[2024-05-25 23:26:47] [INFO ] Input system was already deterministic with 17 transitions.
[2024-05-25 23:26:47] [INFO ] Flatten gal took : 2 ms
[2024-05-25 23:26:47] [INFO ] Flatten gal took : 2 ms
[2024-05-25 23:26:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality1971924669533665022.gal : 1 ms
[2024-05-25 23:26:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality2045635036120453628.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1971924669533665022.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2045635036120453628.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,241,0.015305,3328,2,94,5,581,6,0,95,479,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.015655,3328,1,0,6,581,7,1,126,479,1
FORMULA NeoElection-COL-2-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-25 23:26:47] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-25 23:26:47] [INFO ] Invariant cache hit.
[2024-05-25 23:26:47] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-25 23:26:47] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-25 23:26:47] [INFO ] Invariant cache hit.
[2024-05-25 23:26:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 23:26:47] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Running 16 sub problems to find dead transitions.
[2024-05-25 23:26:47] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-25 23:26:47] [INFO ] Invariant cache hit.
[2024-05-25 23:26:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 2/20 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem TDEAD3 is UNSAT
At refinement iteration 4 (OVERLAPS) 17/37 variables, 20/23 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 1/24 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-05-25 23:26:47] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 1/25 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 0/37 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 37/37 variables, and 25 constraints, problems are : Problem set: 1 solved, 15 unsolved in 170 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 2/20 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 17/37 variables, 20/24 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 1/25 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 15/40 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 0/40 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 0/37 variables, 0/40 constraints. Problems are: Problem set: 1 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 37/37 variables, and 40 constraints, problems are : Problem set: 1 solved, 15 unsolved in 133 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/16 constraints, Known Traps: 1/1 constraints]
After SMT, in 312ms problems are : Problem set: 1 solved, 15 unsolved
Search for dead transitions found 1 dead transitions in 312ms
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 : 20/20 places, 17/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 17/17 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 380 ms. Remains : 20/20 places, 17/18 transitions.
[2024-05-25 23:26:48] [INFO ] Flatten gal took : 1 ms
[2024-05-25 23:26:48] [INFO ] Flatten gal took : 5 ms
[2024-05-25 23:26:48] [INFO ] Input system was already deterministic with 17 transitions.
[2024-05-25 23:26:48] [INFO ] Flatten gal took : 4 ms
[2024-05-25 23:26:48] [INFO ] Flatten gal took : 1 ms
[2024-05-25 23:26:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality12417073815339006869.gal : 1 ms
[2024-05-25 23:26:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality4323661079272339710.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12417073815339006869.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4323661079272339710.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,241,0.005166,3440,2,94,5,581,6,0,95,479,0


Converting to forward existential form...Done !
original formula: EX(EX(TRUE))
=> equivalent forward existential formula: [(EY(EY(Init)) * TRUE)] != FALSE
(forward)formula 0,1,0.005418,3440,1,0,7,581,7,1,132,479,2
FORMULA NeoElection-COL-2-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-25 23:26:48] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-25 23:26:48] [INFO ] Invariant cache hit.
[2024-05-25 23:26:48] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-25 23:26:48] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-25 23:26:48] [INFO ] Invariant cache hit.
[2024-05-25 23:26:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 23:26:48] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Running 16 sub problems to find dead transitions.
[2024-05-25 23:26:48] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-25 23:26:48] [INFO ] Invariant cache hit.
[2024-05-25 23:26:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 2/20 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem TDEAD3 is UNSAT
At refinement iteration 4 (OVERLAPS) 17/37 variables, 20/23 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 1/24 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-05-25 23:26:48] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 1/25 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 0/37 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 37/37 variables, and 25 constraints, problems are : Problem set: 1 solved, 15 unsolved in 154 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 2/20 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 17/37 variables, 20/24 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 1/25 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 15/40 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 0/40 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 0/37 variables, 0/40 constraints. Problems are: Problem set: 1 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 37/37 variables, and 40 constraints, problems are : Problem set: 1 solved, 15 unsolved in 133 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/16 constraints, Known Traps: 1/1 constraints]
After SMT, in 294ms problems are : Problem set: 1 solved, 15 unsolved
Search for dead transitions found 1 dead transitions in 295ms
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 : 20/20 places, 17/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 17/17 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 376 ms. Remains : 20/20 places, 17/18 transitions.
[2024-05-25 23:26:48] [INFO ] Flatten gal took : 1 ms
[2024-05-25 23:26:48] [INFO ] Flatten gal took : 2 ms
[2024-05-25 23:26:48] [INFO ] Input system was already deterministic with 17 transitions.
[2024-05-25 23:26:48] [INFO ] Flatten gal took : 2 ms
[2024-05-25 23:26:48] [INFO ] Flatten gal took : 1 ms
[2024-05-25 23:26:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality17002352586841086042.gal : 1 ms
[2024-05-25 23:26:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality18260475112953739014.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17002352586841086042.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18260475112953739014.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,241,0.005066,3440,2,94,5,581,6,0,95,479,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.005239,3440,1,0,6,581,7,1,126,479,1
FORMULA NeoElection-COL-2-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-25 23:26:48] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-25 23:26:48] [INFO ] Invariant cache hit.
[2024-05-25 23:26:48] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-25 23:26:48] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-25 23:26:48] [INFO ] Invariant cache hit.
[2024-05-25 23:26:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 23:26:48] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Running 16 sub problems to find dead transitions.
[2024-05-25 23:26:48] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-25 23:26:48] [INFO ] Invariant cache hit.
[2024-05-25 23:26:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 2/20 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem TDEAD3 is UNSAT
At refinement iteration 4 (OVERLAPS) 17/37 variables, 20/23 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 1/24 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-05-25 23:26:48] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 1/25 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 0/37 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 37/37 variables, and 25 constraints, problems are : Problem set: 1 solved, 15 unsolved in 159 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 2/20 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 17/37 variables, 20/24 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 1/25 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 15/40 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 0/40 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 0/37 variables, 0/40 constraints. Problems are: Problem set: 1 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 37/37 variables, and 40 constraints, problems are : Problem set: 1 solved, 15 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/16 constraints, Known Traps: 1/1 constraints]
After SMT, in 325ms problems are : Problem set: 1 solved, 15 unsolved
Search for dead transitions found 1 dead transitions in 326ms
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 : 20/20 places, 17/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 17/17 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 379 ms. Remains : 20/20 places, 17/18 transitions.
[2024-05-25 23:26:48] [INFO ] Flatten gal took : 4 ms
[2024-05-25 23:26:48] [INFO ] Flatten gal took : 2 ms
[2024-05-25 23:26:48] [INFO ] Input system was already deterministic with 17 transitions.
[2024-05-25 23:26:48] [INFO ] Flatten gal took : 2 ms
[2024-05-25 23:26:48] [INFO ] Flatten gal took : 1 ms
[2024-05-25 23:26:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality872790336218851648.gal : 0 ms
[2024-05-25 23:26:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality2131363094138424373.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality872790336218851648.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2131363094138424373.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
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,241,0.004844,3440,2,94,5,581,6,0,95,479,0


Converting to forward existential form...Done !
original formula: EF(EX(TRUE))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * TRUE)] != FALSE
(forward)formula 0,1,0.005511,3440,1,0,6,581,7,1,166,479,1
FORMULA NeoElection-COL-2-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-25 23:26:48] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-25 23:26:48] [INFO ] Invariant cache hit.
[2024-05-25 23:26:48] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-25 23:26:48] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-25 23:26:48] [INFO ] Invariant cache hit.
[2024-05-25 23:26:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 23:26:48] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Running 16 sub problems to find dead transitions.
[2024-05-25 23:26:48] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-25 23:26:48] [INFO ] Invariant cache hit.
[2024-05-25 23:26:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 2/20 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem TDEAD3 is UNSAT
At refinement iteration 4 (OVERLAPS) 17/37 variables, 20/23 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 1/24 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-05-25 23:26:49] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 1/25 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 0/37 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 37/37 variables, and 25 constraints, problems are : Problem set: 1 solved, 15 unsolved in 185 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 2/20 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 17/37 variables, 20/24 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 1/25 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 15/40 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 0/40 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 0/37 variables, 0/40 constraints. Problems are: Problem set: 1 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 37/37 variables, and 40 constraints, problems are : Problem set: 1 solved, 15 unsolved in 128 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/16 constraints, Known Traps: 1/1 constraints]
After SMT, in 321ms problems are : Problem set: 1 solved, 15 unsolved
Search for dead transitions found 1 dead transitions in 322ms
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 : 20/20 places, 17/18 transitions.
Applied a total of 0 rules in 3 ms. Remains 20 /20 variables (removed 0) and now considering 17/17 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 394 ms. Remains : 20/20 places, 17/18 transitions.
[2024-05-25 23:26:49] [INFO ] Flatten gal took : 1 ms
[2024-05-25 23:26:49] [INFO ] Flatten gal took : 2 ms
[2024-05-25 23:26:49] [INFO ] Input system was already deterministic with 17 transitions.
[2024-05-25 23:26:49] [INFO ] Flatten gal took : 1 ms
[2024-05-25 23:26:49] [INFO ] Flatten gal took : 2 ms
[2024-05-25 23:26:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality9385709924374455025.gal : 1 ms
[2024-05-25 23:26:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality3451463790131256320.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9385709924374455025.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3451463790131256320.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,241,0.011574,3440,2,94,5,581,6,0,95,479,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 t2, t13, t14, Intersection with reachable at each step enabled. (destroyed/reverse/intersect...173
dead was empty
(forward)formula 0,1,0.022335,4020,1,0,79,3148,54,25,569,3124,80
FORMULA NeoElection-COL-2-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-25 23:26:49] [INFO ] Flatten gal took : 2 ms
[2024-05-25 23:26:49] [INFO ] Flatten gal took : 2 ms
Total runtime 4962 ms.

BK_STOP 1716679609380

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-2"
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-5568"
echo " Executing tool itstools"
echo " Input is NeoElection-COL-2, 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 r246-tall-171654351600441"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NeoElection-COL-2.tgz
mv NeoElection-COL-2 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;