Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 8.7K Apr 11 18:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 11 18:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 18:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 18:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 23 07:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 18:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 11 18:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 18:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 11 18:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 75K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717238472606

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeoElection-COL-3
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 10:41:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 10:41:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 10:41:14] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 10:41:14] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 10:41:14] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 731 ms
[2024-06-01 10:41:14] [INFO ] Detected 6 constant HL places corresponding to 448 PT places.
[2024-06-01 10:41:14] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 972 PT places and 1808.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 10:41:15] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 10 ms.
[2024-06-01 10:41:15] [INFO ] Skeletonized 14 HLPN properties in 1 ms. Removed 2 properties that had guard overlaps.
Initial state reduction rules removed 2 formulas.
FORMULA NeoElection-COL-3-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 14 stabilizing places and 8 stable transitions
Graph (complete) has 56 edges and 18 vertex of which 15 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Remains 11 properties that can be checked using skeleton over-approximation.
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 12 places and 7 transitions.
Ensure Unique test removed 8 transitions
Reduce redundant transitions removed 8 transitions.
FORMULA NeoElection-COL-3-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-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 71 steps (1 resets) in 7 ms. (8 steps per ms) remains 0/3 properties
[2024-06-01 10:41:15] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-06-01 10:41:15] [INFO ] Flatten gal took : 44 ms
[2024-06-01 10:41:15] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA NeoElection-COL-3-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 10:41:15] [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.
Domain [M(4), POS(3), M(4)] of place P_masterList breaks symmetries in sort M
Arc [15:1*[$m, (MOD (ADD $i 1) 3)]] 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.
[2024-06-01 10:41:15] [INFO ] Unfolded HLPN to a Petri net with 972 places and 848 transitions 4688 arcs in 113 ms.
[2024-06-01 10:41:15] [INFO ] Unfolded 8 HLPN properties in 1 ms.
Deduced a syphon composed of 892 places in 2 ms
Reduce places removed 901 places and 790 transitions.
Reduce places removed 4 places and 0 transitions.
FORMULA NeoElection-COL-3-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA NeoElection-COL-3-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 58/58 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 61 transition count 58
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 11 place count 56 transition count 46
Iterating global reduction 1 with 5 rules applied. Total rules applied 16 place count 56 transition count 46
Applied a total of 16 rules in 20 ms. Remains 56 /67 variables (removed 11) and now considering 46/58 (removed 12) transitions.
[2024-06-01 10:41:15] [INFO ] Flow matrix only has 42 transitions (discarded 4 similar events)
// Phase 1: matrix 42 rows 56 cols
[2024-06-01 10:41:15] [INFO ] Computed 14 invariants in 9 ms
[2024-06-01 10:41:17] [INFO ] Implicit Places using invariants in 1944 ms returned [7, 8, 9, 10, 11, 12, 13, 14, 15]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 2023 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/67 places, 46/58 transitions.
Applied a total of 0 rules in 3 ms. Remains 47 /47 variables (removed 0) and now considering 46/46 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2067 ms. Remains : 47/67 places, 46/58 transitions.
Support contains 15 out of 47 places after structural reductions.
[2024-06-01 10:41:17] [INFO ] Flatten gal took : 26 ms
[2024-06-01 10:41:17] [INFO ] Flatten gal took : 9 ms
[2024-06-01 10:41:17] [INFO ] Input system was already deterministic with 46 transitions.
RANDOM walk for 62 steps (0 resets) in 9 ms. (6 steps per ms) remains 0/3 properties
FORMULA NeoElection-COL-3-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 47 stabilizing places and 46 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 47 transition count 46
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.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1))))'
Support contains 12 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 46/46 transitions.
Applied a total of 0 rules in 2 ms. Remains 47 /47 variables (removed 0) and now considering 46/46 (removed 0) transitions.
[2024-06-01 10:41:18] [INFO ] Flow matrix only has 42 transitions (discarded 4 similar events)
// Phase 1: matrix 42 rows 47 cols
[2024-06-01 10:41:18] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 10:41:18] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-01 10:41:18] [INFO ] Flow matrix only has 42 transitions (discarded 4 similar events)
[2024-06-01 10:41:18] [INFO ] Invariant cache hit.
[2024-06-01 10:41:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 10:41:18] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Running 43 sub problems to find dead transitions.
[2024-06-01 10:41:18] [INFO ] Flow matrix only has 42 transitions (discarded 4 similar events)
[2024-06-01 10:41:18] [INFO ] Invariant cache hit.
[2024-06-01 10:41:18] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 3/47 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 43 unsolved
Problem TDEAD5 is UNSAT
At refinement iteration 4 (OVERLAPS) 42/89 variables, 47/52 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 2/54 constraints. Problems are: Problem set: 1 solved, 42 unsolved
[2024-06-01 10:41:18] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 8 ms to minimize.
[2024-06-01 10:41:18] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 2 ms to minimize.
[2024-06-01 10:41:18] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-06-01 10:41:18] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2024-06-01 10:41:18] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-06-01 10:41:18] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-06-01 10:41:18] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
[2024-06-01 10:41:18] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-06-01 10:41:18] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 9/63 constraints. Problems are: Problem set: 1 solved, 42 unsolved
[2024-06-01 10:41:19] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 1/64 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 0/64 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 9 (OVERLAPS) 0/89 variables, 0/64 constraints. Problems are: Problem set: 1 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 89/89 variables, and 64 constraints, problems are : Problem set: 1 solved, 42 unsolved in 1150 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 47/47 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 1 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 3/47 variables, 3/5 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 10/15 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 42/89 variables, 47/62 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 2/64 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 42/106 constraints. Problems are: Problem set: 1 solved, 42 unsolved
[2024-06-01 10:41:19] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-06-01 10:41:19] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 2/108 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/89 variables, 0/108 constraints. Problems are: Problem set: 1 solved, 42 unsolved
At refinement iteration 10 (OVERLAPS) 0/89 variables, 0/108 constraints. Problems are: Problem set: 1 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 89/89 variables, and 108 constraints, problems are : Problem set: 1 solved, 42 unsolved in 783 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 47/47 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 42/43 constraints, Known Traps: 12/12 constraints]
After SMT, in 1988ms problems are : Problem set: 1 solved, 42 unsolved
Search for dead transitions found 1 dead transitions in 2002ms
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 : 47/47 places, 45/46 transitions.
Applied a total of 0 rules in 2 ms. Remains 47 /47 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2182 ms. Remains : 47/47 places, 45/46 transitions.
Stuttering acceptance computed with spot in 272 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : NeoElection-COL-3-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA NeoElection-COL-3-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-3-LTLFireability-09 finished in 2642 ms.
All properties solved by simple procedures.
Total runtime 6493 ms.
ITS solved all properties within timeout

BK_STOP 1717238480612

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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-3"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is NeoElection-COL-3, 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 r508-tall-171654351600452"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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