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.r263-smll-167863537800140.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 lolaxred
Input is NeoElection-COL-5, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-smll-167863537800140
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.8K Feb 26 16:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 16:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 16:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 16:13 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.5K Feb 25 16:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 16:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 17:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Feb 26 17:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 26 16:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 26 16:53 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 89K 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-5-LTLFireability-00
FORMULA_NAME NeoElection-COL-5-LTLFireability-01
FORMULA_NAME NeoElection-COL-5-LTLFireability-02
FORMULA_NAME NeoElection-COL-5-LTLFireability-03
FORMULA_NAME NeoElection-COL-5-LTLFireability-04
FORMULA_NAME NeoElection-COL-5-LTLFireability-05
FORMULA_NAME NeoElection-COL-5-LTLFireability-06
FORMULA_NAME NeoElection-COL-5-LTLFireability-07
FORMULA_NAME NeoElection-COL-5-LTLFireability-08
FORMULA_NAME NeoElection-COL-5-LTLFireability-09
FORMULA_NAME NeoElection-COL-5-LTLFireability-10
FORMULA_NAME NeoElection-COL-5-LTLFireability-11
FORMULA_NAME NeoElection-COL-5-LTLFireability-12
FORMULA_NAME NeoElection-COL-5-LTLFireability-13
FORMULA_NAME NeoElection-COL-5-LTLFireability-14
FORMULA_NAME NeoElection-COL-5-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678724539273

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeoElection-COL-5
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-13 16:22:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 16:22:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 16:22:22] [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-13 16:22:23] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-13 16:22:23] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1001 ms
[2023-03-13 16:22:23] [INFO ] Detected 6 constant HL places corresponding to 1500 PT places.
[2023-03-13 16:22:23] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 3090 PT places and 7716.0 transition bindings in 50 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
[2023-03-13 16:22:24] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 9 ms.
[2023-03-13 16:22:24] [INFO ] Skeletonized 11 HLPN properties in 2 ms. Removed 5 properties that had guard overlaps.
Computed a total of 14 stabilizing places and 8 stable transitions
Graph (complete) has 56 edges and 18 vertex of which 15 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Remains 8 properties that can be checked using skeleton over-approximation.
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 12 places and 7 transitions.
Ensure Unique test removed 8 transitions
Reduce redundant transitions removed 8 transitions.
FORMULA NeoElection-COL-5-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 2 stable transitions
Finished random walk after 15 steps, including 0 resets, run visited all 3 properties in 11 ms. (steps per millisecond=1 )
[2023-03-13 16:22:24] [INFO ] Flatten gal took : 26 ms
[2023-03-13 16:22:24] [INFO ] Flatten gal took : 6 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(6), POS(5), M(6)] of place P_masterList breaks symmetries in sort M
Arc [15:1*[$m, (MOD (ADD $i 1) 5)]] 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-13 16:22:24] [INFO ] Unfolded HLPN to a Petri net with 3090 places and 4024 transitions 22762 arcs in 240 ms.
[2023-03-13 16:22:24] [INFO ] Unfolded 15 HLPN properties in 6 ms.
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 2866 places in 29 ms
Reduce places removed 2891 places and 3788 transitions.
Reduce places removed 6 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA NeoElection-COL-5-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA NeoElection-COL-5-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 108 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 236/236 transitions.
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 173 transition count 236
Applied a total of 20 rules in 29 ms. Remains 173 /193 variables (removed 20) and now considering 236/236 (removed 0) transitions.
[2023-03-13 16:22:24] [INFO ] Flow matrix only has 220 transitions (discarded 16 similar events)
// Phase 1: matrix 220 rows 173 cols
[2023-03-13 16:22:25] [INFO ] Computed 34 place invariants in 39 ms
[2023-03-13 16:22:25] [INFO ] Implicit Places using invariants in 426 ms returned []
[2023-03-13 16:22:25] [INFO ] Flow matrix only has 220 transitions (discarded 16 similar events)
[2023-03-13 16:22:25] [INFO ] Invariant cache hit.
[2023-03-13 16:22:25] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-13 16:22:25] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 936 ms to find 0 implicit places.
[2023-03-13 16:22:25] [INFO ] Flow matrix only has 220 transitions (discarded 16 similar events)
[2023-03-13 16:22:25] [INFO ] Invariant cache hit.
[2023-03-13 16:22:26] [INFO ] Dead Transitions using invariants and state equation in 372 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 173/193 places, 236/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1345 ms. Remains : 173/193 places, 236/236 transitions.
Support contains 108 out of 173 places after structural reductions.
[2023-03-13 16:22:26] [INFO ] Flatten gal took : 86 ms
[2023-03-13 16:22:26] [INFO ] Flatten gal took : 86 ms
[2023-03-13 16:22:26] [INFO ] Input system was already deterministic with 236 transitions.
Support contains 103 out of 173 places (down from 108) after GAL structural reductions.
Finished random walk after 120 steps, including 0 resets, run visited all 6 properties in 29 ms. (steps per millisecond=4 )
Computed a total of 173 stabilizing places and 236 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 173 transition count 236
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(F(p0)))'
Support contains 40 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 236/236 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 141 transition count 123
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 141 transition count 123
Applied a total of 64 rules in 11 ms. Remains 141 /173 variables (removed 32) and now considering 123/236 (removed 113) transitions.
[2023-03-13 16:22:27] [INFO ] Flow matrix only has 107 transitions (discarded 16 similar events)
// Phase 1: matrix 107 rows 141 cols
[2023-03-13 16:22:27] [INFO ] Computed 34 place invariants in 9 ms
[2023-03-13 16:22:27] [INFO ] Implicit Places using invariants in 133 ms returned [14, 19, 24, 29, 34]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 143 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 136/173 places, 123/236 transitions.
Applied a total of 0 rules in 4 ms. Remains 136 /136 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 159 ms. Remains : 136/173 places, 123/236 transitions.
Stuttering acceptance computed with spot in 347 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-5-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s31 1) (GEQ s134 1)) (AND (GEQ s24 1) (GEQ s127 1)) (AND (GEQ s28 1) (GEQ s131 1)) (AND (GEQ s17 1) (GEQ s120 1)) (AND (GEQ s27 1) (GEQ s...], 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 714 ms.
Product exploration explored 100000 steps with 50000 reset in 480 ms.
Computed a total of 136 stabilizing places and 123 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 136 transition count 123
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 p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 104 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-5-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-5-LTLFireability-00 finished in 2017 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))||G(!p0)))'
Support contains 38 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 236/236 transitions.
Reduce places removed 5 places and 5 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 163 transition count 231
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 5 place count 163 transition count 226
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 15 place count 158 transition count 226
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 29 place count 144 transition count 194
Iterating global reduction 1 with 14 rules applied. Total rules applied 43 place count 144 transition count 194
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 43 place count 144 transition count 193
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 143 transition count 193
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 142 transition count 192
Ensure Unique test removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 47 place count 141 transition count 192
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 140 transition count 191
Ensure Unique test removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 139 transition count 191
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 50 place count 138 transition count 190
Ensure Unique test removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 51 place count 137 transition count 190
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 52 place count 136 transition count 189
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 395 edges and 135 vertex of which 133 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 4 with 2 rules applied. Total rules applied 54 place count 133 transition count 188
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 54 place count 133 transition count 180
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 70 place count 125 transition count 180
Applied a total of 70 rules in 163 ms. Remains 125 /173 variables (removed 48) and now considering 180/236 (removed 56) transitions.
[2023-03-13 16:22:29] [INFO ] Flow matrix only has 164 transitions (discarded 16 similar events)
// Phase 1: matrix 164 rows 125 cols
[2023-03-13 16:22:29] [INFO ] Computed 24 place invariants in 5 ms
[2023-03-13 16:22:29] [INFO ] Implicit Places using invariants in 155 ms returned [9, 11, 13, 16, 18, 20, 23, 25, 27, 30, 32, 34]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 158 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 113/173 places, 180/236 transitions.
Applied a total of 0 rules in 12 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 335 ms. Remains : 113/173 places, 180/236 transitions.
Stuttering acceptance computed with spot in 180 ms :[false, (NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-5-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s3 1) (LT s12 1) (LT s51 1) (LT s90 1)) (OR (LT s5 1) (LT s16 1) (LT s64 1) (LT s91 1)) (OR (LT s5 1) (LT s19 1) (LT s62 1) (LT s91 1)) (O...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2479 reset in 1545 ms.
Product exploration explored 100000 steps with 2440 reset in 1365 ms.
Computed a total of 113 stabilizing places and 180 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 113 transition count 180
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 p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 5 factoid took 262 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-5-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-5-LTLFireability-03 finished in 3876 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 30 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 236/236 transitions.
Reduce places removed 5 places and 5 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 163 transition count 231
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 5 place count 163 transition count 226
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 15 place count 158 transition count 226
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 29 place count 144 transition count 167
Iterating global reduction 1 with 14 rules applied. Total rules applied 43 place count 144 transition count 167
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 43 place count 144 transition count 166
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 143 transition count 166
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 142 transition count 165
Ensure Unique test removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 47 place count 141 transition count 165
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 140 transition count 164
Ensure Unique test removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 139 transition count 164
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 50 place count 138 transition count 163
Ensure Unique test removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 51 place count 137 transition count 163
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 52 place count 136 transition count 162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 53 place count 135 transition count 162
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 53 place count 135 transition count 158
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 61 place count 131 transition count 158
Applied a total of 61 rules in 112 ms. Remains 131 /173 variables (removed 42) and now considering 158/236 (removed 78) transitions.
[2023-03-13 16:22:32] [INFO ] Flow matrix only has 142 transitions (discarded 16 similar events)
// Phase 1: matrix 142 rows 131 cols
[2023-03-13 16:22:32] [INFO ] Computed 25 place invariants in 4 ms
[2023-03-13 16:22:33] [INFO ] Implicit Places using invariants in 164 ms returned [8, 10, 12, 14, 17, 19, 21, 24, 26, 28, 31, 33, 35]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 170 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 118/173 places, 158/236 transitions.
Applied a total of 0 rules in 9 ms. Remains 118 /118 variables (removed 0) and now considering 158/158 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 293 ms. Remains : 118/173 places, 158/236 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-5-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s18 1) (GEQ s74 1) (GEQ s96 1)) (AND (GEQ s23 1) (GEQ s85 1) (GEQ s97 1)) (AND (GEQ s20 1) (GEQ s89 1) (GEQ s97 1)) (AND (GEQ s22 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2765 reset in 948 ms.
Product exploration explored 100000 steps with 2778 reset in 664 ms.
Computed a total of 118 stabilizing places and 158 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 118 transition count 158
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 224 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Finished random walk after 47 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=11 )
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 255 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
[2023-03-13 16:22:35] [INFO ] Flow matrix only has 142 transitions (discarded 16 similar events)
// Phase 1: matrix 142 rows 118 cols
[2023-03-13 16:22:35] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-13 16:22:36] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-13 16:22:36] [INFO ] [Real]Absence check using 8 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-13 16:22:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:22:36] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2023-03-13 16:22:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:22:37] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-13 16:22:37] [INFO ] [Nat]Absence check using 8 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-13 16:22:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:22:37] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2023-03-13 16:22:37] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-13 16:22:37] [INFO ] [Nat]Added 13 Read/Feed constraints in 6 ms returned sat
[2023-03-13 16:22:37] [INFO ] Computed and/alt/rep : 150/462/134 causal constraints (skipped 4 transitions) in 27 ms.
[2023-03-13 16:22:37] [INFO ] Added : 77 causal constraints over 16 iterations in 490 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 30 out of 118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 118/118 places, 158/158 transitions.
Applied a total of 0 rules in 9 ms. Remains 118 /118 variables (removed 0) and now considering 158/158 (removed 0) transitions.
[2023-03-13 16:22:37] [INFO ] Flow matrix only has 142 transitions (discarded 16 similar events)
[2023-03-13 16:22:37] [INFO ] Invariant cache hit.
[2023-03-13 16:22:37] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-13 16:22:37] [INFO ] Flow matrix only has 142 transitions (discarded 16 similar events)
[2023-03-13 16:22:37] [INFO ] Invariant cache hit.
[2023-03-13 16:22:37] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-13 16:22:38] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
[2023-03-13 16:22:38] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-13 16:22:38] [INFO ] Flow matrix only has 142 transitions (discarded 16 similar events)
[2023-03-13 16:22:38] [INFO ] Invariant cache hit.
[2023-03-13 16:22:38] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 575 ms. Remains : 118/118 places, 158/158 transitions.
Computed a total of 118 stabilizing places and 158 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 118 transition count 158
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 219 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Finished random walk after 25 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=8 )
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 269 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
[2023-03-13 16:22:39] [INFO ] Flow matrix only has 142 transitions (discarded 16 similar events)
[2023-03-13 16:22:39] [INFO ] Invariant cache hit.
[2023-03-13 16:22:39] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2023-03-13 16:22:39] [INFO ] [Real]Absence check using 8 positive and 4 generalized place invariants in 13 ms returned sat
[2023-03-13 16:22:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:22:39] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2023-03-13 16:22:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:22:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-13 16:22:40] [INFO ] [Nat]Absence check using 8 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-13 16:22:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:22:40] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2023-03-13 16:22:40] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-13 16:22:40] [INFO ] [Nat]Added 13 Read/Feed constraints in 12 ms returned sat
[2023-03-13 16:22:40] [INFO ] Computed and/alt/rep : 150/462/134 causal constraints (skipped 4 transitions) in 24 ms.
[2023-03-13 16:22:40] [INFO ] Added : 75 causal constraints over 15 iterations in 384 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2784 reset in 1089 ms.
Product exploration explored 100000 steps with 2779 reset in 664 ms.
Support contains 30 out of 118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 118/118 places, 158/158 transitions.
Applied a total of 0 rules in 10 ms. Remains 118 /118 variables (removed 0) and now considering 158/158 (removed 0) transitions.
[2023-03-13 16:22:42] [INFO ] Flow matrix only has 142 transitions (discarded 16 similar events)
[2023-03-13 16:22:42] [INFO ] Invariant cache hit.
[2023-03-13 16:22:42] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-13 16:22:42] [INFO ] Flow matrix only has 142 transitions (discarded 16 similar events)
[2023-03-13 16:22:42] [INFO ] Invariant cache hit.
[2023-03-13 16:22:42] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-13 16:22:43] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
[2023-03-13 16:22:43] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-13 16:22:43] [INFO ] Flow matrix only has 142 transitions (discarded 16 similar events)
[2023-03-13 16:22:43] [INFO ] Invariant cache hit.
[2023-03-13 16:22:43] [INFO ] Dead Transitions using invariants and state equation in 213 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 603 ms. Remains : 118/118 places, 158/158 transitions.
Treatment of property NeoElection-COL-5-LTLFireability-04 finished in 10598 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(G((p0&&F(p1)))))'
Support contains 35 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 236/236 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 159 transition count 177
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 159 transition count 177
Applied a total of 28 rules in 7 ms. Remains 159 /173 variables (removed 14) and now considering 177/236 (removed 59) transitions.
[2023-03-13 16:22:43] [INFO ] Flow matrix only has 161 transitions (discarded 16 similar events)
// Phase 1: matrix 161 rows 159 cols
[2023-03-13 16:22:43] [INFO ] Computed 34 place invariants in 13 ms
[2023-03-13 16:22:43] [INFO ] Implicit Places using invariants in 193 ms returned [13, 14, 15, 16, 17, 18, 20, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 195 ms to find 21 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 138/173 places, 177/236 transitions.
Applied a total of 0 rules in 2 ms. Remains 138 /138 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 204 ms. Remains : 138/173 places, 177/236 transitions.
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : NeoElection-COL-5-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GEQ s113 1) (GEQ s114 1) (GEQ s115 1) (GEQ s116 1) (GEQ s117 1)), p1:(OR (AND (GEQ s23 1) (GEQ s82 1) (GEQ s106 1)) (AND (GEQ s28 1) (GEQ s94 1) (...], 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NeoElection-COL-5-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-5-LTLFireability-06 finished in 561 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 5 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 236/236 transitions.
Reduce places removed 5 places and 5 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 163 transition count 231
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 5 place count 163 transition count 226
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 15 place count 158 transition count 226
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 42 place count 131 transition count 118
Iterating global reduction 1 with 27 rules applied. Total rules applied 69 place count 131 transition count 118
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 79 place count 126 transition count 113
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 1 with 5 rules applied. Total rules applied 84 place count 121 transition count 108
Ensure Unique test removed 5 places
Iterating post reduction 1 with 5 rules applied. Total rules applied 89 place count 116 transition count 108
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 94 place count 111 transition count 103
Ensure Unique test removed 5 places
Iterating post reduction 2 with 5 rules applied. Total rules applied 99 place count 106 transition count 103
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 104 place count 101 transition count 98
Ensure Unique test removed 5 places
Iterating post reduction 3 with 5 rules applied. Total rules applied 109 place count 96 transition count 98
Applied a total of 109 rules in 38 ms. Remains 96 /173 variables (removed 77) and now considering 98/236 (removed 138) transitions.
[2023-03-13 16:22:44] [INFO ] Flow matrix only has 82 transitions (discarded 16 similar events)
// Phase 1: matrix 82 rows 96 cols
[2023-03-13 16:22:44] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-13 16:22:44] [INFO ] Implicit Places using invariants in 126 ms returned [8, 9, 10, 11, 12]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 128 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/173 places, 98/236 transitions.
Applied a total of 0 rules in 4 ms. Remains 91 /91 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 171 ms. Remains : 91/173 places, 98/236 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-COL-5-LTLFireability-10 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 (GEQ s82 1) (GEQ s88 1) (GEQ s86 1) (GEQ s90 1) (GEQ s84 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 90 steps with 0 reset in 1 ms.
FORMULA NeoElection-COL-5-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-5-LTLFireability-10 finished in 229 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(p0))'
Support contains 5 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 236/236 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 141 transition count 123
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 141 transition count 123
Applied a total of 64 rules in 4 ms. Remains 141 /173 variables (removed 32) and now considering 123/236 (removed 113) transitions.
[2023-03-13 16:22:44] [INFO ] Flow matrix only has 107 transitions (discarded 16 similar events)
// Phase 1: matrix 107 rows 141 cols
[2023-03-13 16:22:44] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-13 16:22:44] [INFO ] Implicit Places using invariants in 125 ms returned [13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 126 ms to find 25 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 116/173 places, 123/236 transitions.
Applied a total of 0 rules in 2 ms. Remains 116 /116 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 132 ms. Remains : 116/173 places, 123/236 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : NeoElection-COL-5-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GEQ s91 1) (GEQ s92 1) (GEQ s93 1) (GEQ s94 1) (GEQ s95 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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-5-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-5-LTLFireability-12 finished in 239 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(F((G(F(!p1))||p0))))'
Support contains 40 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 236/236 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 141 transition count 123
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 141 transition count 123
Applied a total of 64 rules in 2 ms. Remains 141 /173 variables (removed 32) and now considering 123/236 (removed 113) transitions.
[2023-03-13 16:22:44] [INFO ] Flow matrix only has 107 transitions (discarded 16 similar events)
[2023-03-13 16:22:44] [INFO ] Invariant cache hit.
[2023-03-13 16:22:44] [INFO ] Implicit Places using invariants in 150 ms returned [14, 19, 24, 29, 34]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 152 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 136/173 places, 123/236 transitions.
Applied a total of 0 rules in 1 ms. Remains 136 /136 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 158 ms. Remains : 136/173 places, 123/236 transitions.
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : NeoElection-COL-5-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s31 1) (GEQ s134 1)) (AND (GEQ s24 1) (GEQ s127 1)) (AND (GEQ s28 1) (GEQ s131 1)) (AND (GEQ s17 1) (GEQ s120 1)) (AND (GEQ s27 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 550 ms.
Product exploration explored 100000 steps with 50000 reset in 412 ms.
Computed a total of 136 stabilizing places and 123 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 136 transition count 123
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) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (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 166 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-5-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-5-LTLFireability-15 finished in 1555 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)))'
[2023-03-13 16:22:46] [INFO ] Flatten gal took : 44 ms
[2023-03-13 16:22:46] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2023-03-13 16:22:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 173 places, 236 transitions and 1148 arcs took 4 ms.
Total runtime 23698 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT NeoElection-COL-5
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/368
LTLFireability

