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-167863539600115.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-2, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-smll-167863539600115
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 8.3K Feb 26 15:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 15:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 26 15:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 15:46 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.3K Feb 25 16:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 15:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Feb 26 15:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 15:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 15:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 70K 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-2-LTLCardinality-00
FORMULA_NAME NeoElection-COL-2-LTLCardinality-01
FORMULA_NAME NeoElection-COL-2-LTLCardinality-02
FORMULA_NAME NeoElection-COL-2-LTLCardinality-03
FORMULA_NAME NeoElection-COL-2-LTLCardinality-04
FORMULA_NAME NeoElection-COL-2-LTLCardinality-05
FORMULA_NAME NeoElection-COL-2-LTLCardinality-06
FORMULA_NAME NeoElection-COL-2-LTLCardinality-07
FORMULA_NAME NeoElection-COL-2-LTLCardinality-08
FORMULA_NAME NeoElection-COL-2-LTLCardinality-09
FORMULA_NAME NeoElection-COL-2-LTLCardinality-10
FORMULA_NAME NeoElection-COL-2-LTLCardinality-11
FORMULA_NAME NeoElection-COL-2-LTLCardinality-12
FORMULA_NAME NeoElection-COL-2-LTLCardinality-13
FORMULA_NAME NeoElection-COL-2-LTLCardinality-14
FORMULA_NAME NeoElection-COL-2-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678777758737

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeoElection-COL-2
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-14 07:09:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 07:09:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 07:09:22] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-14 07:09:23] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-14 07:09:23] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1091 ms
[2023-03-14 07:09:23] [INFO ] Detected 6 constant HL places corresponding to 192 PT places.
[2023-03-14 07:09:23] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 438 PT places and 672.0 transition bindings in 54 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
[2023-03-14 07:09:23] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 8 ms.
[2023-03-14 07:09:23] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA NeoElection-COL-2-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-2-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-2-LTLCardinality-08 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.3 ms
Remains 13 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-2-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-2-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-2-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-2-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 2 stable transitions
Incomplete random walk after 10000 steps, including 500 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 7 rows 6 cols
[2023-03-14 07:09:24] [INFO ] Computed 1 place invariants in 4 ms
[2023-03-14 07:09:24] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-14 07:09:24] [INFO ] After 191ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
FORMULA NeoElection-COL-2-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-14 07:09:24] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2023-03-14 07:09:24] [INFO ] Flatten gal took : 26 ms
FORMULA NeoElection-COL-2-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-2-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-2-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-14 07:09:24] [INFO ] Flatten gal took : 3 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :MT
Arc [9:1*[$m, $s, 3, 0]] contains constants of sort MT
Transition T_poll__handleAI1 : constants on arcs in [[9:1*[$m, $s, 3, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 2 subsets.
Arc [9:1*[$m, $s, 3, 0]] contains constants of sort MT
Transition T_poll__handleAI2 : constants on arcs in [[9:1*[$m, $s, 3, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 2 subsets.
Arc [9:1*[$m, $s, 4, 0]] contains constants of sort MT
Transition T_poll__handleAnnP1 : constants on arcs in [[9:1*[$m, $s, 4, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 3 subsets.
Arc [9:1*[$m, $s, 4, 0]] contains constants of sort MT
Transition T_poll__handleAnnP2 : constants on arcs in [[9:1*[$m, $s, 4, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 3 subsets.
Arc [9:1*[$m, $s, 1, 0]] contains constants of sort MT
Transition T_poll__handleAnsP1 : constants on arcs in [[9:1*[$m, $s, 1, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 4 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP1 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP2 : constants on arcs in [[9:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP2 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP3 : constants on arcs in [[9:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [11:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP4 : constants on arcs in [[11:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP4 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 0, 0]] contains constants of sort MT
Transition T_poll__handleAskP : constants on arcs in [[9:1*[$m, $s, 0, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 6 subsets.
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.
Domain [M(3), POS(2), M(3)] of place P_masterList breaks symmetries in sort M
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.
Arc [15:1*[$m, (MOD (ADD $i 1) 2)]] contains successor/predecessor on variables of sort POS
[2023-03-14 07:09:24] [INFO ] Unfolded HLPN to a Petri net with 438 places and 295 transitions 1570 arcs in 70 ms.
[2023-03-14 07:09:24] [INFO ] Unfolded 5 HLPN properties in 1 ms.
Deduced a syphon composed of 403 places in 2 ms
Reduce places removed 407 places and 275 transitions.
Reduce places removed 3 places and 0 transitions.
Support contains 14 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 20/20 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 26 transition count 20
Applied a total of 2 rules in 12 ms. Remains 26 /28 variables (removed 2) and now considering 20/20 (removed 0) transitions.
[2023-03-14 07:09:24] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
// Phase 1: matrix 19 rows 26 cols
[2023-03-14 07:09:24] [INFO ] Computed 7 place invariants in 3 ms
[2023-03-14 07:09:24] [INFO ] Implicit Places using invariants in 71 ms returned [4, 5, 6, 7]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 75 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/28 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 89 ms. Remains : 22/28 places, 20/20 transitions.
Support contains 14 out of 22 places after structural reductions.
[2023-03-14 07:09:24] [INFO ] Flatten gal took : 13 ms
[2023-03-14 07:09:24] [INFO ] Flatten gal took : 12 ms
[2023-03-14 07:09:24] [INFO ] Input system was already deterministic with 20 transitions.
Finished random walk after 29 steps, including 0 resets, run visited all 5 properties in 5 ms. (steps per millisecond=5 )
Computed a total of 22 stabilizing places and 20 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 20
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' '!(G(F(p0)))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Reduce places removed 2 places and 2 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 20 transition count 16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 18 transition count 16
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 16 transition count 14
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 14 transition count 12
Applied a total of 10 rules in 14 ms. Remains 14 /22 variables (removed 8) and now considering 12/20 (removed 8) transitions.
[2023-03-14 07:09:25] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 14 cols
[2023-03-14 07:09:25] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-14 07:09:25] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-14 07:09:25] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
[2023-03-14 07:09:25] [INFO ] Invariant cache hit.
[2023-03-14 07:09:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-14 07:09:25] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2023-03-14 07:09:25] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 07:09:25] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
[2023-03-14 07:09:25] [INFO ] Invariant cache hit.
[2023-03-14 07:09:25] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/22 places, 12/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 238 ms. Remains : 14/22 places, 12/20 transitions.
Stuttering acceptance computed with spot in 279 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-2-LTLCardinality-02 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:(GT 2 (ADD s10 s11))], 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 11631 reset in 510 ms.
Product exploration explored 100000 steps with 11718 reset in 355 ms.
Computed a total of 14 stabilizing places and 12 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 14 transition count 12
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-2-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-2-LTLCardinality-02 finished in 1660 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-14 07:09:26] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
// Phase 1: matrix 19 rows 22 cols
[2023-03-14 07:09:26] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-14 07:09:26] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-14 07:09:26] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
[2023-03-14 07:09:26] [INFO ] Invariant cache hit.
[2023-03-14 07:09:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-14 07:09:26] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2023-03-14 07:09:26] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
[2023-03-14 07:09:26] [INFO ] Invariant cache hit.
[2023-03-14 07:09:26] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 198 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-2-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s14 s15) 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 182 ms.
Product exploration explored 100000 steps with 50000 reset in 154 ms.
Computed a total of 22 stabilizing places and 20 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 20
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 238 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-2-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-2-LTLCardinality-05 finished in 939 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 8 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 20 transition count 18
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 20 transition count 18
Applied a total of 4 rules in 2 ms. Remains 20 /22 variables (removed 2) and now considering 18/20 (removed 2) transitions.
[2023-03-14 07:09:27] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
// Phase 1: matrix 17 rows 20 cols
[2023-03-14 07:09:27] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-14 07:09:27] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-14 07:09:27] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2023-03-14 07:09:27] [INFO ] Invariant cache hit.
[2023-03-14 07:09:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-14 07:09:27] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2023-03-14 07:09:27] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2023-03-14 07:09:27] [INFO ] Invariant cache hit.
[2023-03-14 07:09:27] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 18/20 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 149 ms. Remains : 20/22 places, 18/20 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-2-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 2 (ADD s4 s5 s6 s7 s8 s9 s10 s11))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 126 ms.
Product exploration explored 100000 steps with 50000 reset in 158 ms.
Computed a total of 20 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 98 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-2-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-2-LTLCardinality-09 finished in 689 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(X(F(p0)))))'
Support contains 10 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 20 transition count 18
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 20 transition count 18
Applied a total of 4 rules in 3 ms. Remains 20 /22 variables (removed 2) and now considering 18/20 (removed 2) transitions.
[2023-03-14 07:09:28] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2023-03-14 07:09:28] [INFO ] Invariant cache hit.
[2023-03-14 07:09:28] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-14 07:09:28] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2023-03-14 07:09:28] [INFO ] Invariant cache hit.
[2023-03-14 07:09:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-14 07:09:28] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-14 07:09:28] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2023-03-14 07:09:28] [INFO ] Invariant cache hit.
[2023-03-14 07:09:28] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 18/20 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 140 ms. Remains : 20/22 places, 18/20 transitions.
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-2-LTLCardinality-11 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: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(GT (ADD s16 s17) (ADD s4 s5 s6 s7 s8 s9 s10 s11))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3617 reset in 164 ms.
Product exploration explored 100000 steps with 3626 reset in 311 ms.
Computed a total of 20 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 18
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), true, (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 187 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 24 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=24 )
Knowledge obtained : [(NOT p0), true, (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 219 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2023-03-14 07:09:30] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2023-03-14 07:09:30] [INFO ] Invariant cache hit.
[2023-03-14 07:09:30] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-14 07:09:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 07:09:30] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-14 07:09:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 07:09:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-14 07:09:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 07:09:30] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-14 07:09:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-14 07:09:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-14 07:09:30] [INFO ] Computed and/alt/rep : 16/37/15 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-14 07:09:30] [INFO ] Added : 14 causal constraints over 3 iterations in 46 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 10 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-14 07:09:30] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2023-03-14 07:09:30] [INFO ] Invariant cache hit.
[2023-03-14 07:09:30] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-14 07:09:30] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2023-03-14 07:09:30] [INFO ] Invariant cache hit.
[2023-03-14 07:09:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-14 07:09:30] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2023-03-14 07:09:30] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2023-03-14 07:09:30] [INFO ] Invariant cache hit.
[2023-03-14 07:09:30] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 162 ms. Remains : 20/20 places, 18/18 transitions.
Computed a total of 20 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 18
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), true, (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 31 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=15 )
Knowledge obtained : [(NOT p0), true, (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 144 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2023-03-14 07:09:31] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2023-03-14 07:09:31] [INFO ] Invariant cache hit.
[2023-03-14 07:09:31] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-14 07:09:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 07:09:31] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-14 07:09:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 07:09:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-14 07:09:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 07:09:31] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-14 07:09:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-14 07:09:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-14 07:09:31] [INFO ] Computed and/alt/rep : 16/37/15 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-14 07:09:31] [INFO ] Added : 14 causal constraints over 3 iterations in 34 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3610 reset in 161 ms.
Product exploration explored 100000 steps with 3623 reset in 185 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 10 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 20 transition count 18
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 20 transition count 18
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 4 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-14 07:09:32] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 07:09:32] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
// Phase 1: matrix 17 rows 20 cols
[2023-03-14 07:09:32] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-14 07:09:32] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/20 places, 18/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63 ms. Remains : 20/20 places, 18/18 transitions.
Support contains 10 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-14 07:09:32] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
// Phase 1: matrix 17 rows 20 cols
[2023-03-14 07:09:32] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-14 07:09:32] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-14 07:09:32] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2023-03-14 07:09:32] [INFO ] Invariant cache hit.
[2023-03-14 07:09:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-14 07:09:32] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2023-03-14 07:09:32] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2023-03-14 07:09:32] [INFO ] Invariant cache hit.
[2023-03-14 07:09:32] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 130 ms. Remains : 20/20 places, 18/18 transitions.
Treatment of property NeoElection-COL-2-LTLCardinality-11 finished in 4663 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 20 transition count 18
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 20 transition count 18
Applied a total of 4 rules in 2 ms. Remains 20 /22 variables (removed 2) and now considering 18/20 (removed 2) transitions.
[2023-03-14 07:09:32] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2023-03-14 07:09:32] [INFO ] Invariant cache hit.
[2023-03-14 07:09:32] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-14 07:09:32] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2023-03-14 07:09:32] [INFO ] Invariant cache hit.
[2023-03-14 07:09:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-14 07:09:33] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2023-03-14 07:09:33] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2023-03-14 07:09:33] [INFO ] Invariant cache hit.
[2023-03-14 07:09:33] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 18/20 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 143 ms. Remains : 20/22 places, 18/20 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : NeoElection-COL-2-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(GT (ADD s12 s13) 0)], 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA NeoElection-COL-2-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-2-LTLCardinality-15 finished in 333 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(X(F(p0)))))'
Found a Shortening insensitive property : NeoElection-COL-2-LTLCardinality-11
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 10 out of 22 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Reduce places removed 2 places and 2 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 18 transition count 16
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 18 transition count 16
Applied a total of 4 rules in 2 ms. Remains 18 /22 variables (removed 4) and now considering 16/20 (removed 4) transitions.
[2023-03-14 07:09:33] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
// Phase 1: matrix 15 rows 18 cols
[2023-03-14 07:09:33] [INFO ] Computed 3 place invariants in 12 ms
[2023-03-14 07:09:33] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-14 07:09:33] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
[2023-03-14 07:09:33] [INFO ] Invariant cache hit.
[2023-03-14 07:09:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-14 07:09:33] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2023-03-14 07:09:33] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
[2023-03-14 07:09:33] [INFO ] Invariant cache hit.
[2023-03-14 07:09:33] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 18/22 places, 16/20 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 144 ms. Remains : 18/22 places, 16/20 transitions.
Running random walk in product with property : NeoElection-COL-2-LTLCardinality-11 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: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(GT (ADD s14 s15) (ADD s2 s3 s4 s5 s6 s7 s8 s9))], 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 3890 reset in 95 ms.
Product exploration explored 100000 steps with 3898 reset in 121 ms.
Computed a total of 18 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 transition count 16
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), true, (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 175 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 29 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=14 )
Knowledge obtained : [(NOT p0), true, (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 209 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2023-03-14 07:09:35] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
[2023-03-14 07:09:35] [INFO ] Invariant cache hit.
[2023-03-14 07:09:35] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-14 07:09:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 07:09:35] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-14 07:09:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 07:09:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-14 07:09:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 07:09:35] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-14 07:09:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-14 07:09:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-14 07:09:35] [INFO ] Computed and/alt/rep : 14/35/13 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-14 07:09:35] [INFO ] Added : 12 causal constraints over 3 iterations in 30 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 10 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-14 07:09:35] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
[2023-03-14 07:09:35] [INFO ] Invariant cache hit.
[2023-03-14 07:09:35] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-14 07:09:35] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
[2023-03-14 07:09:35] [INFO ] Invariant cache hit.
[2023-03-14 07:09:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-14 07:09:35] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2023-03-14 07:09:35] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
[2023-03-14 07:09:35] [INFO ] Invariant cache hit.
[2023-03-14 07:09:35] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 116 ms. Remains : 18/18 places, 16/16 transitions.
Computed a total of 18 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 transition count 16
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), true, (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (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), true, (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 183 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2023-03-14 07:09:36] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
[2023-03-14 07:09:36] [INFO ] Invariant cache hit.
[2023-03-14 07:09:36] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-14 07:09:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 07:09:36] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-14 07:09:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 07:09:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-14 07:09:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 07:09:36] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-14 07:09:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-14 07:09:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-14 07:09:36] [INFO ] Computed and/alt/rep : 14/35/13 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-14 07:09:36] [INFO ] Added : 12 causal constraints over 3 iterations in 27 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3891 reset in 168 ms.
Product exploration explored 100000 steps with 3901 reset in 366 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 268 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 10 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 16/16 transitions.
Applied a total of 0 rules in 3 ms. Remains 18 /18 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-14 07:09:37] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 07:09:37] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
[2023-03-14 07:09:37] [INFO ] Invariant cache hit.
[2023-03-14 07:09:37] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 58 ms. Remains : 18/18 places, 16/16 transitions.
Support contains 10 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-14 07:09:37] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
[2023-03-14 07:09:37] [INFO ] Invariant cache hit.
[2023-03-14 07:09:37] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-14 07:09:37] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
[2023-03-14 07:09:37] [INFO ] Invariant cache hit.
[2023-03-14 07:09:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-14 07:09:37] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-14 07:09:37] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
[2023-03-14 07:09:37] [INFO ] Invariant cache hit.
[2023-03-14 07:09:37] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 131 ms. Remains : 18/18 places, 16/16 transitions.
Treatment of property NeoElection-COL-2-LTLCardinality-11 finished in 4445 ms.
[2023-03-14 07:09:37] [INFO ] Flatten gal took : 7 ms
[2023-03-14 07:09:37] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2023-03-14 07:09:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 22 places, 20 transitions and 67 arcs took 1 ms.
Total runtime 15360 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1116/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : NeoElection-COL-2-LTLCardinality-11

BK_STOP 1678777779483

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name NeoElection-COL-2-LTLCardinality-11
ltl formula formula --ltl=/tmp/1116/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 22 places, 20 transitions and 67 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.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1116/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1116/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1116/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1116/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted

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-2"
export BK_EXAMINATION="LTLCardinality"
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-2, 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 r265-smll-167863539600115"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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