Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 8.4K Apr 11 19:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 11 19:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 11 19:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 11 19:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Apr 23 07:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 21:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Apr 11 21:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 20:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 11 20:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 98K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716685774014

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeoElection-COL-6
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202304061127
[2024-05-26 01:09:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 01:09:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 01:09:35] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-26 01:09:35] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-26 01:09:36] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 803 ms
[2024-05-26 01:09:36] [INFO ] Detected 6 constant HL places corresponding to 2380 PT places.
[2024-05-26 01:09:36] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 4830 PT places and 13580.0 transition bindings in 25 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2024-05-26 01:09:36] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 5 ms.
[2024-05-26 01:09:36] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA NeoElection-COL-6-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 14 stabilizing places and 8 stable transitions
Graph (complete) has 56 edges and 18 vertex of which 15 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Remains 14 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-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 2 stable transitions
Incomplete random walk after 10005 steps, including 273 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 12) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 192 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 7 rows 6 cols
[2024-05-26 01:09:36] [INFO ] Computed 1 invariants in 6 ms
[2024-05-26 01:09:36] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-26 01:09:36] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 2 atomic propositions for a total of 8 simplifications.
FORMULA NeoElection-COL-6-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-26 01:09:36] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-05-26 01:09:36] [INFO ] Flatten gal took : 18 ms
FORMULA NeoElection-COL-6-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-26 01:09:36] [INFO ] Flatten gal took : 1 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.
[2024-05-26 01:09:37] [INFO ] Unfolded HLPN to a Petri net with 4830 places and 7361 transitions 41792 arcs in 138 ms.
[2024-05-26 01:09:37] [INFO ] Unfolded 6 HLPN properties in 2 ms.
Deduced a syphon composed of 4507 places in 20 ms
Reduce places removed 4543 places and 6967 transitions.
Reduce places removed 7 places and 0 transitions.
Support contains 180 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
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 54 place count 226 transition count 214
Iterating global reduction 1 with 24 rules applied. Total rules applied 78 place count 226 transition count 214
Applied a total of 78 rules in 15 ms. Remains 226 /280 variables (removed 54) and now considering 214/394 (removed 180) transitions.
[2024-05-26 01:09:37] [INFO ] Flow matrix only has 189 transitions (discarded 25 similar events)
// Phase 1: matrix 189 rows 226 cols
[2024-05-26 01:09:37] [INFO ] Computed 47 invariants in 16 ms
[2024-05-26 01:09:37] [INFO ] Implicit Places using invariants in 186 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 189 ms to find 36 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 190/280 places, 214/394 transitions.
Applied a total of 0 rules in 2 ms. Remains 190 /190 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 208 ms. Remains : 190/280 places, 214/394 transitions.
Support contains 180 out of 190 places after structural reductions.
[2024-05-26 01:09:37] [INFO ] Flatten gal took : 26 ms
[2024-05-26 01:09:37] [INFO ] Flatten gal took : 19 ms
[2024-05-26 01:09:37] [INFO ] Input system was already deterministic with 214 transitions.
Incomplete random walk after 10000 steps, including 24 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 12) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-26 01:09:37] [INFO ] Flow matrix only has 189 transitions (discarded 25 similar events)
// Phase 1: matrix 189 rows 190 cols
[2024-05-26 01:09:37] [INFO ] Computed 11 invariants in 11 ms
[2024-05-26 01:09:37] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-26 01:09:37] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 6 simplifications.
Computed a total of 190 stabilizing places and 214 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 190 transition count 214
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 6 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 214/214 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 164 transition count 178
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 164 transition count 178
Applied a total of 52 rules in 15 ms. Remains 164 /190 variables (removed 26) and now considering 178/214 (removed 36) transitions.
[2024-05-26 01:09:37] [INFO ] Flow matrix only has 153 transitions (discarded 25 similar events)
// Phase 1: matrix 153 rows 164 cols
[2024-05-26 01:09:37] [INFO ] Computed 11 invariants in 1 ms
[2024-05-26 01:09:38] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-26 01:09:38] [INFO ] Flow matrix only has 153 transitions (discarded 25 similar events)
[2024-05-26 01:09:38] [INFO ] Invariant cache hit.
[2024-05-26 01:09:38] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-26 01:09:38] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2024-05-26 01:09:38] [INFO ] Flow matrix only has 153 transitions (discarded 25 similar events)
[2024-05-26 01:09:38] [INFO ] Invariant cache hit.
[2024-05-26 01:09:38] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 164/190 places, 178/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 437 ms. Remains : 164/190 places, 178/214 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 183 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-6-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT (ADD s116 s117 s118 s119 s120 s121) 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA NeoElection-COL-6-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-6-LTLCardinality-00 finished in 676 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(((p1 U p0)||G(F(p2))))))))'
Support contains 126 out of 190 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 190 /190 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-05-26 01:09:38] [INFO ] Flow matrix only has 189 transitions (discarded 25 similar events)
// Phase 1: matrix 189 rows 190 cols
[2024-05-26 01:09:38] [INFO ] Computed 11 invariants in 3 ms
[2024-05-26 01:09:38] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-26 01:09:38] [INFO ] Flow matrix only has 189 transitions (discarded 25 similar events)
[2024-05-26 01:09:38] [INFO ] Invariant cache hit.
[2024-05-26 01:09:38] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-26 01:09:38] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2024-05-26 01:09:38] [INFO ] Flow matrix only has 189 transitions (discarded 25 similar events)
[2024-05-26 01:09:38] [INFO ] Invariant cache hit.
[2024-05-26 01:09:38] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 349 ms. Remains : 190/190 places, 214/214 transitions.
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : NeoElection-COL-6-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 20925 reset in 401 ms.
Product exploration explored 100000 steps with 20894 reset in 345 ms.
Computed a total of 190 stabilizing places and 214 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 190 transition count 214
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p0)), (X (AND (NOT p0) (NOT p2))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 249 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), false, false]
Finished random walk after 44 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=22 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p0)), (X (AND (NOT p0) (NOT p2))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F p0), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND p2 p0)), (F (AND (NOT p2) p0))]
Knowledge based reduction with 5 factoid took 387 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), false, false]
[2024-05-26 01:09:41] [INFO ] Flow matrix only has 189 transitions (discarded 25 similar events)
[2024-05-26 01:09:41] [INFO ] Invariant cache hit.
[2024-05-26 01:09:41] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-26 01:09:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 01:09:41] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2024-05-26 01:09:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 01:09:41] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-26 01:09:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 01:09:42] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2024-05-26 01:09:42] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-26 01:09:42] [INFO ] [Nat]Added 15 Read/Feed constraints in 5 ms returned sat
[2024-05-26 01:09:42] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 4 ms to minimize.
[2024-05-26 01:09:42] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2024-05-26 01:09:42] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-26 01:09:42] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 1 ms to minimize.
[2024-05-26 01:09:42] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 1 ms to minimize.
[2024-05-26 01:09:42] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-26 01:09:42] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-05-26 01:09:42] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-26 01:09:42] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-26 01:09:42] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 0 ms to minimize.
[2024-05-26 01:09:42] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2024-05-26 01:09:42] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 0 ms to minimize.
[2024-05-26 01:09:43] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 1 ms to minimize.
[2024-05-26 01:09:43] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1042 ms
[2024-05-26 01:09:43] [INFO ] Computed and/alt/rep : 202/498/177 causal constraints (skipped 6 transitions) in 10 ms.
[2024-05-26 01:09:43] [INFO ] Added : 0 causal constraints over 0 iterations in 41 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p0))
Support contains 126 out of 190 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 214/214 transitions.
Applied a total of 0 rules in 11 ms. Remains 190 /190 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-05-26 01:09:43] [INFO ] Flow matrix only has 189 transitions (discarded 25 similar events)
[2024-05-26 01:09:43] [INFO ] Invariant cache hit.
[2024-05-26 01:09:43] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-26 01:09:43] [INFO ] Flow matrix only has 189 transitions (discarded 25 similar events)
[2024-05-26 01:09:43] [INFO ] Invariant cache hit.
[2024-05-26 01:09:43] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-26 01:09:43] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2024-05-26 01:09:43] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-26 01:09:43] [INFO ] Flow matrix only has 189 transitions (discarded 25 similar events)
[2024-05-26 01:09:43] [INFO ] Invariant cache hit.
[2024-05-26 01:09:43] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 283 ms. Remains : 190/190 places, 214/214 transitions.
Computed a total of 190 stabilizing places and 214 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 190 transition count 214
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (NOT (AND p2 p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (X (NOT (AND p2 p0)))), (F (G (NOT p2))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 8 factoid took 410 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
Finished random walk after 58 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=29 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (NOT (AND p2 p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (X (NOT (AND p2 p0)))), (F (G (NOT p2))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X p0)), (F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 p2)), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 8 factoid took 543 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
[2024-05-26 01:09:44] [INFO ] Flow matrix only has 189 transitions (discarded 25 similar events)
[2024-05-26 01:09:44] [INFO ] Invariant cache hit.
[2024-05-26 01:09:45] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-26 01:09:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 01:09:45] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2024-05-26 01:09:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 01:09:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-26 01:09:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 01:09:45] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-05-26 01:09:45] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-26 01:09:45] [INFO ] [Nat]Added 15 Read/Feed constraints in 8 ms returned sat
[2024-05-26 01:09:45] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-26 01:09:45] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 0 ms to minimize.
[2024-05-26 01:09:45] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2024-05-26 01:09:46] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 0 ms to minimize.
[2024-05-26 01:09:46] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-05-26 01:09:46] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-26 01:09:46] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-05-26 01:09:46] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2024-05-26 01:09:46] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-26 01:09:46] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 0 ms to minimize.
[2024-05-26 01:09:46] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
[2024-05-26 01:09:46] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 0 ms to minimize.
[2024-05-26 01:09:46] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
[2024-05-26 01:09:46] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 825 ms
[2024-05-26 01:09:46] [INFO ] Computed and/alt/rep : 202/498/177 causal constraints (skipped 6 transitions) in 11 ms.
[2024-05-26 01:09:46] [INFO ] Added : 0 causal constraints over 0 iterations in 38 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
Product exploration explored 100000 steps with 20939 reset in 407 ms.
Product exploration explored 100000 steps with 20938 reset in 421 ms.
Built C files in :
/tmp/ltsmin14093113660215704747
[2024-05-26 01:09:47] [INFO ] Computing symmetric may disable matrix : 214 transitions.
[2024-05-26 01:09:47] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 01:09:47] [INFO ] Computing symmetric may enable matrix : 214 transitions.
[2024-05-26 01:09:47] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 01:09:47] [INFO ] Computing Do-Not-Accords matrix : 214 transitions.
[2024-05-26 01:09:47] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 01:09:47] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14093113660215704747
Running compilation step : cd /tmp/ltsmin14093113660215704747;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 567 ms.
Running link step : cd /tmp/ltsmin14093113660215704747;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin14093113660215704747;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3873787268867354479.hoa' '--buchi-type=spotba'
LTSmin run took 427 ms.
FORMULA NeoElection-COL-6-LTLCardinality-01 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property NeoElection-COL-6-LTLCardinality-01 finished in 10173 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p0)&&(G(p0)||F(p1))))))'
Support contains 162 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 214/214 transitions.
Applied a total of 0 rules in 1 ms. Remains 190 /190 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-05-26 01:09:48] [INFO ] Flow matrix only has 189 transitions (discarded 25 similar events)
[2024-05-26 01:09:48] [INFO ] Invariant cache hit.
[2024-05-26 01:09:48] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-26 01:09:48] [INFO ] Flow matrix only has 189 transitions (discarded 25 similar events)
[2024-05-26 01:09:48] [INFO ] Invariant cache hit.
[2024-05-26 01:09:48] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-26 01:09:48] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2024-05-26 01:09:48] [INFO ] Flow matrix only has 189 transitions (discarded 25 similar events)
[2024-05-26 01:09:48] [INFO ] Invariant cache hit.
[2024-05-26 01:09:49] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 253 ms. Remains : 190/190 places, 214/214 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), true, (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : NeoElection-COL-6-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(OR p0 p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(LEQ 2 (ADD s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181...], 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 51 steps with 0 reset in 0 ms.
FORMULA NeoElection-COL-6-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-6-LTLCardinality-05 finished in 433 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 6 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 214/214 transitions.
Reduce places removed 6 places and 6 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 184 transition count 202
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 178 transition count 202
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 32 place count 158 transition count 172
Iterating global reduction 0 with 20 rules applied. Total rules applied 52 place count 158 transition count 172
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 112 place count 128 transition count 142
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 118 place count 122 transition count 136
Applied a total of 118 rules in 38 ms. Remains 122 /190 variables (removed 68) and now considering 136/214 (removed 78) transitions.
[2024-05-26 01:09:49] [INFO ] Flow matrix only has 111 transitions (discarded 25 similar events)
// Phase 1: matrix 111 rows 122 cols
[2024-05-26 01:09:49] [INFO ] Computed 11 invariants in 0 ms
[2024-05-26 01:09:49] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-26 01:09:49] [INFO ] Flow matrix only has 111 transitions (discarded 25 similar events)
[2024-05-26 01:09:49] [INFO ] Invariant cache hit.
[2024-05-26 01:09:49] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-26 01:09:49] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2024-05-26 01:09:49] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-26 01:09:49] [INFO ] Flow matrix only has 111 transitions (discarded 25 similar events)
[2024-05-26 01:09:49] [INFO ] Invariant cache hit.
[2024-05-26 01:09:49] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 122/190 places, 136/214 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 289 ms. Remains : 122/190 places, 136/214 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-6-LTLCardinality-06 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:(LEQ 6 (ADD s110 s111 s112 s113 s114 s115))], 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 8756 reset in 404 ms.
Product exploration explored 100000 steps with 8833 reset in 425 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 (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 78 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 86 ms :[(NOT p0), (NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Property proved to be false thanks to negative knowledge :(F p0)
Knowledge based reduction with 4 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-6-LTLCardinality-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-6-LTLCardinality-06 finished in 1520 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (p0&&G(p1)))||X(X(F(p0)))))'
Support contains 126 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 214/214 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 184 transition count 208
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 184 transition count 208
Applied a total of 12 rules in 5 ms. Remains 184 /190 variables (removed 6) and now considering 208/214 (removed 6) transitions.
[2024-05-26 01:09:50] [INFO ] Flow matrix only has 183 transitions (discarded 25 similar events)
// Phase 1: matrix 183 rows 184 cols
[2024-05-26 01:09:50] [INFO ] Computed 11 invariants in 2 ms
[2024-05-26 01:09:50] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-26 01:09:50] [INFO ] Flow matrix only has 183 transitions (discarded 25 similar events)
[2024-05-26 01:09:50] [INFO ] Invariant cache hit.
[2024-05-26 01:09:50] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-26 01:09:50] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2024-05-26 01:09:50] [INFO ] Flow matrix only has 183 transitions (discarded 25 similar events)
[2024-05-26 01:09:50] [INFO ] Invariant cache hit.
[2024-05-26 01:09:50] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 184/190 places, 208/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 250 ms. Remains : 184/190 places, 208/214 transitions.
Stuttering acceptance computed with spot in 243 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NeoElection-COL-6-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}, { cond=(AND p1 p0), acceptance={} source=2 dest: 4}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(LEQ 6 (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50...], 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, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 8269 reset in 300 ms.
Product exploration explored 100000 steps with 8273 reset in 313 ms.
Computed a total of 184 stabilizing places and 208 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 184 transition count 208
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (OR (NOT p1) (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 134 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (OR (NOT p1) (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 9 factoid took 198 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 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-26 01:09:52] [INFO ] Flow matrix only has 183 transitions (discarded 25 similar events)
[2024-05-26 01:09:52] [INFO ] Invariant cache hit.
[2024-05-26 01:09:52] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-26 01:09:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 01:09:53] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2024-05-26 01:09:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 01:09:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-26 01:09:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 01:09:53] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2024-05-26 01:09:53] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-26 01:09:53] [INFO ] [Nat]Added 15 Read/Feed constraints in 9 ms returned sat
[2024-05-26 01:09:53] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 0 ms to minimize.
[2024-05-26 01:09:53] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 2 ms to minimize.
[2024-05-26 01:09:53] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-26 01:09:53] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-26 01:09:53] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-05-26 01:09:53] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-26 01:09:53] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2024-05-26 01:09:53] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-05-26 01:09:54] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 3 ms to minimize.
[2024-05-26 01:09:54] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-05-26 01:09:54] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 0 ms to minimize.
[2024-05-26 01:09:54] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-26 01:09:54] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 0 ms to minimize.
[2024-05-26 01:09:54] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 0 ms to minimize.
[2024-05-26 01:09:54] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 0 ms to minimize.
[2024-05-26 01:09:54] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 0 ms to minimize.
[2024-05-26 01:09:54] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2024-05-26 01:09:54] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 0 ms to minimize.
[2024-05-26 01:09:54] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2024-05-26 01:09:54] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 0 ms to minimize.
[2024-05-26 01:09:54] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-05-26 01:09:54] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 0 ms to minimize.
[2024-05-26 01:09:54] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 1518 ms
[2024-05-26 01:09:55] [INFO ] Computed and/alt/rep : 196/486/171 causal constraints (skipped 6 transitions) in 14 ms.
[2024-05-26 01:09:55] [INFO ] Added : 5 causal constraints over 1 iterations in 52 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 120 out of 184 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 208/208 transitions.
Applied a total of 0 rules in 2 ms. Remains 184 /184 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2024-05-26 01:09:55] [INFO ] Flow matrix only has 183 transitions (discarded 25 similar events)
[2024-05-26 01:09:55] [INFO ] Invariant cache hit.
[2024-05-26 01:09:55] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-26 01:09:55] [INFO ] Flow matrix only has 183 transitions (discarded 25 similar events)
[2024-05-26 01:09:55] [INFO ] Invariant cache hit.
[2024-05-26 01:09:55] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-26 01:09:55] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2024-05-26 01:09:55] [INFO ] Flow matrix only has 183 transitions (discarded 25 similar events)
[2024-05-26 01:09:55] [INFO ] Invariant cache hit.
[2024-05-26 01:09:55] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 241 ms. Remains : 184/184 places, 208/208 transitions.
Computed a total of 184 stabilizing places and 208 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 184 transition count 208
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 (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 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 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 111 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 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-26 01:09:55] [INFO ] Flow matrix only has 183 transitions (discarded 25 similar events)
[2024-05-26 01:09:55] [INFO ] Invariant cache hit.
[2024-05-26 01:09:56] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-26 01:09:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 01:09:56] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2024-05-26 01:09:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 01:09:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-26 01:09:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 01:09:56] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2024-05-26 01:09:56] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-26 01:09:56] [INFO ] [Nat]Added 15 Read/Feed constraints in 14 ms returned sat
[2024-05-26 01:09:56] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2024-05-26 01:09:56] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-26 01:09:56] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-05-26 01:09:57] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-26 01:09:57] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-05-26 01:09:57] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-26 01:09:57] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 0 ms to minimize.
[2024-05-26 01:09:57] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 0 ms to minimize.
[2024-05-26 01:09:57] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 3 ms to minimize.
[2024-05-26 01:09:57] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-26 01:09:57] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 0 ms to minimize.
[2024-05-26 01:09:57] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-05-26 01:09:57] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 0 ms to minimize.
[2024-05-26 01:09:57] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 0 ms to minimize.
[2024-05-26 01:09:57] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 0 ms to minimize.
[2024-05-26 01:09:57] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
[2024-05-26 01:09:57] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-05-26 01:09:57] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 2 ms to minimize.
[2024-05-26 01:09:57] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-05-26 01:09:58] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2024-05-26 01:09:58] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 4 ms to minimize.
[2024-05-26 01:09:58] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 0 ms to minimize.
[2024-05-26 01:09:58] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 1398 ms
[2024-05-26 01:09:58] [INFO ] Computed and/alt/rep : 196/486/171 causal constraints (skipped 6 transitions) in 11 ms.
[2024-05-26 01:09:58] [INFO ] Added : 5 causal constraints over 1 iterations in 51 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 8278 reset in 276 ms.
Product exploration explored 100000 steps with 8274 reset in 280 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 120 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 208/208 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 184 transition count 208
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 184 transition count 208
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 12 place count 184 transition count 208
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 184 transition count 208
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 178 transition count 202
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 178 transition count 202
Deduced a syphon composed of 12 places in 0 ms
Applied a total of 30 rules in 22 ms. Remains 178 /184 variables (removed 6) and now considering 202/208 (removed 6) transitions.
[2024-05-26 01:09:59] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-26 01:09:59] [INFO ] Flow matrix only has 177 transitions (discarded 25 similar events)
// Phase 1: matrix 177 rows 178 cols
[2024-05-26 01:09:59] [INFO ] Computed 11 invariants in 1 ms
[2024-05-26 01:09:59] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 178/184 places, 202/208 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 122 ms. Remains : 178/184 places, 202/208 transitions.
Built C files in :
/tmp/ltsmin9435644378128976589
[2024-05-26 01:09:59] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9435644378128976589
Running compilation step : cd /tmp/ltsmin9435644378128976589;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 326 ms.
Running link step : cd /tmp/ltsmin9435644378128976589;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin9435644378128976589;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12926231387947521905.hoa' '--buchi-type=spotba'
LTSmin run took 6126 ms.
FORMULA NeoElection-COL-6-LTLCardinality-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property NeoElection-COL-6-LTLCardinality-08 finished in 15079 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(F(!p0)))))'
Support contains 6 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 214/214 transitions.
Reduce places removed 6 places and 6 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 158 transition count 172
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 158 transition count 172
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 100 place count 134 transition count 148
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 106 place count 128 transition count 142
Applied a total of 106 rules in 23 ms. Remains 128 /190 variables (removed 62) and now considering 142/214 (removed 72) transitions.
[2024-05-26 01:10:05] [INFO ] Flow matrix only has 117 transitions (discarded 25 similar events)
// Phase 1: matrix 117 rows 128 cols
[2024-05-26 01:10:05] [INFO ] Computed 11 invariants in 1 ms
[2024-05-26 01:10:05] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-26 01:10:05] [INFO ] Flow matrix only has 117 transitions (discarded 25 similar events)
[2024-05-26 01:10:05] [INFO ] Invariant cache hit.
[2024-05-26 01:10:05] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-26 01:10:06] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2024-05-26 01:10:06] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-26 01:10:06] [INFO ] Flow matrix only has 117 transitions (discarded 25 similar events)
[2024-05-26 01:10:06] [INFO ] Invariant cache hit.
[2024-05-26 01:10:06] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 128/190 places, 142/214 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 327 ms. Remains : 128/190 places, 142/214 transitions.
Stuttering acceptance computed with spot in 60 ms :[false, p0]
Running random walk in product with property : NeoElection-COL-6-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s122 s123 s124 s125 s126 s127) 0)], 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 23335 reset in 190 ms.
Product exploration explored 100000 steps with 23248 reset in 215 ms.
Computed a total of 128 stabilizing places and 142 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 128 transition count 142
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (NOT p0)), (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be false thanks to negative knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-6-LTLCardinality-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-6-LTLCardinality-15 finished in 947 ms.
All properties solved by simple procedures.
Total runtime 31323 ms.

BK_STOP 1716685808239

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NeoElection-COL-6"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is NeoElection-COL-6, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r263-tall-171654372500297"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;