BK_STOP 1678724603221

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/368/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/368/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/368/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 NeoElection-COL-5-LTLFireability-04
lola: time limit : 3599 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeoElection-COL-5-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3599 5/32 NeoElection-COL-5-LTLFireability-04 712055 m, 142411 m/sec, 1258770 t fired, .

Time elapsed: 6 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeoElection-COL-5-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3599 10/32 NeoElection-COL-5-LTLFireability-04 1423897 m, 142368 m/sec, 2614347 t fired, .

Time elapsed: 11 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeoElection-COL-5-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3599 15/32 NeoElection-COL-5-LTLFireability-04 2093671 m, 133954 m/sec, 3981461 t fired, .

Time elapsed: 16 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeoElection-COL-5-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3599 20/32 NeoElection-COL-5-LTLFireability-04 2825640 m, 146393 m/sec, 5379575 t fired, .

Time elapsed: 21 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeoElection-COL-5-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3599 24/32 NeoElection-COL-5-LTLFireability-04 3495154 m, 133902 m/sec, 6734332 t fired, .

Time elapsed: 26 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeoElection-COL-5-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3599 29/32 NeoElection-COL-5-LTLFireability-04 4225505 m, 146070 m/sec, 8179043 t fired, .

Time elapsed: 31 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 1 (type EXCL) for NeoElection-COL-5-LTLFireability-04 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeoElection-COL-5-LTLFireability-04: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 36 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: Portfolio finished: no open tasks 1

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
NeoElection-COL-5-LTLFireability-04: LTL unknown AGGR


Time elapsed: 36 secs. Pages in use: 32

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-5"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is NeoElection-COL-5, 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-smll-167863537800140"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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