Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 11K Feb 26 16:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 26 16:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 16:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 26 16:27 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.1K Feb 25 16:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 17:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 17:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 26 17:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Feb 26 17:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:28 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 98K 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-6-LTLFireability-00
FORMULA_NAME NeoElection-COL-6-LTLFireability-01
FORMULA_NAME NeoElection-COL-6-LTLFireability-02
FORMULA_NAME NeoElection-COL-6-LTLFireability-03
FORMULA_NAME NeoElection-COL-6-LTLFireability-04
FORMULA_NAME NeoElection-COL-6-LTLFireability-05
FORMULA_NAME NeoElection-COL-6-LTLFireability-06
FORMULA_NAME NeoElection-COL-6-LTLFireability-07
FORMULA_NAME NeoElection-COL-6-LTLFireability-08
FORMULA_NAME NeoElection-COL-6-LTLFireability-09
FORMULA_NAME NeoElection-COL-6-LTLFireability-10
FORMULA_NAME NeoElection-COL-6-LTLFireability-11
FORMULA_NAME NeoElection-COL-6-LTLFireability-12
FORMULA_NAME NeoElection-COL-6-LTLFireability-13
FORMULA_NAME NeoElection-COL-6-LTLFireability-14
FORMULA_NAME NeoElection-COL-6-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678790674966

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeoElection-COL-6
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-14 10:44:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 10:44:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 10:44:37] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-14 10:44:37] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-14 10:44:38] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 833 ms
[2023-03-14 10:44:38] [INFO ] Detected 6 constant HL places corresponding to 2380 PT places.
[2023-03-14 10:44:38] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 4830 PT places and 13580.0 transition bindings in 36 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2023-03-14 10:44:38] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 7 ms.
[2023-03-14 10:44:38] [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.3 ms
Remains 10 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-6-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 2 stable transitions
Finished random walk after 2764 steps, including 71 resets, run visited all 5 properties in 48 ms. (steps per millisecond=57 )
[2023-03-14 10:44:38] [INFO ] Flatten gal took : 19 ms
[2023-03-14 10:44:38] [INFO ] Flatten gal took : 3 ms
Domain [M(7), POS(6), M(7)] of place P_masterList breaks symmetries in sort M
Arc [15:1*[$m, (MOD (ADD $i 1) 6)]] contains successor/predecessor on variables of sort POS
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.
Symmetric sort wr.t. initial and guards and successors and join/free detected :STAGE
Arc [16:1*[$m, 0]] contains constants of sort STAGE
Transition T_poll__iAmPrimary : constants on arcs in [[16:1*[$m, 0]]] introduces in STAGE(3) partition with 1 elements that refines current partition to 2 subsets.
Arc [16:1*[$m, 1]] contains constants of sort STAGE
Transition T_poll__iAmPrimary : constants on arcs in [[16:1*[$m, 1]]] introduces in STAGE(3) partition with 1 elements that refines current partition to 3 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :NEGSTEP
Arc [8:1*[$m, $r, 1]] contains constants of sort NEGSTEP
Transition T_poll__handleAI1 : constants on arcs in [[8:1*[$m, $r, 1]]] introduces in NEGSTEP(3) partition with 1 elements that refines current partition to 2 subsets.
Arc [8:1*[$m, $r, 2]] contains constants of sort NEGSTEP
Transition T_poll__handleAI1 : constants on arcs in [[8:1*[$m, $r, 2]]] introduces in NEGSTEP(3) partition with 1 elements that refines current partition to 3 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :BOOL
Arc [7:1*[$m, 0, $pm]] contains constants of sort BOOL
Transition T_poll__handleAI2 : constants on arcs in [[7:1*[$m, 0, $pm]]] introduces in BOOL(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-14 10:44:39] [INFO ] Unfolded HLPN to a Petri net with 4830 places and 7361 transitions 41792 arcs in 217 ms.
[2023-03-14 10:44:39] [INFO ] Unfolded 15 HLPN properties in 20 ms.
Deduced a syphon composed of 4507 places in 23 ms
Reduce places removed 4543 places and 6967 transitions.
Reduce places removed 7 places and 0 transitions.
FORMULA NeoElection-COL-6-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 232 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 394/394 transitions.
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 250 transition count 394
Applied a total of 30 rules in 17 ms. Remains 250 /280 variables (removed 30) and now considering 394/394 (removed 0) transitions.
[2023-03-14 10:44:39] [INFO ] Flow matrix only has 369 transitions (discarded 25 similar events)
// Phase 1: matrix 369 rows 250 cols
[2023-03-14 10:44:39] [INFO ] Computed 47 place invariants in 60 ms
[2023-03-14 10:44:39] [INFO ] Implicit Places using invariants in 310 ms returned []
[2023-03-14 10:44:39] [INFO ] Flow matrix only has 369 transitions (discarded 25 similar events)
[2023-03-14 10:44:39] [INFO ] Invariant cache hit.
[2023-03-14 10:44:40] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-14 10:44:40] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 695 ms to find 0 implicit places.
[2023-03-14 10:44:40] [INFO ] Flow matrix only has 369 transitions (discarded 25 similar events)
[2023-03-14 10:44:40] [INFO ] Invariant cache hit.
[2023-03-14 10:44:40] [INFO ] Dead Transitions using invariants and state equation in 372 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 250/280 places, 394/394 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1101 ms. Remains : 250/280 places, 394/394 transitions.
Support contains 232 out of 250 places after structural reductions.
[2023-03-14 10:44:40] [INFO ] Flatten gal took : 87 ms
[2023-03-14 10:44:40] [INFO ] Flatten gal took : 93 ms
[2023-03-14 10:44:41] [INFO ] Input system was already deterministic with 394 transitions.
Finished random walk after 96 steps, including 0 resets, run visited all 7 properties in 20 ms. (steps per millisecond=4 )
FORMULA NeoElection-COL-6-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 250 stabilizing places and 394 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 250 transition count 394
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(X(G(p0))))'
Support contains 6 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 394/394 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 206 transition count 184
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 206 transition count 184
Applied a total of 88 rules in 35 ms. Remains 206 /250 variables (removed 44) and now considering 184/394 (removed 210) transitions.
[2023-03-14 10:44:41] [INFO ] Flow matrix only has 159 transitions (discarded 25 similar events)
// Phase 1: matrix 159 rows 206 cols
[2023-03-14 10:44:41] [INFO ] Computed 47 place invariants in 4 ms
[2023-03-14 10:44:41] [INFO ] Implicit Places using invariants in 227 ms returned [16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51]
Discarding 36 places :
Implicit Place search using SMT only with invariants took 233 ms to find 36 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/250 places, 184/394 transitions.
Applied a total of 0 rules in 5 ms. Remains 170 /170 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 273 ms. Remains : 170/250 places, 184/394 transitions.
Stuttering acceptance computed with spot in 280 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-6-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (LT s126 1) (LT s125 1) (LT s127 1) (LT s122 1) (LT s124 1) (LT s123 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 26 steps with 0 reset in 2 ms.
FORMULA NeoElection-COL-6-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-6-LTLFireability-00 finished in 623 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((p0||X(p0))))'
Support contains 55 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 394/394 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 230 transition count 334
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 230 transition count 334
Applied a total of 40 rules in 13 ms. Remains 230 /250 variables (removed 20) and now considering 334/394 (removed 60) transitions.
[2023-03-14 10:44:42] [INFO ] Flow matrix only has 309 transitions (discarded 25 similar events)
// Phase 1: matrix 309 rows 230 cols
[2023-03-14 10:44:42] [INFO ] Computed 47 place invariants in 17 ms
[2023-03-14 10:44:42] [INFO ] Implicit Places using invariants in 202 ms returned [16, 18, 20, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 67, 68, 69, 70, 71]
Discarding 31 places :
Implicit Place search using SMT only with invariants took 204 ms to find 31 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 199/250 places, 334/394 transitions.
Applied a total of 0 rules in 4 ms. Remains 199 /199 variables (removed 0) and now considering 334/334 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 221 ms. Remains : 199/250 places, 334/394 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-6-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}]], initial=1, aps=[p0:(AND (OR (LT s12 1) (LT s35 1) (LT s113 1) (LT s154 1)) (OR (LT s8 1) (LT s24 1) (LT s68 1) (LT s152 1)) (OR (LT s11 1) (LT s28 1) (LT s99 1) (LT s153 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 195 steps with 0 reset in 14 ms.
FORMULA NeoElection-COL-6-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-6-LTLFireability-02 finished in 345 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((p0&&F(G(p0)))))'
Support contains 45 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 394/394 transitions.
Reduce places removed 6 places and 6 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 238 transition count 388
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 6 place count 238 transition count 382
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 18 place count 232 transition count 382
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 38 place count 212 transition count 268
Iterating global reduction 1 with 20 rules applied. Total rules applied 58 place count 212 transition count 268
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 58 place count 212 transition count 267
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 211 transition count 267
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 210 transition count 266
Ensure Unique test removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 62 place count 209 transition count 266
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 208 transition count 265
Ensure Unique test removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 207 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 65 place count 206 transition count 264
Ensure Unique test removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 66 place count 205 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 67 place count 204 transition count 263
Ensure Unique test removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 68 place count 203 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 69 place count 202 transition count 262
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 70 place count 201 transition count 262
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 70 place count 201 transition count 257
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 80 place count 196 transition count 257
Applied a total of 80 rules in 130 ms. Remains 196 /250 variables (removed 54) and now considering 257/394 (removed 137) transitions.
[2023-03-14 10:44:42] [INFO ] Flow matrix only has 232 transitions (discarded 25 similar events)
// Phase 1: matrix 232 rows 196 cols
[2023-03-14 10:44:42] [INFO ] Computed 36 place invariants in 5 ms
[2023-03-14 10:44:42] [INFO ] Implicit Places using invariants in 171 ms returned [10, 12, 14, 16, 18, 21, 23, 25, 27, 30, 32, 34, 36, 39, 41, 43, 45, 48, 50, 52, 54]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 174 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 175/250 places, 257/394 transitions.
Applied a total of 0 rules in 12 ms. Remains 175 /175 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 316 ms. Remains : 175/250 places, 257/394 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-COL-6-LTLFireability-03 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 s33 1) (GEQ s127 1) (GEQ s144 1)) (AND (GEQ s32 1) (GEQ s123 1) (GEQ s144 1)) (AND (GEQ s23 1) (GEQ s86 1) (GEQ s142 1)) (AND (GEQ s34 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 245 steps with 0 reset in 8 ms.
FORMULA NeoElection-COL-6-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-6-LTLFireability-03 finished in 382 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 U X(p0))))'
Support contains 36 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 394/394 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 200 transition count 178
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 200 transition count 178
Applied a total of 100 rules in 8 ms. Remains 200 /250 variables (removed 50) and now considering 178/394 (removed 216) transitions.
[2023-03-14 10:44:42] [INFO ] Flow matrix only has 153 transitions (discarded 25 similar events)
// Phase 1: matrix 153 rows 200 cols
[2023-03-14 10:44:42] [INFO ] Computed 47 place invariants in 4 ms
[2023-03-14 10:44:42] [INFO ] Implicit Places using invariants in 172 ms returned [16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51]
Discarding 36 places :
Implicit Place search using SMT only with invariants took 179 ms to find 36 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 164/250 places, 178/394 transitions.
Applied a total of 0 rules in 2 ms. Remains 164 /164 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 192 ms. Remains : 164/250 places, 178/394 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : NeoElection-COL-6-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p0:(OR (AND (GEQ s37 1) (GEQ s117 1)) (AND (GEQ s94 1) (GEQ s120 1)) (AND (GEQ s81 1) (GEQ s119 1)) (AND (GEQ s105 1) (GEQ s121 1)) (AND (GEQ s27 1) (GEQ ...], 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA NeoElection-COL-6-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-6-LTLFireability-04 finished in 381 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 55 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 394/394 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 230 transition count 334
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 230 transition count 334
Applied a total of 40 rules in 11 ms. Remains 230 /250 variables (removed 20) and now considering 334/394 (removed 60) transitions.
[2023-03-14 10:44:43] [INFO ] Flow matrix only has 309 transitions (discarded 25 similar events)
// Phase 1: matrix 309 rows 230 cols
[2023-03-14 10:44:43] [INFO ] Computed 47 place invariants in 4 ms
[2023-03-14 10:44:43] [INFO ] Implicit Places using invariants in 177 ms returned [16, 18, 20, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 67, 68, 69, 70, 71]
Discarding 31 places :
Implicit Place search using SMT only with invariants took 179 ms to find 31 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 199/250 places, 334/394 transitions.
Applied a total of 0 rules in 2 ms. Remains 199 /199 variables (removed 0) and now considering 334/334 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 193 ms. Remains : 199/250 places, 334/394 transitions.
Stuttering acceptance computed with spot in 90 ms :[p0, p0, true]
Running random walk in product with property : NeoElection-COL-6-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=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:(AND (OR (LT s12 1) (LT s35 1) (LT s113 1) (LT s154 1)) (OR (LT s8 1) (LT s24 1) (LT s68 1) (LT s152 1)) (OR (LT s11 1) (LT s28 1) (LT s99 1) (LT s153 ...], 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-6-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-6-LTLFireability-06 finished in 302 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 36 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 394/394 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 200 transition count 178
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 200 transition count 178
Applied a total of 100 rules in 7 ms. Remains 200 /250 variables (removed 50) and now considering 178/394 (removed 216) transitions.
[2023-03-14 10:44:43] [INFO ] Flow matrix only has 153 transitions (discarded 25 similar events)
// Phase 1: matrix 153 rows 200 cols
[2023-03-14 10:44:43] [INFO ] Computed 47 place invariants in 2 ms
[2023-03-14 10:44:43] [INFO ] Implicit Places using invariants in 201 ms returned [16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51]
Discarding 36 places :
Implicit Place search using SMT only with invariants took 203 ms to find 36 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 164/250 places, 178/394 transitions.
Applied a total of 0 rules in 2 ms. Remains 164 /164 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 212 ms. Remains : 164/250 places, 178/394 transitions.
Stuttering acceptance computed with spot in 248 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-6-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (AND (GEQ s37 1) (GEQ s117 1)) (AND (GEQ s94 1) (GEQ s120 1)) (AND (GEQ s81 1) (GEQ s119 1)) (AND (GEQ s105 1) (GEQ s121 1)) (AND (GEQ s27 1) (GEQ ...], 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][false, false, false]]
Product exploration explored 100000 steps with 2280 reset in 563 ms.
Product exploration explored 100000 steps with 2288 reset in 478 ms.
Computed a total of 164 stabilizing places and 178 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 164 transition count 178
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 (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 37 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=18 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 161 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-14 10:44:45] [INFO ] Flow matrix only has 153 transitions (discarded 25 similar events)
// Phase 1: matrix 153 rows 164 cols
[2023-03-14 10:44:45] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-14 10:44:45] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-14 10:44:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:44:46] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2023-03-14 10:44:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:44:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-03-14 10:44:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:44:46] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2023-03-14 10:44:46] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-14 10:44:46] [INFO ] [Nat]Added 5 Read/Feed constraints in 3 ms returned sat
[2023-03-14 10:44:46] [INFO ] Computed and/alt/rep : 166/356/141 causal constraints (skipped 6 transitions) in 16 ms.
[2023-03-14 10:44:46] [INFO ] Added : 78 causal constraints over 16 iterations in 347 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 36 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 178/178 transitions.
Applied a total of 0 rules in 2 ms. Remains 164 /164 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2023-03-14 10:44:46] [INFO ] Flow matrix only has 153 transitions (discarded 25 similar events)
[2023-03-14 10:44:46] [INFO ] Invariant cache hit.
[2023-03-14 10:44:46] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-14 10:44:46] [INFO ] Flow matrix only has 153 transitions (discarded 25 similar events)
[2023-03-14 10:44:46] [INFO ] Invariant cache hit.
[2023-03-14 10:44:47] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-14 10:44:47] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
[2023-03-14 10:44:47] [INFO ] Flow matrix only has 153 transitions (discarded 25 similar events)
[2023-03-14 10:44:47] [INFO ] Invariant cache hit.
[2023-03-14 10:44:47] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 446 ms. Remains : 164/164 places, 178/178 transitions.
Computed a total of 164 stabilizing places and 178 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 164 transition count 178
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 (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 53 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=26 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 175 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-14 10:44:48] [INFO ] Flow matrix only has 153 transitions (discarded 25 similar events)
[2023-03-14 10:44:48] [INFO ] Invariant cache hit.
[2023-03-14 10:44:48] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-03-14 10:44:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:44:48] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2023-03-14 10:44:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:44:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-03-14 10:44:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:44:48] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2023-03-14 10:44:48] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-14 10:44:48] [INFO ] [Nat]Added 5 Read/Feed constraints in 5 ms returned sat
[2023-03-14 10:44:48] [INFO ] Computed and/alt/rep : 166/356/141 causal constraints (skipped 6 transitions) in 14 ms.
[2023-03-14 10:44:49] [INFO ] Added : 95 causal constraints over 19 iterations in 349 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2284 reset in 357 ms.
Product exploration explored 100000 steps with 2274 reset in 385 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 36 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 178/178 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 164 transition count 178
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 6 place count 164 transition count 178
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 12 place count 164 transition count 178
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 36 place count 164 transition count 178
Deduced a syphon composed of 36 places in 0 ms
Applied a total of 36 rules in 33 ms. Remains 164 /164 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2023-03-14 10:44:50] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-14 10:44:50] [INFO ] Flow matrix only has 153 transitions (discarded 25 similar events)
// Phase 1: matrix 153 rows 164 cols
[2023-03-14 10:44:50] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-14 10:44:50] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 164/164 places, 178/178 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 200 ms. Remains : 164/164 places, 178/178 transitions.
Support contains 36 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 178/178 transitions.
Applied a total of 0 rules in 2 ms. Remains 164 /164 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2023-03-14 10:44:50] [INFO ] Flow matrix only has 153 transitions (discarded 25 similar events)
// Phase 1: matrix 153 rows 164 cols
[2023-03-14 10:44:50] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-14 10:44:50] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-14 10:44:50] [INFO ] Flow matrix only has 153 transitions (discarded 25 similar events)
[2023-03-14 10:44:50] [INFO ] Invariant cache hit.
[2023-03-14 10:44:50] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-14 10:44:50] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2023-03-14 10:44:50] [INFO ] Flow matrix only has 153 transitions (discarded 25 similar events)
[2023-03-14 10:44:50] [INFO ] Invariant cache hit.
[2023-03-14 10:44:51] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 471 ms. Remains : 164/164 places, 178/178 transitions.
Treatment of property NeoElection-COL-6-LTLFireability-07 finished in 7765 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 U G(p0))))'
Support contains 6 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 394/394 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 206 transition count 184
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 206 transition count 184
Applied a total of 88 rules in 9 ms. Remains 206 /250 variables (removed 44) and now considering 184/394 (removed 210) transitions.
[2023-03-14 10:44:51] [INFO ] Flow matrix only has 159 transitions (discarded 25 similar events)
// Phase 1: matrix 159 rows 206 cols
[2023-03-14 10:44:51] [INFO ] Computed 47 place invariants in 2 ms
[2023-03-14 10:44:51] [INFO ] Implicit Places using invariants in 201 ms returned [16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51]
Discarding 36 places :
Implicit Place search using SMT only with invariants took 204 ms to find 36 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/250 places, 184/394 transitions.
Applied a total of 0 rules in 3 ms. Remains 170 /170 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 216 ms. Remains : 170/250 places, 184/394 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : NeoElection-COL-6-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ 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={0} source=3 dest: 3}]], initial=2, aps=[p0:(AND (LT s126 1) (LT s125 1) (LT s127 1) (LT s122 1) (LT s124 1) (LT s123 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 34 steps with 0 reset in 1 ms.
FORMULA NeoElection-COL-6-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-6-LTLFireability-08 finished in 362 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 46 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 394/394 transitions.
Reduce places removed 6 places and 6 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 238 transition count 388
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 6 place count 238 transition count 382
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 18 place count 232 transition count 382
Discarding 50 places :
Symmetric choice reduction at 1 with 50 rule applications. Total rules 68 place count 182 transition count 166
Iterating global reduction 1 with 50 rules applied. Total rules applied 118 place count 182 transition count 166
Applied a total of 118 rules in 24 ms. Remains 182 /250 variables (removed 68) and now considering 166/394 (removed 228) transitions.
[2023-03-14 10:44:51] [INFO ] Flow matrix only has 141 transitions (discarded 25 similar events)
// Phase 1: matrix 141 rows 182 cols
[2023-03-14 10:44:51] [INFO ] Computed 41 place invariants in 2 ms
[2023-03-14 10:44:51] [INFO ] Implicit Places using invariants in 142 ms returned [10, 11, 12, 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, 38, 39]
Discarding 30 places :
Implicit Place search using SMT only with invariants took 145 ms to find 30 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 152/250 places, 166/394 transitions.
Applied a total of 0 rules in 6 ms. Remains 152 /152 variables (removed 0) and now considering 166/166 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 175 ms. Remains : 152/250 places, 166/394 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-6-LTLFireability-09 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 s8 1) (GEQ s90 1) (GEQ s114 1)) (AND (GEQ s2 1) (GEQ s40 1) (GEQ s111 1)) (AND (GEQ s3 1) (GEQ s26 1) (GEQ s111 1)) (AND (GEQ s98 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 4684 reset in 768 ms.
Product exploration explored 100000 steps with 4701 reset in 715 ms.
Computed a total of 152 stabilizing places and 166 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 152 transition count 166
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 168 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 71 ms :[(NOT p0), (NOT p0)]
Finished random walk after 22 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
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 205 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 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 228 ms :[(NOT p0), (NOT p0)]
[2023-03-14 10:44:54] [INFO ] Flow matrix only has 141 transitions (discarded 25 similar events)
// Phase 1: matrix 141 rows 152 cols
[2023-03-14 10:44:54] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-14 10:44:54] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-03-14 10:44:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:44:54] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2023-03-14 10:44:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:44:55] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-14 10:44:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:44:55] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2023-03-14 10:44:55] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-14 10:44:55] [INFO ] [Nat]Added 5 Read/Feed constraints in 4 ms returned sat
[2023-03-14 10:44:55] [INFO ] Computed and/alt/rep : 154/344/129 causal constraints (skipped 6 transitions) in 13 ms.
[2023-03-14 10:44:55] [INFO ] Added : 66 causal constraints over 14 iterations in 267 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 46 out of 152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 152/152 places, 166/166 transitions.
Applied a total of 0 rules in 7 ms. Remains 152 /152 variables (removed 0) and now considering 166/166 (removed 0) transitions.
[2023-03-14 10:44:55] [INFO ] Flow matrix only has 141 transitions (discarded 25 similar events)
[2023-03-14 10:44:55] [INFO ] Invariant cache hit.
[2023-03-14 10:44:55] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-14 10:44:55] [INFO ] Flow matrix only has 141 transitions (discarded 25 similar events)
[2023-03-14 10:44:55] [INFO ] Invariant cache hit.
[2023-03-14 10:44:55] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-14 10:44:56] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
[2023-03-14 10:44:56] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-14 10:44:56] [INFO ] Flow matrix only has 141 transitions (discarded 25 similar events)
[2023-03-14 10:44:56] [INFO ] Invariant cache hit.
[2023-03-14 10:44:56] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 579 ms. Remains : 152/152 places, 166/166 transitions.
Computed a total of 152 stabilizing places and 166 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 152 transition count 166
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 160 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 73 ms :[(NOT p0), (NOT p0)]
Finished random walk after 20 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=10 )
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 179 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 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
[2023-03-14 10:44:56] [INFO ] Flow matrix only has 141 transitions (discarded 25 similar events)
[2023-03-14 10:44:56] [INFO ] Invariant cache hit.
[2023-03-14 10:44:57] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-03-14 10:44:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:44:57] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2023-03-14 10:44:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:44:57] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-03-14 10:44:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:44:57] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2023-03-14 10:44:57] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-14 10:44:57] [INFO ] [Nat]Added 5 Read/Feed constraints in 4 ms returned sat
[2023-03-14 10:44:57] [INFO ] Computed and/alt/rep : 154/344/129 causal constraints (skipped 6 transitions) in 13 ms.
[2023-03-14 10:44:58] [INFO ] Added : 61 causal constraints over 13 iterations in 217 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4679 reset in 713 ms.
Product exploration explored 100000 steps with 4697 reset in 731 ms.
Support contains 46 out of 152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 152/152 places, 166/166 transitions.
Applied a total of 0 rules in 6 ms. Remains 152 /152 variables (removed 0) and now considering 166/166 (removed 0) transitions.
[2023-03-14 10:44:59] [INFO ] Flow matrix only has 141 transitions (discarded 25 similar events)
[2023-03-14 10:44:59] [INFO ] Invariant cache hit.
[2023-03-14 10:44:59] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-14 10:44:59] [INFO ] Flow matrix only has 141 transitions (discarded 25 similar events)
[2023-03-14 10:44:59] [INFO ] Invariant cache hit.
[2023-03-14 10:44:59] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-14 10:44:59] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2023-03-14 10:44:59] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-14 10:44:59] [INFO ] Flow matrix only has 141 transitions (discarded 25 similar events)
[2023-03-14 10:44:59] [INFO ] Invariant cache hit.
[2023-03-14 10:45:00] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 422 ms. Remains : 152/152 places, 166/166 transitions.
Treatment of property NeoElection-COL-6-LTLFireability-09 finished in 8561 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 45 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 394/394 transitions.
Reduce places removed 6 places and 6 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 238 transition count 388
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 6 place count 238 transition count 382
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 18 place count 232 transition count 382
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 38 place count 212 transition count 268
Iterating global reduction 1 with 20 rules applied. Total rules applied 58 place count 212 transition count 268
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 58 place count 212 transition count 267
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 211 transition count 267
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 210 transition count 266
Ensure Unique test removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 62 place count 209 transition count 266
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 208 transition count 265
Ensure Unique test removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 207 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 65 place count 206 transition count 264
Ensure Unique test removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 66 place count 205 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 67 place count 204 transition count 263
Ensure Unique test removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 68 place count 203 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 69 place count 202 transition count 262
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 70 place count 201 transition count 262
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 70 place count 201 transition count 257
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 80 place count 196 transition count 257
Applied a total of 80 rules in 85 ms. Remains 196 /250 variables (removed 54) and now considering 257/394 (removed 137) transitions.
[2023-03-14 10:45:00] [INFO ] Flow matrix only has 232 transitions (discarded 25 similar events)
// Phase 1: matrix 232 rows 196 cols
[2023-03-14 10:45:00] [INFO ] Computed 36 place invariants in 2 ms
[2023-03-14 10:45:00] [INFO ] Implicit Places using invariants in 149 ms returned [10, 12, 14, 16, 18, 21, 23, 25, 27, 30, 32, 34, 36, 39, 41, 43, 45, 48, 50, 52, 54]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 152 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 175/250 places, 257/394 transitions.
Applied a total of 0 rules in 7 ms. Remains 175 /175 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 245 ms. Remains : 175/250 places, 257/394 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-6-LTLFireability-11 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 s33 1) (GEQ s127 1) (GEQ s144 1)) (AND (GEQ s32 1) (GEQ s123 1) (GEQ s144 1)) (AND (GEQ s23 1) (GEQ s86 1) (GEQ s142 1)) (AND (GEQ s34 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2117 reset in 1091 ms.
Product exploration explored 100000 steps with 2107 reset in 1168 ms.
Computed a total of 175 stabilizing places and 257 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 175 transition count 257
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 147 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 71 ms :[(NOT p0), (NOT p0)]
Finished random walk after 40 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=20 )
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 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 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
[2023-03-14 10:45:03] [INFO ] Flow matrix only has 232 transitions (discarded 25 similar events)
// Phase 1: matrix 232 rows 175 cols
[2023-03-14 10:45:03] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-14 10:45:04] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-14 10:45:04] [INFO ] [Real]Absence check using 10 positive and 5 generalized place invariants in 12 ms returned sat
[2023-03-14 10:45:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:45:04] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2023-03-14 10:45:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:45:04] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-14 10:45:04] [INFO ] [Nat]Absence check using 10 positive and 5 generalized place invariants in 4 ms returned sat
[2023-03-14 10:45:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:45:05] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2023-03-14 10:45:05] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-14 10:45:05] [INFO ] [Nat]Added 21 Read/Feed constraints in 9 ms returned sat
[2023-03-14 10:45:05] [INFO ] Computed and/alt/rep : 237/732/212 causal constraints (skipped 15 transitions) in 22 ms.
[2023-03-14 10:45:05] [INFO ] Added : 86 causal constraints over 18 iterations in 429 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 45 out of 175 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 175/175 places, 257/257 transitions.
Applied a total of 0 rules in 6 ms. Remains 175 /175 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2023-03-14 10:45:05] [INFO ] Flow matrix only has 232 transitions (discarded 25 similar events)
[2023-03-14 10:45:05] [INFO ] Invariant cache hit.
[2023-03-14 10:45:05] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-14 10:45:05] [INFO ] Flow matrix only has 232 transitions (discarded 25 similar events)
[2023-03-14 10:45:05] [INFO ] Invariant cache hit.
[2023-03-14 10:45:05] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-14 10:45:05] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2023-03-14 10:45:05] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-14 10:45:05] [INFO ] Flow matrix only has 232 transitions (discarded 25 similar events)
[2023-03-14 10:45:05] [INFO ] Invariant cache hit.
[2023-03-14 10:45:06] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 566 ms. Remains : 175/175 places, 257/257 transitions.
Computed a total of 175 stabilizing places and 257 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 175 transition count 257
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 154 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 72 ms :[(NOT p0), (NOT p0)]
Finished random walk after 50 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=16 )
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 173 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 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
[2023-03-14 10:45:06] [INFO ] Flow matrix only has 232 transitions (discarded 25 similar events)
[2023-03-14 10:45:06] [INFO ] Invariant cache hit.
[2023-03-14 10:45:07] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-14 10:45:07] [INFO ] [Real]Absence check using 10 positive and 5 generalized place invariants in 5 ms returned sat
[2023-03-14 10:45:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:45:07] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2023-03-14 10:45:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:45:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-14 10:45:08] [INFO ] [Nat]Absence check using 10 positive and 5 generalized place invariants in 4 ms returned sat
[2023-03-14 10:45:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:45:08] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2023-03-14 10:45:08] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-14 10:45:08] [INFO ] [Nat]Added 21 Read/Feed constraints in 8 ms returned sat
[2023-03-14 10:45:08] [INFO ] Computed and/alt/rep : 237/732/212 causal constraints (skipped 15 transitions) in 19 ms.
[2023-03-14 10:45:09] [INFO ] Added : 91 causal constraints over 19 iterations in 433 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2115 reset in 1099 ms.
Product exploration explored 100000 steps with 2105 reset in 1144 ms.
Support contains 45 out of 175 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 175/175 places, 257/257 transitions.
Applied a total of 0 rules in 5 ms. Remains 175 /175 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2023-03-14 10:45:11] [INFO ] Flow matrix only has 232 transitions (discarded 25 similar events)
[2023-03-14 10:45:11] [INFO ] Invariant cache hit.
[2023-03-14 10:45:11] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-14 10:45:11] [INFO ] Flow matrix only has 232 transitions (discarded 25 similar events)
[2023-03-14 10:45:11] [INFO ] Invariant cache hit.
[2023-03-14 10:45:11] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-14 10:45:11] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
[2023-03-14 10:45:11] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-14 10:45:11] [INFO ] Flow matrix only has 232 transitions (discarded 25 similar events)
[2023-03-14 10:45:11] [INFO ] Invariant cache hit.
[2023-03-14 10:45:11] [INFO ] Dead Transitions using invariants and state equation in 212 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 610 ms. Remains : 175/175 places, 257/257 transitions.
Treatment of property NeoElection-COL-6-LTLFireability-11 finished in 11907 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 60 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 394/394 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 250 transition count 388
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 244 transition count 388
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 62 place count 194 transition count 172
Iterating global reduction 0 with 50 rules applied. Total rules applied 112 place count 194 transition count 172
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 112 place count 194 transition count 166
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 124 place count 188 transition count 166
Applied a total of 124 rules in 17 ms. Remains 188 /250 variables (removed 62) and now considering 166/394 (removed 228) transitions.
[2023-03-14 10:45:12] [INFO ] Flow matrix only has 141 transitions (discarded 25 similar events)
// Phase 1: matrix 141 rows 188 cols
[2023-03-14 10:45:12] [INFO ] Computed 47 place invariants in 1 ms
[2023-03-14 10:45:12] [INFO ] Implicit Places using invariants in 150 ms returned [17, 23, 29, 35, 41, 47]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 165 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 182/250 places, 166/394 transitions.
Applied a total of 0 rules in 4 ms. Remains 182 /182 variables (removed 0) and now considering 166/166 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 188 ms. Remains : 182/250 places, 166/394 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-COL-6-LTLFireability-13 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 s36 1) (GEQ s172 1)) (AND (GEQ s33 1) (GEQ s169 1)) (AND (GEQ s29 1) (GEQ s165 1)) (AND (GEQ s40 1) (GEQ s176 1)) (AND (GEQ s42 1) (GEQ s...], 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 156 steps with 0 reset in 1 ms.
FORMULA NeoElection-COL-6-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-6-LTLFireability-13 finished in 243 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Found a Shortening insensitive property : NeoElection-COL-6-LTLFireability-07
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 36 out of 250 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 250/250 places, 394/394 transitions.
Reduce places removed 6 places and 6 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 238 transition count 388
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 6 place count 238 transition count 382
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 18 place count 232 transition count 382
Discarding 50 places :
Symmetric choice reduction at 1 with 50 rule applications. Total rules 68 place count 182 transition count 166
Iterating global reduction 1 with 50 rules applied. Total rules applied 118 place count 182 transition count 166
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 124 place count 176 transition count 160
Ensure Unique test removed 6 places
Iterating post reduction 1 with 6 rules applied. Total rules applied 130 place count 170 transition count 160
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 136 place count 164 transition count 154
Ensure Unique test removed 6 places
Iterating post reduction 2 with 6 rules applied. Total rules applied 142 place count 158 transition count 154
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 148 place count 152 transition count 148
Ensure Unique test removed 6 places
Iterating post reduction 3 with 6 rules applied. Total rules applied 154 place count 146 transition count 148
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 160 place count 140 transition count 142
Ensure Unique test removed 6 places
Iterating post reduction 4 with 6 rules applied. Total rules applied 166 place count 134 transition count 142
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 172 place count 128 transition count 136
Applied a total of 172 rules in 36 ms. Remains 128 /250 variables (removed 122) and now considering 136/394 (removed 258) transitions.
[2023-03-14 10:45:12] [INFO ] Flow matrix only has 111 transitions (discarded 25 similar events)
// Phase 1: matrix 111 rows 128 cols
[2023-03-14 10:45:12] [INFO ] Computed 17 place invariants in 0 ms
[2023-03-14 10:45:12] [INFO ] Implicit Places using invariants in 128 ms returned [10, 11, 12, 13, 14, 15]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 130 ms to find 6 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 122/250 places, 136/394 transitions.
Applied a total of 0 rules in 2 ms. Remains 122 /122 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 168 ms. Remains : 122/250 places, 136/394 transitions.
Running random walk in product with property : NeoElection-COL-6-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (AND (GEQ s31 1) (GEQ s111 1)) (AND (GEQ s88 1) (GEQ s114 1)) (AND (GEQ s75 1) (GEQ s113 1)) (AND (GEQ s99 1) (GEQ s115 1)) (AND (GEQ s21 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, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 13871 reset in 493 ms.
Product exploration explored 100000 steps with 13784 reset in 523 ms.
Computed a total of 122 stabilizing places and 136 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 122 transition count 136
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 (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-14 10:45:14] [INFO ] Flow matrix only has 111 transitions (discarded 25 similar events)
// Phase 1: matrix 111 rows 122 cols
[2023-03-14 10:45:14] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-14 10:45:14] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-14 10:45:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:45:14] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2023-03-14 10:45:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:45:14] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-14 10:45:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:45:15] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2023-03-14 10:45:15] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-14 10:45:15] [INFO ] [Nat]Added 5 Read/Feed constraints in 3 ms returned sat
[2023-03-14 10:45:15] [INFO ] Computed and/alt/rep : 130/265/105 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-14 10:45:15] [INFO ] Added : 42 causal constraints over 9 iterations in 114 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 36 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 136/136 transitions.
Applied a total of 0 rules in 1 ms. Remains 122 /122 variables (removed 0) and now considering 136/136 (removed 0) transitions.
[2023-03-14 10:45:15] [INFO ] Flow matrix only has 111 transitions (discarded 25 similar events)
[2023-03-14 10:45:15] [INFO ] Invariant cache hit.
[2023-03-14 10:45:15] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-14 10:45:15] [INFO ] Flow matrix only has 111 transitions (discarded 25 similar events)
[2023-03-14 10:45:15] [INFO ] Invariant cache hit.
[2023-03-14 10:45:15] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-14 10:45:15] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2023-03-14 10:45:15] [INFO ] Flow matrix only has 111 transitions (discarded 25 similar events)
[2023-03-14 10:45:15] [INFO ] Invariant cache hit.
[2023-03-14 10:45:15] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 337 ms. Remains : 122/122 places, 136/136 transitions.
Computed a total of 122 stabilizing places and 136 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 122 transition count 136
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 (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 145 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-14 10:45:16] [INFO ] Flow matrix only has 111 transitions (discarded 25 similar events)
[2023-03-14 10:45:16] [INFO ] Invariant cache hit.
[2023-03-14 10:45:16] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-14 10:45:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:45:16] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2023-03-14 10:45:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:45:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-14 10:45:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:45:16] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2023-03-14 10:45:16] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-14 10:45:16] [INFO ] [Nat]Added 5 Read/Feed constraints in 3 ms returned sat
[2023-03-14 10:45:16] [INFO ] Computed and/alt/rep : 130/265/105 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-14 10:45:16] [INFO ] Added : 46 causal constraints over 10 iterations in 131 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13837 reset in 491 ms.
Product exploration explored 100000 steps with 13821 reset in 602 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 36 out of 122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 122/122 places, 136/136 transitions.
Applied a total of 0 rules in 2 ms. Remains 122 /122 variables (removed 0) and now considering 136/136 (removed 0) transitions.
[2023-03-14 10:45:18] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 10:45:18] [INFO ] Flow matrix only has 111 transitions (discarded 25 similar events)
[2023-03-14 10:45:18] [INFO ] Invariant cache hit.
[2023-03-14 10:45:18] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 118 ms. Remains : 122/122 places, 136/136 transitions.
Support contains 36 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 136/136 transitions.
Applied a total of 0 rules in 0 ms. Remains 122 /122 variables (removed 0) and now considering 136/136 (removed 0) transitions.
[2023-03-14 10:45:18] [INFO ] Flow matrix only has 111 transitions (discarded 25 similar events)
[2023-03-14 10:45:18] [INFO ] Invariant cache hit.
[2023-03-14 10:45:18] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-14 10:45:18] [INFO ] Flow matrix only has 111 transitions (discarded 25 similar events)
[2023-03-14 10:45:18] [INFO ] Invariant cache hit.
[2023-03-14 10:45:18] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-14 10:45:18] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2023-03-14 10:45:18] [INFO ] Flow matrix only has 111 transitions (discarded 25 similar events)
[2023-03-14 10:45:18] [INFO ] Invariant cache hit.
[2023-03-14 10:45:18] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 395 ms. Remains : 122/122 places, 136/136 transitions.
Treatment of property NeoElection-COL-6-LTLFireability-07 finished in 6561 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)))'
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-14 10:45:19] [INFO ] Flatten gal took : 44 ms
[2023-03-14 10:45:19] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2023-03-14 10:45:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 250 places, 394 transitions and 1958 arcs took 3 ms.
Total runtime 41664 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1372/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1372/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1372/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : NeoElection-COL-6-LTLFireability-07
Could not compute solution for formula : NeoElection-COL-6-LTLFireability-09
Could not compute solution for formula : NeoElection-COL-6-LTLFireability-11

BK_STOP 1678790721297

--------------------
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
mcc2023
ltl formula name NeoElection-COL-6-LTLFireability-07
ltl formula formula --ltl=/tmp/1372/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 250 places, 394 transitions and 1958 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.120 real 0.010 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1372/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1372/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1372/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1372/ltl_0_
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
malloc_consolidate(): invalid chunk size
malloc_consolidate(): invalid chunk size
malloc_consolidate(): invalid chunk size
ltl formula name NeoElection-COL-6-LTLFireability-09
ltl formula formula --ltl=/tmp/1372/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 250 places, 394 transitions and 1958 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.030 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1372/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1372/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1372/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1372/ltl_1_
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
malloc_consolidate(): invalid chunk size
malloc_consolidate(): invalid chunk size
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name NeoElection-COL-6-LTLFireability-11
ltl formula formula --ltl=/tmp/1372/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 250 places, 394 transitions and 1958 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.030 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1372/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1372/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1372/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1372/ltl_2_
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
malloc_consolidate(): invalid chunk size
malloc_consolidate(): invalid chunk size

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is NeoElection-COL-6, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r265-smll-167863539600148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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