Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r142-tall-174876811900060.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is NeoElection-COL-4, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-tall-174876811900060
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 81K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748795937090

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-4
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202505121319
[2025-06-01 16:38:58] [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]
[2025-06-01 16:38:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 16:38:58] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-01 16:38:58] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-01 16:38:59] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 641 ms
[2025-06-01 16:38:59] [INFO ] Detected 6 constant HL places corresponding to 870 PT places.
[2025-06-01 16:38:59] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 1830 PT places and 3990.0 transition bindings in 28 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2025-06-01 16:38:59] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 6 ms.
[2025-06-01 16:38:59] [INFO ] Skeletonized 9 HLPN properties in 1 ms. Removed 7 properties that had guard overlaps.
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 8 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-4-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 2 stable transitions
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 52 steps (0 resets) in 10 ms. (4 steps per ms) remains 0/3 properties
[2025-06-01 16:38:59] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2025-06-01 16:38:59] [INFO ] Flatten gal took : 13 ms
FORMULA NeoElection-COL-4-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-01 16:38:59] [INFO ] Flatten gal took : 2 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :MT
Arc [9:1*[$m, $s, 3, 0]] contains constants of sort MT
Transition T_poll__handleAI1 : constants on arcs in [[9:1*[$m, $s, 3, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 2 subsets.
Arc [9:1*[$m, $s, 3, 0]] contains constants of sort MT
Transition T_poll__handleAI2 : constants on arcs in [[9:1*[$m, $s, 3, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 2 subsets.
Arc [9:1*[$m, $s, 4, 0]] contains constants of sort MT
Transition T_poll__handleAnnP1 : constants on arcs in [[9:1*[$m, $s, 4, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 3 subsets.
Arc [9:1*[$m, $s, 4, 0]] contains constants of sort MT
Transition T_poll__handleAnnP2 : constants on arcs in [[9:1*[$m, $s, 4, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 3 subsets.
Arc [9:1*[$m, $s, 1, 0]] contains constants of sort MT
Transition T_poll__handleAnsP1 : constants on arcs in [[9:1*[$m, $s, 1, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 4 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP1 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP2 : constants on arcs in [[9:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP2 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP3 : constants on arcs in [[9:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [11:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP4 : constants on arcs in [[11:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP4 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 0, 0]] contains constants of sort MT
Transition T_poll__handleAskP : constants on arcs in [[9:1*[$m, $s, 0, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 6 subsets.
Domain [M(5), POS(4), M(5)] of place P_masterList breaks symmetries in sort M
Arc [15:1*[$m, (MOD (ADD $i 1) 4)]] contains successor/predecessor on variables of sort POS
Symmetric sort wr.t. initial and guards and successors and join/free detected :STAGE
Arc [16:1*[$m, 0]] contains constants of sort STAGE
Transition T_poll__iAmPrimary : constants on arcs in [[16:1*[$m, 0]]] introduces in STAGE(3) partition with 1 elements that refines current partition to 2 subsets.
Arc [16:1*[$m, 1]] contains constants of sort STAGE
Transition T_poll__iAmPrimary : constants on arcs in [[16:1*[$m, 1]]] introduces in STAGE(3) partition with 1 elements that refines current partition to 3 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :NEGSTEP
Arc [8:1*[$m, $r, 1]] contains constants of sort NEGSTEP
Transition T_poll__handleAI1 : constants on arcs in [[8:1*[$m, $r, 1]]] introduces in NEGSTEP(3) partition with 1 elements that refines current partition to 2 subsets.
Arc [8:1*[$m, $r, 2]] contains constants of sort NEGSTEP
Transition T_poll__handleAI1 : constants on arcs in [[8:1*[$m, $r, 2]]] introduces in NEGSTEP(3) partition with 1 elements that refines current partition to 3 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :BOOL
Arc [7:1*[$m, 0, $pm]] contains constants of sort BOOL
Transition T_poll__handleAI2 : constants on arcs in [[7:1*[$m, 0, $pm]]] introduces in BOOL(2) partition with 1 elements that refines current partition to 2 subsets.
[2025-06-01 16:38:59] [INFO ] Unfolded HLPN to a Petri net with 1830 places and 1984 transitions 11141 arcs in 68 ms.
[2025-06-01 16:38:59] [INFO ] Unfolded 12 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 1687 places in 6 ms
Reduce places removed 1703 places and 1857 transitions.
Reduce places removed 5 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA NeoElection-COL-4-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 65 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 127/127 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 110 transition count 127
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 17 place count 105 transition count 105
Iterating global reduction 1 with 5 rules applied. Total rules applied 22 place count 105 transition count 105
Applied a total of 22 rules in 13 ms. Remains 105 /122 variables (removed 17) and now considering 105/127 (removed 22) transitions.
[2025-06-01 16:38:59] [INFO ] Flow matrix only has 96 transitions (discarded 9 similar events)
// Phase 1: matrix 96 rows 105 cols
[2025-06-01 16:38:59] [INFO ] Computed 23 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:38:59] [INFO ] Implicit Places using invariants in 232 ms returned [10, 11, 12, 13, 14, 16, 18, 20, 22, 24, 26, 28, 30]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 259 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 92/122 places, 105/127 transitions.
Applied a total of 0 rules in 2 ms. Remains 92 /92 variables (removed 0) and now considering 105/105 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 280 ms. Remains : 92/122 places, 105/127 transitions.
Support contains 65 out of 92 places after structural reductions.
[2025-06-01 16:38:59] [INFO ] Flatten gal took : 16 ms
[2025-06-01 16:38:59] [INFO ] Flatten gal took : 26 ms
[2025-06-01 16:38:59] [INFO ] Input system was already deterministic with 105 transitions.
Support contains 53 out of 92 places (down from 65) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 256 steps (0 resets) in 34 ms. (7 steps per ms) remains 0/6 properties
FORMULA NeoElection-COL-4-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 92 stabilizing places and 105 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 92 transition count 105
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 105/105 transitions.
Reduce places removed 4 places and 4 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 75 transition count 74
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 75 transition count 74
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 42 place count 67 transition count 66
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 63 transition count 62
Applied a total of 46 rules in 20 ms. Remains 63 /92 variables (removed 29) and now considering 62/105 (removed 43) transitions.
[2025-06-01 16:39:00] [INFO ] Flow matrix only has 53 transitions (discarded 9 similar events)
// Phase 1: matrix 53 rows 63 cols
[2025-06-01 16:39:00] [INFO ] Computed 10 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:39:00] [INFO ] Implicit Places using invariants in 76 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 77 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/92 places, 62/105 transitions.
Applied a total of 0 rules in 4 ms. Remains 60 /60 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 101 ms. Remains : 60/92 places, 62/105 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-COL-4-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 245 ms.
Product exploration explored 100000 steps with 50000 reset in 145 ms.
Computed a total of 60 stabilizing places and 62 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 60 transition count 62
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p0), (X p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 21 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-4-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-4-LTLFireability-00 finished in 757 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X((G(!p1) U (p2&&G(!p1))))||p0) U X(p3))))'
Support contains 26 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 105/105 transitions.
Applied a total of 0 rules in 3 ms. Remains 92 /92 variables (removed 0) and now considering 105/105 (removed 0) transitions.
[2025-06-01 16:39:00] [INFO ] Flow matrix only has 96 transitions (discarded 9 similar events)
// Phase 1: matrix 96 rows 92 cols
[2025-06-01 16:39:00] [INFO ] Computed 10 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:39:00] [INFO ] Implicit Places using invariants in 112 ms returned []
[2025-06-01 16:39:00] [INFO ] Flow matrix only has 96 transitions (discarded 9 similar events)
[2025-06-01 16:39:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:39:01] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-01 16:39:01] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2025-06-01 16:39:01] [INFO ] Flow matrix only has 96 transitions (discarded 9 similar events)
[2025-06-01 16:39:01] [INFO ] Invariant cache hit.
[2025-06-01 16:39:01] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 4/92 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD28 is UNSAT
At refinement iteration 5 (OVERLAPS) 96/188 variables, 92/102 constraints. Problems are: Problem set: 3 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 7/109 constraints. Problems are: Problem set: 3 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:39:02] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:39:03] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:39:03] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:39:03] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:39:03] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:39:03] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:39:03] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:39:03] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:39:03] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:39:03] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:39:03] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:39:03] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:39:03] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:39:03] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:39:03] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:39:03] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:39:03] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:39:03] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:39:03] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:39:04] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 20/129 constraints. Problems are: Problem set: 3 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:39:04] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:39:04] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:39:04] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 3/132 constraints. Problems are: Problem set: 3 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 0/132 constraints. Problems are: Problem set: 3 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 0/188 variables, 0/132 constraints. Problems are: Problem set: 3 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 132 constraints, problems are : Problem set: 3 solved, 98 unsolved in 5151 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 92/92 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 98 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 3/6 constraints. Problems are: Problem set: 3 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 2/8 constraints. Problems are: Problem set: 3 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 4/92 variables, 4/12 constraints. Problems are: Problem set: 3 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 21/33 constraints. Problems are: Problem set: 3 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/33 constraints. Problems are: Problem set: 3 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 96/188 variables, 92/125 constraints. Problems are: Problem set: 3 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 7/132 constraints. Problems are: Problem set: 3 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 98/230 constraints. Problems are: Problem set: 3 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:39:07] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 16:39:07] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 2/232 constraints. Problems are: Problem set: 3 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 0/232 constraints. Problems are: Problem set: 3 solved, 98 unsolved
At refinement iteration 12 (OVERLAPS) 0/188 variables, 0/232 constraints. Problems are: Problem set: 3 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 232 constraints, problems are : Problem set: 3 solved, 98 unsolved in 7644 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 92/92 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 98/101 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12860ms problems are : Problem set: 3 solved, 98 unsolved
Search for dead transitions found 3 dead transitions in 12867ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 92/92 places, 102/105 transitions.
Applied a total of 0 rules in 2 ms. Remains 92 /92 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 13107 ms. Remains : 92/92 places, 102/105 transitions.
Stuttering acceptance computed with spot in 330 ms :[(NOT p3), (NOT p3), (NOT p3), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), true, p1, (OR (NOT p2) p1)]
Running random walk in product with property : NeoElection-COL-4-LTLFireability-08
Entered a terminal (fully accepting) state of product in 15 steps with 0 reset in 1 ms.
FORMULA NeoElection-COL-4-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-4-LTLFireability-08 finished in 13462 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 22 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 105/105 transitions.
Reduce places removed 4 places and 4 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 88 transition count 97
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 84 transition count 97
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 21 place count 71 transition count 70
Iterating global reduction 0 with 13 rules applied. Total rules applied 34 place count 71 transition count 70
Applied a total of 34 rules in 15 ms. Remains 71 /92 variables (removed 21) and now considering 70/105 (removed 35) transitions.
[2025-06-01 16:39:14] [INFO ] Flow matrix only has 61 transitions (discarded 9 similar events)
// Phase 1: matrix 61 rows 71 cols
[2025-06-01 16:39:14] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:39:14] [INFO ] Implicit Places using invariants in 59 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 63 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 68/92 places, 70/105 transitions.
Applied a total of 0 rules in 3 ms. Remains 68 /68 variables (removed 0) and now considering 70/70 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 81 ms. Remains : 68/92 places, 70/105 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-COL-4-LTLFireability-09
Product exploration explored 100000 steps with 884 reset in 502 ms.
Product exploration explored 100000 steps with 884 reset in 417 ms.
Computed a total of 68 stabilizing places and 70 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 68 transition count 70
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 17 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-4-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-4-LTLFireability-09 finished in 1121 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(!p0)))'
Support contains 4 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 105/105 transitions.
Reduce places removed 4 places and 4 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 88 transition count 97
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 84 transition count 97
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 17 place count 75 transition count 74
Iterating global reduction 0 with 9 rules applied. Total rules applied 26 place count 75 transition count 74
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 42 place count 67 transition count 66
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 63 transition count 62
Applied a total of 46 rules in 22 ms. Remains 63 /92 variables (removed 29) and now considering 62/105 (removed 43) transitions.
[2025-06-01 16:39:15] [INFO ] Flow matrix only has 53 transitions (discarded 9 similar events)
// Phase 1: matrix 53 rows 63 cols
[2025-06-01 16:39:15] [INFO ] Computed 10 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 16:39:15] [INFO ] Implicit Places using invariants in 96 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 97 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/92 places, 62/105 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 122 ms. Remains : 60/92 places, 62/105 transitions.
Stuttering acceptance computed with spot in 78 ms :[p0, true, p0]
Running random walk in product with property : NeoElection-COL-4-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NeoElection-COL-4-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-4-LTLFireability-12 finished in 211 ms.
All properties solved by simple procedures.
Total runtime 17290 ms.

BK_STOP 1748795956016

--------------------
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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-4"
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-5832"
echo " Executing tool itstools"
echo " Input is NeoElection-COL-4, 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 r142-tall-174876811900060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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