Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r265-smll-167863539600132.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
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 r265-smll-167863539600132
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.7K Feb 26 16:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 26 16:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 15:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 15:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 16:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 16:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 26 16:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K Feb 26 16:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 81K Mar 5 18:23 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-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 1678779768680

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
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-4
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-14 07:42:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 07:42:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 07:42:51] [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.
[2023-03-14 07:42:51] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-14 07:42:52] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 865 ms
[2023-03-14 07:42:52] [INFO ] Detected 6 constant HL places corresponding to 870 PT places.
[2023-03-14 07:42:52] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 1830 PT places and 3990.0 transition bindings in 124 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2023-03-14 07:42:52] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 7 ms.
[2023-03-14 07:42:52] [INFO ] Skeletonized 12 HLPN properties in 1 ms. Removed 4 properties that had guard overlaps.
Initial state reduction rules removed 1 formulas.
FORMULA NeoElection-COL-4-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.3 ms
Remains 7 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-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 2 stable transitions
Incomplete random walk after 10001 steps, including 350 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 7 rows 6 cols
[2023-03-14 07:42:52] [INFO ] Computed 1 place invariants in 3 ms
[2023-03-14 07:42:52] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
[2023-03-14 07:42:52] [INFO ] Flatten gal took : 21 ms
[2023-03-14 07:42:52] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA NeoElection-COL-4-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-14 07:42:52] [INFO ] Flatten gal took : 3 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.
[2023-03-14 07:42:53] [INFO ] Unfolded HLPN to a Petri net with 1830 places and 1984 transitions 11141 arcs in 142 ms.
[2023-03-14 07:42:53] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 1687 places in 8 ms
Reduce places removed 1703 places and 1857 transitions.
Reduce places removed 5 places and 0 transitions.
FORMULA NeoElection-COL-4-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 66 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 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 26 place count 96 transition count 82
Iterating global reduction 1 with 14 rules applied. Total rules applied 40 place count 96 transition count 82
Applied a total of 40 rules in 19 ms. Remains 96 /122 variables (removed 26) and now considering 82/127 (removed 45) transitions.
[2023-03-14 07:42:53] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
// Phase 1: matrix 73 rows 96 cols
[2023-03-14 07:42:53] [INFO ] Computed 23 place invariants in 8 ms
[2023-03-14 07:42:53] [INFO ] Implicit Places using invariants in 182 ms returned [11, 15, 19, 23]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 190 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 92/122 places, 82/127 transitions.
Applied a total of 0 rules in 2 ms. Remains 92 /92 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 213 ms. Remains : 92/122 places, 82/127 transitions.
Support contains 66 out of 92 places after structural reductions.
[2023-03-14 07:42:53] [INFO ] Flatten gal took : 21 ms
[2023-03-14 07:42:53] [INFO ] Flatten gal took : 20 ms
[2023-03-14 07:42:53] [INFO ] Input system was already deterministic with 82 transitions.
Finished random walk after 21 steps, including 0 resets, run visited all 6 properties in 3 ms. (steps per millisecond=7 )
Computed a total of 92 stabilizing places and 82 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 92 transition count 82
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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p1))||p0)))'
Support contains 26 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 82/82 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 88 transition count 78
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 88 transition count 78
Applied a total of 8 rules in 8 ms. Remains 88 /92 variables (removed 4) and now considering 78/82 (removed 4) transitions.
[2023-03-14 07:42:53] [INFO ] Flow matrix only has 69 transitions (discarded 9 similar events)
// Phase 1: matrix 69 rows 88 cols
[2023-03-14 07:42:53] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-14 07:42:53] [INFO ] Implicit Places using invariants in 115 ms returned [10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 117 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 76/92 places, 78/82 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 78/78 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 128 ms. Remains : 76/92 places, 78/82 transitions.
Stuttering acceptance computed with spot in 348 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : NeoElection-COL-4-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1)), p1:(OR (AND (GEQ s6 1) (GEQ s24 1) (GEQ s53 1)) (AND (GEQ s4 1) (GEQ s10 1) (GEQ s52 1)) (AND (GEQ s9...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 399 ms.
Product exploration explored 100000 steps with 50000 reset in 260 ms.
Computed a total of 76 stabilizing places and 78 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 76 transition count 78
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 obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 7 factoid took 150 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-4-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-4-LTLFireability-02 finished in 1499 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 82/82 transitions.
Reduce places removed 4 places and 4 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 84 transition count 78
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 4 place count 84 transition count 74
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 12 place count 80 transition count 74
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 20 place count 76 transition count 70
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 24 place count 72 transition count 66
Ensure Unique test removed 4 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 28 place count 68 transition count 66
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 32 place count 64 transition count 62
Ensure Unique test removed 4 places
Iterating post reduction 2 with 4 rules applied. Total rules applied 36 place count 60 transition count 62
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 40 place count 56 transition count 58
Applied a total of 40 rules in 43 ms. Remains 56 /92 variables (removed 36) and now considering 58/82 (removed 24) transitions.
[2023-03-14 07:42:55] [INFO ] Flow matrix only has 49 transitions (discarded 9 similar events)
// Phase 1: matrix 49 rows 56 cols
[2023-03-14 07:42:55] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-14 07:42:55] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-14 07:42:55] [INFO ] Flow matrix only has 49 transitions (discarded 9 similar events)
[2023-03-14 07:42:55] [INFO ] Invariant cache hit.
[2023-03-14 07:42:55] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-14 07:42:55] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
[2023-03-14 07:42:55] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 07:42:55] [INFO ] Flow matrix only has 49 transitions (discarded 9 similar events)
[2023-03-14 07:42:55] [INFO ] Invariant cache hit.
[2023-03-14 07:42:55] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/92 places, 58/82 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 378 ms. Remains : 56/92 places, 58/82 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-COL-4-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s49 1) (LT s50 1) (LT s48 1) (LT s51 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1030 reset in 408 ms.
Product exploration explored 100000 steps with 1030 reset in 371 ms.
Computed a total of 56 stabilizing places and 58 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 56 transition count 58
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 obtained : [p0, (X (NOT p0)), (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 135 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-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-4-LTLFireability-05 finished in 1406 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&G(p1))))'
Support contains 28 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 82/82 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 88 transition count 78
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 88 transition count 78
Applied a total of 8 rules in 4 ms. Remains 88 /92 variables (removed 4) and now considering 78/82 (removed 4) transitions.
[2023-03-14 07:42:56] [INFO ] Flow matrix only has 69 transitions (discarded 9 similar events)
// Phase 1: matrix 69 rows 88 cols
[2023-03-14 07:42:56] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-14 07:42:56] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-14 07:42:56] [INFO ] Flow matrix only has 69 transitions (discarded 9 similar events)
[2023-03-14 07:42:56] [INFO ] Invariant cache hit.
[2023-03-14 07:42:56] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-14 07:42:56] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2023-03-14 07:42:56] [INFO ] Flow matrix only has 69 transitions (discarded 9 similar events)
[2023-03-14 07:42:56] [INFO ] Invariant cache hit.
[2023-03-14 07:42:56] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 88/92 places, 78/82 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 332 ms. Remains : 88/92 places, 78/82 transitions.
Stuttering acceptance computed with spot in 198 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : NeoElection-COL-4-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(OR (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1)), p0:(OR (AND (GEQ s17 1) (GEQ s83 1)) (AND (GEQ s15 1) (GEQ s81 1)) (AND (GEQ s20 1) (GEQ s86 1)) (AND...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 24 steps with 0 reset in 1 ms.
FORMULA NeoElection-COL-4-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-4-LTLFireability-06 finished in 553 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 16 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 82/82 transitions.
Reduce places removed 4 places and 4 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 84 transition count 78
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 4 place count 84 transition count 74
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 12 place count 80 transition count 74
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 16 place count 76 transition count 70
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 76 transition count 70
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 24 place count 72 transition count 66
Ensure Unique test removed 4 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 28 place count 68 transition count 66
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 32 place count 64 transition count 62
Ensure Unique test removed 4 places
Iterating post reduction 2 with 4 rules applied. Total rules applied 36 place count 60 transition count 62
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 40 place count 56 transition count 58
Applied a total of 40 rules in 31 ms. Remains 56 /92 variables (removed 36) and now considering 58/82 (removed 24) transitions.
[2023-03-14 07:42:57] [INFO ] Flow matrix only has 49 transitions (discarded 9 similar events)
// Phase 1: matrix 49 rows 56 cols
[2023-03-14 07:42:57] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-14 07:42:57] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-14 07:42:57] [INFO ] Flow matrix only has 49 transitions (discarded 9 similar events)
[2023-03-14 07:42:57] [INFO ] Invariant cache hit.
[2023-03-14 07:42:57] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-14 07:42:57] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2023-03-14 07:42:57] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 07:42:57] [INFO ] Flow matrix only has 49 transitions (discarded 9 similar events)
[2023-03-14 07:42:57] [INFO ] Invariant cache hit.
[2023-03-14 07:42:57] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/92 places, 58/82 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 251 ms. Remains : 56/92 places, 58/82 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-COL-4-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s43 1) (GEQ s51 1)) (AND (GEQ s25 1) (GEQ s49 1)) (AND (GEQ s7 1) (GEQ s48 1)) (AND (GEQ s46 1) (GEQ s51 1)) (AND (GEQ s39 1) (GEQ s51 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 100 steps with 0 reset in 1 ms.
FORMULA NeoElection-COL-4-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-4-LTLFireability-14 finished in 367 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 4 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 82/82 transitions.
Reduce places removed 4 places and 4 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 84 transition count 78
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 4 place count 84 transition count 74
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 12 place count 80 transition count 74
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 20 place count 76 transition count 70
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 24 place count 72 transition count 66
Ensure Unique test removed 4 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 28 place count 68 transition count 66
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 32 place count 64 transition count 62
Ensure Unique test removed 4 places
Iterating post reduction 2 with 4 rules applied. Total rules applied 36 place count 60 transition count 62
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 40 place count 56 transition count 58
Applied a total of 40 rules in 28 ms. Remains 56 /92 variables (removed 36) and now considering 58/82 (removed 24) transitions.
[2023-03-14 07:42:57] [INFO ] Flow matrix only has 49 transitions (discarded 9 similar events)
// Phase 1: matrix 49 rows 56 cols
[2023-03-14 07:42:57] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-14 07:42:57] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-14 07:42:57] [INFO ] Flow matrix only has 49 transitions (discarded 9 similar events)
[2023-03-14 07:42:57] [INFO ] Invariant cache hit.
[2023-03-14 07:42:57] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-14 07:42:57] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
[2023-03-14 07:42:57] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 07:42:57] [INFO ] Flow matrix only has 49 transitions (discarded 9 similar events)
[2023-03-14 07:42:57] [INFO ] Invariant cache hit.
[2023-03-14 07:42:57] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/92 places, 58/82 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 277 ms. Remains : 56/92 places, 58/82 transitions.
Stuttering acceptance computed with spot in 77 ms :[p0, p0]
Running random walk in product with property : NeoElection-COL-4-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LT s49 1) (LT s50 1) (LT s48 1) (LT s51 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 100 steps with 2 reset in 0 ms.
FORMULA NeoElection-COL-4-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-4-LTLFireability-15 finished in 368 ms.
All properties solved by simple procedures.
Total runtime 6607 ms.
ITS solved all properties within timeout

BK_STOP 1678779779288

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-4"
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-5348"
echo " Executing tool ltsminxred"
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 r265-smll-167863539600132"
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.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 ;