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.r263-tall-171654372500288.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 gold2023
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 r263-tall-171654372500288
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.6K Apr 11 18:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Apr 11 18:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 11 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 11 18:23 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.6K Apr 23 07:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 23 07:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 18:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 11 18:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 11 18:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 11 18:46 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 81K 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-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 1716685462903

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeoElection-COL-4
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202304061127
[2024-05-26 01:04:24] [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]
[2024-05-26 01:04:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 01:04:24] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-26 01:04:24] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-26 01:04:25] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 831 ms
[2024-05-26 01:04:25] [INFO ] Detected 6 constant HL places corresponding to 870 PT places.
[2024-05-26 01:04:25] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 1830 PT places and 3990.0 transition bindings in 25 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2024-05-26 01:04:25] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 13 ms.
[2024-05-26 01:04:25] [INFO ] Skeletonized 11 HLPN properties in 1 ms. Removed 5 properties that had guard overlaps.
Initial state reduction rules removed 1 formulas.
FORMULA NeoElection-COL-4-LTLFireability-15 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.1 ms
Remains 9 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-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 2 stable transitions
Finished random walk after 33 steps, including 1 resets, run visited all 6 properties in 10 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
[2024-05-26 01:04:25] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-05-26 01:04:25] [INFO ] Flatten gal took : 14 ms
FORMULA NeoElection-COL-4-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-26 01:04:25] [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.
[2024-05-26 01:04:25] [INFO ] Unfolded HLPN to a Petri net with 1830 places and 1984 transitions 11141 arcs in 64 ms.
[2024-05-26 01:04:25] [INFO ] Unfolded 13 HLPN properties in 1 ms.
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 3 formulas.
FORMULA NeoElection-COL-4-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 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.
[2024-05-26 01:04:25] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
// Phase 1: matrix 73 rows 96 cols
[2024-05-26 01:04:25] [INFO ] Computed 23 invariants in 7 ms
[2024-05-26 01:04:25] [INFO ] Implicit Places using invariants in 187 ms returned [10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 190 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/122 places, 82/127 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 210 ms. Remains : 80/122 places, 82/127 transitions.
Support contains 50 out of 80 places after structural reductions.
[2024-05-26 01:04:25] [INFO ] Flatten gal took : 18 ms
[2024-05-26 01:04:25] [INFO ] Flatten gal took : 11 ms
[2024-05-26 01:04:25] [INFO ] Input system was already deterministic with 82 transitions.
Finished random walk after 41 steps, including 0 resets, run visited all 9 properties in 5 ms. (steps per millisecond=8 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 80 stabilizing places and 82 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 80 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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(F(p1)))))'
Support contains 8 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 82/82 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 76 transition count 78
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 76 transition count 78
Applied a total of 8 rules in 4 ms. Remains 76 /80 variables (removed 4) and now considering 78/82 (removed 4) transitions.
[2024-05-26 01:04:26] [INFO ] Flow matrix only has 69 transitions (discarded 9 similar events)
// Phase 1: matrix 69 rows 76 cols
[2024-05-26 01:04:26] [INFO ] Computed 7 invariants in 1 ms
[2024-05-26 01:04:26] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-26 01:04:26] [INFO ] Flow matrix only has 69 transitions (discarded 9 similar events)
[2024-05-26 01:04:26] [INFO ] Invariant cache hit.
[2024-05-26 01:04:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 01:04:26] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2024-05-26 01:04:26] [INFO ] Flow matrix only has 69 transitions (discarded 9 similar events)
[2024-05-26 01:04:26] [INFO ] Invariant cache hit.
[2024-05-26 01:04:26] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 76/80 places, 78/82 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 219 ms. Remains : 76/80 places, 78/82 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 381 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (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=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (LT s0 1) (LT s1 1) (LT s2 1) (LT s3 1)), p1:(AND (LT s60 1) (LT s63 1) (LT s61 1) (LT s62 1))], nbAcceptance=0, 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 16171 reset in 318 ms.
Product exploration explored 100000 steps with 16175 reset in 213 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 (NOT p0) p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0))), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 15 ms. Reduced automaton from 4 states, 5 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 1266 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 16 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 82/82 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 76 transition count 74
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 72 transition count 74
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 68 transition count 70
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 68 transition count 70
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 32 place count 60 transition count 62
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 56 transition count 58
Applied a total of 36 rules in 23 ms. Remains 56 /80 variables (removed 24) and now considering 58/82 (removed 24) transitions.
[2024-05-26 01:04:27] [INFO ] Flow matrix only has 49 transitions (discarded 9 similar events)
// Phase 1: matrix 49 rows 56 cols
[2024-05-26 01:04:27] [INFO ] Computed 7 invariants in 1 ms
[2024-05-26 01:04:27] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-26 01:04:27] [INFO ] Flow matrix only has 49 transitions (discarded 9 similar events)
[2024-05-26 01:04:27] [INFO ] Invariant cache hit.
[2024-05-26 01:04:27] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 01:04:27] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2024-05-26 01:04:27] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-26 01:04:27] [INFO ] Flow matrix only has 49 transitions (discarded 9 similar events)
[2024-05-26 01:04:27] [INFO ] Invariant cache hit.
[2024-05-26 01:04:27] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/80 places, 58/82 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 186 ms. Remains : 56/80 places, 58/82 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-COL-4-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s8 1) (GEQ s48 1)) (AND (GEQ s44 1) (GEQ s51 1)) (AND (GEQ s26 1) (GEQ s49 1)) (AND (GEQ s22 1) (GEQ s49 1)) (AND (GEQ s15 1) (GEQ s48 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 6624 reset in 318 ms.
Product exploration explored 100000 steps with 6609 reset in 267 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 93 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 172 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
[2024-05-26 01:04:28] [INFO ] Flow matrix only has 49 transitions (discarded 9 similar events)
[2024-05-26 01:04:28] [INFO ] Invariant cache hit.
[2024-05-26 01:04:29] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-26 01:04:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 01:04:29] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-26 01:04:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 01:04:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-26 01:04:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 01:04:29] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-26 01:04:29] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 01:04:29] [INFO ] [Nat]Added 3 Read/Feed constraints in 12 ms returned sat
[2024-05-26 01:04:29] [INFO ] Computed and/alt/rep : 54/108/45 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-26 01:04:29] [INFO ] Added : 18 causal constraints over 4 iterations in 32 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 16 out of 56 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 58/58 transitions.
Applied a total of 0 rules in 3 ms. Remains 56 /56 variables (removed 0) and now considering 58/58 (removed 0) transitions.
[2024-05-26 01:04:29] [INFO ] Flow matrix only has 49 transitions (discarded 9 similar events)
[2024-05-26 01:04:29] [INFO ] Invariant cache hit.
[2024-05-26 01:04:29] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-26 01:04:29] [INFO ] Flow matrix only has 49 transitions (discarded 9 similar events)
[2024-05-26 01:04:29] [INFO ] Invariant cache hit.
[2024-05-26 01:04:29] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 01:04:29] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2024-05-26 01:04:29] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-26 01:04:29] [INFO ] Flow matrix only has 49 transitions (discarded 9 similar events)
[2024-05-26 01:04:29] [INFO ] Invariant cache hit.
[2024-05-26 01:04:29] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 137 ms. Remains : 56/56 places, 58/58 transitions.
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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 84 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Finished random walk after 20 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 106 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
[2024-05-26 01:04:30] [INFO ] Flow matrix only has 49 transitions (discarded 9 similar events)
[2024-05-26 01:04:30] [INFO ] Invariant cache hit.
[2024-05-26 01:04:30] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-26 01:04:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 01:04:30] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-26 01:04:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 01:04:30] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-26 01:04:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 01:04:30] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-26 01:04:30] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 01:04:30] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-26 01:04:30] [INFO ] Computed and/alt/rep : 54/108/45 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-26 01:04:30] [INFO ] Added : 18 causal constraints over 4 iterations in 30 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 6638 reset in 217 ms.
Product exploration explored 100000 steps with 6639 reset in 226 ms.
Built C files in :
/tmp/ltsmin9032970096526743825
[2024-05-26 01:04:30] [INFO ] Computing symmetric may disable matrix : 58 transitions.
[2024-05-26 01:04:30] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 01:04:30] [INFO ] Computing symmetric may enable matrix : 58 transitions.
[2024-05-26 01:04:30] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 01:04:30] [INFO ] Computing Do-Not-Accords matrix : 58 transitions.
[2024-05-26 01:04:30] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 01:04:30] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9032970096526743825
Running compilation step : cd /tmp/ltsmin9032970096526743825;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 233 ms.
Running link step : cd /tmp/ltsmin9032970096526743825;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin9032970096526743825;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14205077851079020149.hoa' '--buchi-type=spotba'
LTSmin run took 12968 ms.
FORMULA NeoElection-COL-4-LTLFireability-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property NeoElection-COL-4-LTLFireability-03 finished in 16645 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X(F(p1))&&p0)))))'
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 82/82 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 76 transition count 78
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 76 transition count 78
Applied a total of 8 rules in 7 ms. Remains 76 /80 variables (removed 4) and now considering 78/82 (removed 4) transitions.
[2024-05-26 01:04:43] [INFO ] Flow matrix only has 69 transitions (discarded 9 similar events)
// Phase 1: matrix 69 rows 76 cols
[2024-05-26 01:04:44] [INFO ] Computed 7 invariants in 1 ms
[2024-05-26 01:04:44] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-26 01:04:44] [INFO ] Flow matrix only has 69 transitions (discarded 9 similar events)
[2024-05-26 01:04:44] [INFO ] Invariant cache hit.
[2024-05-26 01:04:44] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 01:04:44] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2024-05-26 01:04:44] [INFO ] Flow matrix only has 69 transitions (discarded 9 similar events)
[2024-05-26 01:04:44] [INFO ] Invariant cache hit.
[2024-05-26 01:04:44] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 76/80 places, 78/82 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 166 ms. Remains : 76/80 places, 78/82 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : NeoElection-COL-4-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(AND (LT s60 1) (LT s63 1) (LT s61 1) (LT s62 1)), p0:(AND (LT s60 1) (LT s63 1) (LT s61 1) (LT s62 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 132 ms.
Product exploration explored 100000 steps with 25000 reset in 111 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 p1 p0), (X (X p0)), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 19 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-4-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-4-LTLFireability-04 finished in 640 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 82/82 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 76 transition count 74
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 72 transition count 74
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 32 place count 60 transition count 62
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 56 transition count 58
Applied a total of 36 rules in 17 ms. Remains 56 /80 variables (removed 24) and now considering 58/82 (removed 24) transitions.
[2024-05-26 01:04:44] [INFO ] Flow matrix only has 49 transitions (discarded 9 similar events)
// Phase 1: matrix 49 rows 56 cols
[2024-05-26 01:04:44] [INFO ] Computed 7 invariants in 4 ms
[2024-05-26 01:04:44] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-26 01:04:44] [INFO ] Flow matrix only has 49 transitions (discarded 9 similar events)
[2024-05-26 01:04:44] [INFO ] Invariant cache hit.
[2024-05-26 01:04:44] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 01:04:44] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2024-05-26 01:04:44] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-26 01:04:44] [INFO ] Flow matrix only has 49 transitions (discarded 9 similar events)
[2024-05-26 01:04:44] [INFO ] Invariant cache hit.
[2024-05-26 01:04:44] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/80 places, 58/82 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 171 ms. Remains : 56/80 places, 58/82 transitions.
Stuttering acceptance computed with spot in 32 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 220 ms.
Product exploration explored 100000 steps with 1030 reset in 198 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 (Minato strategy)
Knowledge based reduction with 3 factoid took 11 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 675 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 26 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 82/82 transitions.
Reduce places removed 4 places and 4 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 72 transition count 74
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 72 transition count 74
Applied a total of 8 rules in 8 ms. Remains 72 /80 variables (removed 8) and now considering 74/82 (removed 8) transitions.
[2024-05-26 01:04:45] [INFO ] Flow matrix only has 65 transitions (discarded 9 similar events)
// Phase 1: matrix 65 rows 72 cols
[2024-05-26 01:04:45] [INFO ] Computed 7 invariants in 1 ms
[2024-05-26 01:04:45] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-26 01:04:45] [INFO ] Flow matrix only has 65 transitions (discarded 9 similar events)
[2024-05-26 01:04:45] [INFO ] Invariant cache hit.
[2024-05-26 01:04:45] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 01:04:45] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2024-05-26 01:04:45] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-26 01:04:45] [INFO ] Flow matrix only has 65 transitions (discarded 9 similar events)
[2024-05-26 01:04:45] [INFO ] Invariant cache hit.
[2024-05-26 01:04:45] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/80 places, 74/82 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 159 ms. Remains : 72/80 places, 74/82 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-COL-4-LTLFireability-06 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 (OR (AND (GEQ s2 1) (GEQ s20 1) (GEQ s49 1)) (AND (GEQ s0 1) (GEQ s6 1) (GEQ s48 1)) (AND (GEQ s5 1) (GEQ s34 1) (GEQ s50 1)) (AND (GEQ s4 1) (GEQ...], 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 164 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 204 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(X(p1))||p0))))'
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 82/82 transitions.
Applied a total of 0 rules in 2 ms. Remains 80 /80 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-26 01:04:45] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
// Phase 1: matrix 73 rows 80 cols
[2024-05-26 01:04:45] [INFO ] Computed 7 invariants in 1 ms
[2024-05-26 01:04:45] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-26 01:04:45] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
[2024-05-26 01:04:45] [INFO ] Invariant cache hit.
[2024-05-26 01:04:45] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 01:04:45] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2024-05-26 01:04:45] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
[2024-05-26 01:04:45] [INFO ] Invariant cache hit.
[2024-05-26 01:04:45] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 154 ms. Remains : 80/80 places, 82/82 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NeoElection-COL-4-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s67 1) (GEQ s71 1) (GEQ s75 1) (GEQ s79 1)), p1:(OR (GEQ s67 1) (GEQ s71 1) (GEQ s75 1) (GEQ s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 180 steps with 1 reset in 1 ms.
FORMULA NeoElection-COL-4-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-4-LTLFireability-09 finished in 272 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 22 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 82/82 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 76 transition count 74
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 72 transition count 74
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 68 transition count 70
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 68 transition count 70
Applied a total of 16 rules in 11 ms. Remains 68 /80 variables (removed 12) and now considering 70/82 (removed 12) transitions.
[2024-05-26 01:04:45] [INFO ] Flow matrix only has 61 transitions (discarded 9 similar events)
// Phase 1: matrix 61 rows 68 cols
[2024-05-26 01:04:45] [INFO ] Computed 7 invariants in 1 ms
[2024-05-26 01:04:45] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-26 01:04:45] [INFO ] Flow matrix only has 61 transitions (discarded 9 similar events)
[2024-05-26 01:04:45] [INFO ] Invariant cache hit.
[2024-05-26 01:04:45] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 01:04:45] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2024-05-26 01:04:45] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-26 01:04:45] [INFO ] Flow matrix only has 61 transitions (discarded 9 similar events)
[2024-05-26 01:04:45] [INFO ] Invariant cache hit.
[2024-05-26 01:04:45] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 68/80 places, 70/82 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 146 ms. Remains : 68/80 places, 70/82 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-COL-4-LTLFireability-11 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 s2 1) (GEQ s20 1) (GEQ s49 1)) (AND (GEQ s0 1) (GEQ s6 1) (GEQ s48 1)) (AND (GEQ s5 1) (GEQ s34 1) (GEQ s50 1)) (AND (GEQ s4 1) (GEQ s27 ...], 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 112 steps with 0 reset in 1 ms.
FORMULA NeoElection-COL-4-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-4-LTLFireability-11 finished in 188 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 22 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 82/82 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 76 transition count 78
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 76 transition count 78
Applied a total of 8 rules in 6 ms. Remains 76 /80 variables (removed 4) and now considering 78/82 (removed 4) transitions.
[2024-05-26 01:04:45] [INFO ] Flow matrix only has 69 transitions (discarded 9 similar events)
// Phase 1: matrix 69 rows 76 cols
[2024-05-26 01:04:45] [INFO ] Computed 7 invariants in 5 ms
[2024-05-26 01:04:46] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-26 01:04:46] [INFO ] Flow matrix only has 69 transitions (discarded 9 similar events)
[2024-05-26 01:04:46] [INFO ] Invariant cache hit.
[2024-05-26 01:04:46] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 01:04:46] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-05-26 01:04:46] [INFO ] Flow matrix only has 69 transitions (discarded 9 similar events)
[2024-05-26 01:04:46] [INFO ] Invariant cache hit.
[2024-05-26 01:04:46] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 76/80 places, 78/82 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 131 ms. Remains : 76/80 places, 78/82 transitions.
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-4-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s6 1) (GEQ s24 1) (GEQ s53 1)) (AND (GEQ s4 1) (GEQ s10 1) (GEQ s52 1)) (AND (GEQ s9 1) (GEQ s38 1) (GEQ s54 1)) (AND (GEQ s8 1) (GEQ s31...], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NeoElection-COL-4-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-4-LTLFireability-14 finished in 211 ms.
All properties solved by simple procedures.
Total runtime 21840 ms.

BK_STOP 1716685487653

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="gold2023"
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 gold2023"
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 r263-tall-171654372500288"
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 ;