Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.6K Mar 8 07:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Mar 8 07:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Mar 8 07:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Mar 8 07:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.9K Mar 16 08:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 16 08:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 16 08:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 16 08:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 8 07:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Mar 8 07:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Mar 8 07:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Mar 8 07:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 16 08:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 16 08:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 70K Mar 3 18:30 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-2-LTLFireability-00
FORMULA_NAME NeoElection-COL-2-LTLFireability-01
FORMULA_NAME NeoElection-COL-2-LTLFireability-02
FORMULA_NAME NeoElection-COL-2-LTLFireability-03
FORMULA_NAME NeoElection-COL-2-LTLFireability-04
FORMULA_NAME NeoElection-COL-2-LTLFireability-05
FORMULA_NAME NeoElection-COL-2-LTLFireability-06
FORMULA_NAME NeoElection-COL-2-LTLFireability-07
FORMULA_NAME NeoElection-COL-2-LTLFireability-08
FORMULA_NAME NeoElection-COL-2-LTLFireability-09
FORMULA_NAME NeoElection-COL-2-LTLFireability-10
FORMULA_NAME NeoElection-COL-2-LTLFireability-11
FORMULA_NAME NeoElection-COL-2-LTLFireability-12
FORMULA_NAME NeoElection-COL-2-LTLFireability-13
FORMULA_NAME NeoElection-COL-2-LTLFireability-14
FORMULA_NAME NeoElection-COL-2-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779725575091

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
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
LTLFireability COL
Running Version 202604301425
[2026-05-25 16:12:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 16:12:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 16:12:56] [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.
[2026-05-25 16:12:56] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-25 16:12:56] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 559 ms
[2026-05-25 16:12:56] [INFO ] Detected 6 constant HL places corresponding to 192 PT places.
[2026-05-25 16:12:56] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 438 PT places and 672.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2026-05-25 16:12:57] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 5 ms.
[2026-05-25 16:12:57] [INFO ] Skeletonized 6 HLPN properties in 1 ms. Removed 10 properties that had guard overlaps.
Initial state reduction rules removed 2 formulas.
FORMULA NeoElection-COL-2-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-2-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 14 stabilizing places and 8 stable transitions
Graph (complete) has 56 edges and 18 vertex of which 15 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Remains 3 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.
Computed a total of 2 stabilizing places and 2 stable transitions
RANDOM walk for 64 steps (2 resets) in 14 ms. (4 steps per ms) remains 0/3 properties
[2026-05-25 16:12:57] [INFO ] Flatten gal took : 12 ms
[2026-05-25 16:12:57] [INFO ] Flatten gal took : 1 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
[2026-05-25 16:12:57] [INFO ] Unfolded HLPN to a Petri net with 438 places and 295 transitions 1570 arcs in 33 ms.
[2026-05-25 16:12:57] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Initial state reduction rules removed 2 formulas.
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.
Initial state reduction rules removed 1 formulas.
FORMULA NeoElection-COL-2-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-2-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-2-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-2-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-2-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-2-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-2-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-2-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-2-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 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
Applied a total of 2 rules in 8 ms. Remains 26 /28 variables (removed 2) and now considering 20/20 (removed 0) transitions.
[2026-05-25 16:12:57] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4236802478610497759.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1714009486905763000.kers'
[2026-05-25 16:12:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4236802478610497759.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1714009486905763000.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 19 rows 25 cols 63 entries
Finished phase 1 with 15 SingleSign rule and 4 generalized
[2026-05-25 16:12:57] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1714009486905763000.kers
Total runtime 1 ms.
[2026-05-25 16:12:57] [INFO ] Implicit Places using invariants in 166 ms returned [4, 6]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 193 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/28 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 210 ms. Remains : 24/28 places, 20/20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2026-05-25 16:12:57] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8566638635907308805.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-868796335495722300.kers'
[2026-05-25 16:12:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8566638635907308805.kers, --Pflows, --basisKERS=/tmp/petrispot-output-868796335495722300.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 19 rows 23 cols 61 entries
Finished phase 1 with 17 SingleSign rule and 2 generalized
[2026-05-25 16:12:57] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-868796335495722300.kers
Total runtime 0 ms.
[2026-05-25 16:12:57] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-25 16:12:57] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
[2026-05-25 16:12:57] [INFO ] Invariant cache hit.
[2026-05-25 16:12:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 16:12:57] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Running 18 sub problems to find dead transitions.
[2026-05-25 16:12:57] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
[2026-05-25 16:12:57] [INFO ] Invariant cache hit.
[2026-05-25 16:12:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 2/24 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Problem TDEAD3 is UNSAT
At refinement iteration 5 (OVERLAPS) 19/43 variables, 24/29 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/30 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 3/33 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/43 variables, 1/34 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/43 variables, 0/34 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/43 variables, 0/34 constraints. Problems are: Problem set: 1 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 34 constraints, problems are : Problem set: 1 solved, 17 unsolved in 560 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 24/24 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 2/24 variables, 2/5 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 4/9 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 19/43 variables, 24/33 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 1/34 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/43 variables, 17/51 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/43 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/43 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 51 constraints, problems are : Problem set: 1 solved, 17 unsolved in 329 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 24/24 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/18 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 918ms problems are : Problem set: 1 solved, 17 unsolved
Search for dead transitions found 1 dead transitions in 927ms
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 : 24/24 places, 19/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 19/19 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1015 ms. Remains : 24/24 places, 19/20 transitions.
Support contains 18 out of 24 places after structural reductions.
[2026-05-25 16:12:58] [INFO ] Flatten gal took : 3 ms
[2026-05-25 16:12:58] [INFO ] Flatten gal took : 3 ms
[2026-05-25 16:12:58] [INFO ] Input system was already deterministic with 19 transitions.
RANDOM walk for 40000 steps (1212 resets) in 699 ms. (57 steps per ms) remains 1/8 properties
BEST_FIRST walk for 40002 steps (451 resets) in 210 ms. (189 steps per ms) remains 1/1 properties
[2026-05-25 16:12:58] [INFO ] Flow matrix only has 18 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-758724136145729736.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2234266058429369065.kers'
[2026-05-25 16:12:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-758724136145729736.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2234266058429369065.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 18 rows 23 cols 57 entries
Finished phase 1 with 17 SingleSign rule and 1 generalized
[2026-05-25 16:12:58] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2234266058429369065.kers
Total runtime 0 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 12/19 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp1 is UNSAT
After SMT solving in domain Real declared 19/42 variables, and 6 constraints, problems are : Problem set: 1 solved, 0 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/24 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 5 simplifications.
FORMULA NeoElection-COL-2-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 24 stabilizing places and 19 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 24 transition count 19
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 19/19 transitions.
Reduce places removed 2 places and 2 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 22 transition count 15
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 20 transition count 15
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 18 transition count 13
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 18 transition count 13
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 16 transition count 11
Applied a total of 10 rules in 10 ms. Remains 16 /24 variables (removed 8) and now considering 11/19 (removed 8) transitions.
[2026-05-25 16:12:58] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8376816496125289457.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2757151274620605477.kers'
[2026-05-25 16:12:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8376816496125289457.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2757151274620605477.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 10 rows 12 cols 26 entries
Finished phase 1 with 9 SingleSign rule and 1 generalized
[2026-05-25 16:12:58] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2757151274620605477.kers
Total runtime 0 ms.
[2026-05-25 16:12:59] [INFO ] Implicit Places using invariants in 29 ms returned [2, 3]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 30 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/24 places, 11/19 transitions.
Applied a total of 0 rules in 2 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 42 ms. Remains : 14/24 places, 11/19 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 138 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-COL-2-LTLFireability-01
Product exploration explored 100000 steps with 13617 reset in 273 ms.
Product exploration explored 100000 steps with 13622 reset in 130 ms.
Computed a total of 14 stabilizing places and 11 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 14 transition count 11
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 4 factoid took 75 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
RANDOM walk for 26 steps (0 resets) in 5 ms. (4 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 54 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2026-05-25 16:12:59] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3674030488595801284.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17247736109903053006.kers'
[2026-05-25 16:12:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3674030488595801284.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17247736109903053006.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 10 rows 11 cols 25 entries
Finished phase 1 with 10 SingleSign rule and 0 generalized
[2026-05-25 16:12:59] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17247736109903053006.kers
Total runtime 0 ms.
[2026-05-25 16:12:59] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-25 16:12:59] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2026-05-25 16:12:59] [INFO ] Computed and/alt/rep : 9/16/8 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 16:12:59] [INFO ] Added : 4 causal constraints over 1 iterations in 11 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 296 ms.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 2 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2026-05-25 16:12:59] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
[2026-05-25 16:12:59] [INFO ] Invariant cache hit.
[2026-05-25 16:12:59] [INFO ] Implicit Places using invariants in 32 ms returned []
[2026-05-25 16:12:59] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
[2026-05-25 16:12:59] [INFO ] Invariant cache hit.
[2026-05-25 16:12:59] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2026-05-25 16:12:59] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2026-05-25 16:12:59] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
[2026-05-25 16:12:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 2/14 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 10/24 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/24 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 18 constraints, problems are : Problem set: 0 solved, 9 unsolved in 102 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 2/14 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 10/24 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/24 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 27 constraints, problems are : Problem set: 0 solved, 9 unsolved in 109 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 213ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 213ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 283 ms. Remains : 14/14 places, 11/11 transitions.
Computed a total of 14 stabilizing places and 11 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 14 transition count 11
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 4 factoid took 52 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
RANDOM walk for 20 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 68 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
[2026-05-25 16:13:00] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
[2026-05-25 16:13:00] [INFO ] Invariant cache hit.
[2026-05-25 16:13:00] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-25 16:13:00] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2026-05-25 16:13:00] [INFO ] Computed and/alt/rep : 9/16/8 causal constraints (skipped 0 transitions) in 0 ms.
[2026-05-25 16:13:00] [INFO ] Added : 4 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 245 ms.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Product exploration explored 100000 steps with 13629 reset in 161 ms.
Product exploration explored 100000 steps with 13637 reset in 110 ms.
Built C files in :
/tmp/ltsmin12215148700374446694
[2026-05-25 16:13:00] [INFO ] Computing symmetric may disable matrix : 11 transitions.
[2026-05-25 16:13:00] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 16:13:00] [INFO ] Computing symmetric may enable matrix : 11 transitions.
[2026-05-25 16:13:00] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 16:13:00] [INFO ] Computing Do-Not-Accords matrix : 11 transitions.
[2026-05-25 16:13:00] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 16:13:00] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12215148700374446694
Running compilation step : cd /tmp/ltsmin12215148700374446694;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 269 ms.
Running link step : cd /tmp/ltsmin12215148700374446694;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin12215148700374446694;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3838431518619993904.hoa' '--buchi-type=spotba'
LTSmin run took 43 ms.
FORMULA NeoElection-COL-2-LTLFireability-01 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property NeoElection-COL-2-LTLFireability-01 finished in 2330 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 19/19 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 24 transition count 17
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 22 transition count 17
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 22 transition count 15
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 20 transition count 15
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 18 transition count 13
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 18 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 12 place count 18 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 16 transition count 11
Applied a total of 16 rules in 18 ms. Remains 16 /24 variables (removed 8) and now considering 11/19 (removed 8) transitions.
[2026-05-25 16:13:01] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14388434876416423994.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2686062423841170242.kers'
[2026-05-25 16:13:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14388434876416423994.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2686062423841170242.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 10 rows 13 cols 23 entries
Finished phase 1 with 9 SingleSign rule and 1 generalized
[2026-05-25 16:13:01] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2686062423841170242.kers
Total runtime 0 ms.
[2026-05-25 16:13:01] [INFO ] Implicit Places using invariants in 35 ms returned [4, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 45 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/24 places, 11/19 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 64 ms. Remains : 14/24 places, 11/19 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-2-LTLFireability-10
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA NeoElection-COL-2-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-2-LTLFireability-10 finished in 184 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 8 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 19/19 transitions.
Reduce places removed 2 places and 2 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 22 transition count 15
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 20 transition count 15
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 18 transition count 13
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 18 transition count 13
Applied a total of 8 rules in 4 ms. Remains 18 /24 variables (removed 6) and now considering 13/19 (removed 6) transitions.
[2026-05-25 16:13:01] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4283026979040704530.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10802224181978651941.kers'
[2026-05-25 16:13:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4283026979040704530.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10802224181978651941.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 12 rows 17 cols 45 entries
Finished phase 1 with 11 SingleSign rule and 1 generalized
[2026-05-25 16:13:01] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10802224181978651941.kers
Total runtime 0 ms.
[2026-05-25 16:13:01] [INFO ] Implicit Places using invariants in 25 ms returned []
[2026-05-25 16:13:01] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2026-05-25 16:13:01] [INFO ] Invariant cache hit.
[2026-05-25 16:13:01] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2026-05-25 16:13:01] [INFO ] Redundant transitions in 1 ms returned []
Running 11 sub problems to find dead transitions.
[2026-05-25 16:13:01] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2026-05-25 16:13:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 2/18 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 12/30 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/30 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 24 constraints, problems are : Problem set: 0 solved, 11 unsolved in 118 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 18/18 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 2/18 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 12/30 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 11/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 0/30 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 35 constraints, problems are : Problem set: 0 solved, 11 unsolved in 140 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 18/18 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 263ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 264ms
Starting structural reductions in SI_LTL mode, iteration 1 : 18/24 places, 13/19 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 327 ms. Remains : 18/24 places, 13/19 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NeoElection-COL-2-LTLFireability-12
Stuttering criterion allowed to conclude after 38 steps with 1 reset in 0 ms.
FORMULA NeoElection-COL-2-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-2-LTLFireability-12 finished in 489 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||F((G(F(p1))||(!p0&&F(p1))))))'
Support contains 6 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 19/19 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 22 transition count 17
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 22 transition count 17
Applied a total of 4 rules in 1 ms. Remains 22 /24 variables (removed 2) and now considering 17/19 (removed 2) transitions.
[2026-05-25 16:13:01] [INFO ] Flow matrix only has 16 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2440694904465749233.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1057588625409381524.kers'
[2026-05-25 16:13:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2440694904465749233.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1057588625409381524.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 16 rows 21 cols 53 entries
Finished phase 1 with 15 SingleSign rule and 1 generalized
[2026-05-25 16:13:01] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1057588625409381524.kers
Total runtime 0 ms.
[2026-05-25 16:13:01] [INFO ] Implicit Places using invariants in 31 ms returned [4, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 33 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 17/19 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 35 ms. Remains : 20/24 places, 17/19 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||F((G(F(p1))||(!p0&&F(p1))))))'
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NeoElection-COL-2-LTLFireability-15
Product exploration explored 100000 steps with 19533 reset in 103 ms.
Product exploration explored 100000 steps with 19517 reset in 112 ms.
Computed a total of 20 stabilizing places and 17 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 17
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 11 factoid took 17 ms. Proved property starting from automaton with 4 states, 7 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 54 ms.
FORMULA NeoElection-COL-2-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-2-LTLFireability-15 finished in 508 ms.
All properties solved by simple procedures.
Total runtime 6201 ms.

BK_STOP 1779725582805

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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="LTLFireability"
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-5973"
echo " Executing tool itstools"
echo " Input is NeoElection-COL-2, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r194-tall-177969913900148"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;