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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.6K Apr 11 18:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Apr 11 18:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 11 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 11 18:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K Apr 23 07:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 23 07:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 18:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 11 18:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 11 18:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 11 18:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 81K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716685453808

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-4
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202304061127
[2024-05-26 01:04:15] [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:04:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 01:04:15] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-26 01:04:15] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-26 01:04:15] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 480 ms
[2024-05-26 01:04:15] [INFO ] Detected 6 constant HL places corresponding to 870 PT places.
[2024-05-26 01:04:15] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 1830 PT places and 3990.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 111 ms.
Working with output stream class java.io.PrintStream
[2024-05-26 01:04:16] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 5 ms.
[2024-05-26 01:04:16] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 6 formulas.
FORMULA NeoElection-COL-4-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-LTLCardinality-15 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.1 ms
Remains 10 properties that can be checked using skeleton over-approximation.
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 12 places and 7 transitions.
Ensure Unique test removed 8 transitions
Reduce redundant transitions removed 8 transitions.
FORMULA NeoElection-COL-4-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 2 stable transitions
Incomplete random walk after 10000 steps, including 338 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :8
Finished Best-First random walk after 49 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=49 )
Parikh walk visited 0 properties in 1 ms.
[2024-05-26 01:04:16] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2024-05-26 01:04:16] [INFO ] Flatten gal took : 14 ms
FORMULA NeoElection-COL-4-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-4-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-26 01:04:16] [INFO ] Flatten gal took : 1 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :MT
Arc [9:1*[$m, $s, 3, 0]] contains constants of sort MT
Transition T_poll__handleAI1 : constants on arcs in [[9:1*[$m, $s, 3, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 2 subsets.
Arc [9:1*[$m, $s, 3, 0]] contains constants of sort MT
Transition T_poll__handleAI2 : constants on arcs in [[9:1*[$m, $s, 3, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 2 subsets.
Arc [9:1*[$m, $s, 4, 0]] contains constants of sort MT
Transition T_poll__handleAnnP1 : constants on arcs in [[9:1*[$m, $s, 4, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 3 subsets.
Arc [9:1*[$m, $s, 4, 0]] contains constants of sort MT
Transition T_poll__handleAnnP2 : constants on arcs in [[9:1*[$m, $s, 4, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 3 subsets.
Arc [9:1*[$m, $s, 1, 0]] contains constants of sort MT
Transition T_poll__handleAnsP1 : constants on arcs in [[9:1*[$m, $s, 1, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 4 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP1 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP2 : constants on arcs in [[9:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP2 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP3 : constants on arcs in [[9:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [11:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP4 : constants on arcs in [[11:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP4 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 0, 0]] contains constants of sort MT
Transition T_poll__handleAskP : constants on arcs in [[9:1*[$m, $s, 0, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 6 subsets.
Domain [M(5), POS(4), M(5)] of place P_masterList breaks symmetries in sort M
Arc [15:1*[$m, (MOD (ADD $i 1) 4)]] contains successor/predecessor on variables of sort POS
Symmetric sort wr.t. initial and guards and successors and join/free detected :STAGE
Arc [16:1*[$m, 0]] contains constants of sort STAGE
Transition T_poll__iAmPrimary : constants on arcs in [[16:1*[$m, 0]]] introduces in STAGE(3) partition with 1 elements that refines current partition to 2 subsets.
Arc [16:1*[$m, 1]] contains constants of sort STAGE
Transition T_poll__iAmPrimary : constants on arcs in [[16:1*[$m, 1]]] introduces in STAGE(3) partition with 1 elements that refines current partition to 3 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :NEGSTEP
Arc [8:1*[$m, $r, 1]] contains constants of sort NEGSTEP
Transition T_poll__handleAI1 : constants on arcs in [[8:1*[$m, $r, 1]]] introduces in NEGSTEP(3) partition with 1 elements that refines current partition to 2 subsets.
Arc [8:1*[$m, $r, 2]] contains constants of sort NEGSTEP
Transition T_poll__handleAI1 : constants on arcs in [[8:1*[$m, $r, 2]]] introduces in NEGSTEP(3) partition with 1 elements that refines current partition to 3 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :BOOL
Arc [7:1*[$m, 0, $pm]] contains constants of sort BOOL
Transition T_poll__handleAI2 : constants on arcs in [[7:1*[$m, 0, $pm]]] introduces in BOOL(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-26 01:04:16] [INFO ] Unfolded HLPN to a Petri net with 1830 places and 1984 transitions 11141 arcs in 62 ms.
[2024-05-26 01:04:16] [INFO ] Unfolded 6 HLPN properties in 1 ms.
Deduced a syphon composed of 1687 places in 6 ms
Reduce places removed 1703 places and 1857 transitions.
Reduce places removed 5 places and 0 transitions.
Support contains 76 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 127/127 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 110 transition count 127
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 20 place count 102 transition count 91
Iterating global reduction 1 with 8 rules applied. Total rules applied 28 place count 102 transition count 91
Applied a total of 28 rules in 11 ms. Remains 102 /122 variables (removed 20) and now considering 91/127 (removed 36) transitions.
[2024-05-26 01:04:16] [INFO ] Flow matrix only has 82 transitions (discarded 9 similar events)
// Phase 1: matrix 82 rows 102 cols
[2024-05-26 01:04:16] [INFO ] Computed 23 invariants in 7 ms
[2024-05-26 01:04:16] [INFO ] Implicit Places using invariants in 172 ms returned [10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 176 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 86/122 places, 91/127 transitions.
Applied a total of 0 rules in 1 ms. Remains 86 /86 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 188 ms. Remains : 86/122 places, 91/127 transitions.
Support contains 76 out of 86 places after structural reductions.
[2024-05-26 01:04:16] [INFO ] Flatten gal took : 12 ms
[2024-05-26 01:04:16] [INFO ] Flatten gal took : 11 ms
[2024-05-26 01:04:16] [INFO ] Input system was already deterministic with 91 transitions.
Incomplete random walk after 10000 steps, including 59 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 10) seen :9
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-26 01:04:16] [INFO ] Flow matrix only has 82 transitions (discarded 9 similar events)
// Phase 1: matrix 82 rows 86 cols
[2024-05-26 01:04:16] [INFO ] Computed 7 invariants in 8 ms
[2024-05-26 01:04:16] [INFO ] After 27ms 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 6 simplifications.
Computed a total of 86 stabilizing places and 91 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 86 transition count 91
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' '!(F(G(p0)))'
Support contains 4 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 91/91 transitions.
Reduce places removed 4 places and 4 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 72 transition count 74
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 72 transition count 74
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 36 place count 64 transition count 66
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 60 transition count 62
Applied a total of 40 rules in 24 ms. Remains 60 /86 variables (removed 26) and now considering 62/91 (removed 29) transitions.
[2024-05-26 01:04:17] [INFO ] Flow matrix only has 53 transitions (discarded 9 similar events)
// Phase 1: matrix 53 rows 60 cols
[2024-05-26 01:04:17] [INFO ] Computed 7 invariants in 1 ms
[2024-05-26 01:04:17] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-26 01:04:17] [INFO ] Flow matrix only has 53 transitions (discarded 9 similar events)
[2024-05-26 01:04:17] [INFO ] Invariant cache hit.
[2024-05-26 01:04:17] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-26 01:04:17] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2024-05-26 01:04:17] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-26 01:04:17] [INFO ] Flow matrix only has 53 transitions (discarded 9 similar events)
[2024-05-26 01:04:17] [INFO ] Invariant cache hit.
[2024-05-26 01:04:17] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/86 places, 62/91 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 252 ms. Remains : 60/86 places, 62/91 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 219 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-COL-4-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ (ADD s56 s57 s58 s59) 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 653 reset in 297 ms.
Product exploration explored 100000 steps with 653 reset in 221 ms.
Computed a total of 60 stabilizing places and 62 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 60 transition count 62
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (NOT p0)), (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 35 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-4-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-4-LTLCardinality-04 finished in 1160 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((p0&&G(F(p1)))))'
Support contains 52 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 91/91 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 82 transition count 87
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 82 transition count 87
Applied a total of 8 rules in 6 ms. Remains 82 /86 variables (removed 4) and now considering 87/91 (removed 4) transitions.
[2024-05-26 01:04:18] [INFO ] Flow matrix only has 78 transitions (discarded 9 similar events)
// Phase 1: matrix 78 rows 82 cols
[2024-05-26 01:04:18] [INFO ] Computed 7 invariants in 2 ms
[2024-05-26 01:04:18] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-26 01:04:18] [INFO ] Flow matrix only has 78 transitions (discarded 9 similar events)
[2024-05-26 01:04:18] [INFO ] Invariant cache hit.
[2024-05-26 01:04:18] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-26 01:04:18] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2024-05-26 01:04:18] [INFO ] Flow matrix only has 78 transitions (discarded 9 similar events)
[2024-05-26 01:04:18] [INFO ] Invariant cache hit.
[2024-05-26 01:04:18] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 82/86 places, 87/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 177 ms. Remains : 82/86 places, 87/91 transitions.
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : NeoElection-COL-4-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 2 (ADD s0 s1 s2 s3)), p1:(LEQ 12 (ADD s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 291 steps with 4 reset in 4 ms.
FORMULA NeoElection-COL-4-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-4-LTLCardinality-05 finished in 382 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 48 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 91/91 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 82 transition count 87
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 82 transition count 87
Applied a total of 8 rules in 3 ms. Remains 82 /86 variables (removed 4) and now considering 87/91 (removed 4) transitions.
[2024-05-26 01:04:18] [INFO ] Flow matrix only has 78 transitions (discarded 9 similar events)
[2024-05-26 01:04:18] [INFO ] Invariant cache hit.
[2024-05-26 01:04:18] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-26 01:04:18] [INFO ] Flow matrix only has 78 transitions (discarded 9 similar events)
[2024-05-26 01:04:18] [INFO ] Invariant cache hit.
[2024-05-26 01:04:18] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-26 01:04:18] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2024-05-26 01:04:18] [INFO ] Flow matrix only has 78 transitions (discarded 9 similar events)
[2024-05-26 01:04:18] [INFO ] Invariant cache hit.
[2024-05-26 01:04:18] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 82/86 places, 87/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 156 ms. Remains : 82/86 places, 87/91 transitions.
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-4-LTLCardinality-10 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 2 (ADD s10 s11 s12 s13 s14 s15 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 ...], 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 6 steps with 0 reset in 0 ms.
FORMULA NeoElection-COL-4-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-4-LTLCardinality-10 finished in 243 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(p1))))'
Support contains 4 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 91/91 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 86 transition count 87
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 82 transition count 87
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 82 transition count 83
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 78 transition count 83
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 26 place count 68 transition count 70
Iterating global reduction 2 with 10 rules applied. Total rules applied 36 place count 68 transition count 70
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 36 place count 68 transition count 66
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 44 place count 64 transition count 66
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 60 place count 56 transition count 58
Applied a total of 60 rules in 19 ms. Remains 56 /86 variables (removed 30) and now considering 58/91 (removed 33) transitions.
[2024-05-26 01:04:18] [INFO ] Flow matrix only has 49 transitions (discarded 9 similar events)
// Phase 1: matrix 49 rows 56 cols
[2024-05-26 01:04:18] [INFO ] Computed 7 invariants in 1 ms
[2024-05-26 01:04:18] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-26 01:04:18] [INFO ] Flow matrix only has 49 transitions (discarded 9 similar events)
[2024-05-26 01:04:18] [INFO ] Invariant cache hit.
[2024-05-26 01:04:18] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-26 01:04:18] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2024-05-26 01:04:18] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-26 01:04:18] [INFO ] Flow matrix only has 49 transitions (discarded 9 similar events)
[2024-05-26 01:04:18] [INFO ] Invariant cache hit.
[2024-05-26 01:04:19] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/86 places, 58/91 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 217 ms. Remains : 56/86 places, 58/91 transitions.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NeoElection-COL-4-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 3 (ADD s0 s1 s2 s3)), p1:(LEQ (ADD s0 s1 s2 s3) 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1886 reset in 190 ms.
Product exploration explored 100000 steps with 1886 reset in 197 ms.
Computed a total of 56 stabilizing places and 58 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 56 transition count 58
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 14 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-4-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-4-LTLCardinality-11 finished in 778 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) U G(p1))))'
Support contains 64 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 91/91 transitions.
Applied a total of 0 rules in 1 ms. Remains 86 /86 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2024-05-26 01:04:19] [INFO ] Flow matrix only has 82 transitions (discarded 9 similar events)
// Phase 1: matrix 82 rows 86 cols
[2024-05-26 01:04:19] [INFO ] Computed 7 invariants in 1 ms
[2024-05-26 01:04:19] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-26 01:04:19] [INFO ] Flow matrix only has 82 transitions (discarded 9 similar events)
[2024-05-26 01:04:19] [INFO ] Invariant cache hit.
[2024-05-26 01:04:19] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-26 01:04:19] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2024-05-26 01:04:19] [INFO ] Flow matrix only has 82 transitions (discarded 9 similar events)
[2024-05-26 01:04:19] [INFO ] Invariant cache hit.
[2024-05-26 01:04:19] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 211 ms. Remains : 86/86 places, 91/91 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : NeoElection-COL-4-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ (ADD s10 s11 s12 s13 s14 s15 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 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3079 reset in 196 ms.
Product exploration explored 100000 steps with 3076 reset in 198 ms.
Computed a total of 86 stabilizing places and 91 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 86 transition count 91
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 262 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 289 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p1)]
Support contains 48 out of 86 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 : 86/86 places, 91/91 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 86 transition count 87
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 82 transition count 87
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 78 transition count 83
Applied a total of 16 rules in 14 ms. Remains 78 /86 variables (removed 8) and now considering 83/91 (removed 8) transitions.
[2024-05-26 01:04:21] [INFO ] Flow matrix only has 74 transitions (discarded 9 similar events)
// Phase 1: matrix 74 rows 78 cols
[2024-05-26 01:04:21] [INFO ] Computed 7 invariants in 1 ms
[2024-05-26 01:04:21] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-26 01:04:21] [INFO ] Flow matrix only has 74 transitions (discarded 9 similar events)
[2024-05-26 01:04:21] [INFO ] Invariant cache hit.
[2024-05-26 01:04:21] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-26 01:04:21] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2024-05-26 01:04:21] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-26 01:04:21] [INFO ] Flow matrix only has 74 transitions (discarded 9 similar events)
[2024-05-26 01:04:21] [INFO ] Invariant cache hit.
[2024-05-26 01:04:21] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 78/86 places, 83/91 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 171 ms. Remains : 78/86 places, 83/91 transitions.
Computed a total of 78 stabilizing places and 83 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 78 transition count 83
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 : [p1, (X p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1, (X p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 166 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Product exploration explored 100000 steps with 1449 reset in 280 ms.
Product exploration explored 100000 steps with 1449 reset in 278 ms.
Built C files in :
/tmp/ltsmin6667639793408165925
[2024-05-26 01:04:22] [INFO ] Computing symmetric may disable matrix : 83 transitions.
[2024-05-26 01:04:22] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 01:04:22] [INFO ] Computing symmetric may enable matrix : 83 transitions.
[2024-05-26 01:04:22] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 01:04:22] [INFO ] Computing Do-Not-Accords matrix : 83 transitions.
[2024-05-26 01:04:22] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 01:04:22] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6667639793408165925
Running compilation step : cd /tmp/ltsmin6667639793408165925;'/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 355 ms.
Running link step : cd /tmp/ltsmin6667639793408165925;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin6667639793408165925;'/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/stateBased16934171859306876954.hoa' '--buchi-type=spotba'
LTSmin run took 3467 ms.
FORMULA NeoElection-COL-4-LTLCardinality-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property NeoElection-COL-4-LTLCardinality-12 finished in 6634 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(!p1))))'
Support contains 64 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 91/91 transitions.
Applied a total of 0 rules in 1 ms. Remains 86 /86 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2024-05-26 01:04:26] [INFO ] Flow matrix only has 82 transitions (discarded 9 similar events)
// Phase 1: matrix 82 rows 86 cols
[2024-05-26 01:04:26] [INFO ] Computed 7 invariants in 1 ms
[2024-05-26 01:04:26] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-26 01:04:26] [INFO ] Flow matrix only has 82 transitions (discarded 9 similar events)
[2024-05-26 01:04:26] [INFO ] Invariant cache hit.
[2024-05-26 01:04:26] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-26 01:04:26] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2024-05-26 01:04:26] [INFO ] Flow matrix only has 82 transitions (discarded 9 similar events)
[2024-05-26 01:04:26] [INFO ] Invariant cache hit.
[2024-05-26 01:04:26] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 141 ms. Remains : 86/86 places, 91/91 transitions.
Stuttering acceptance computed with spot in 125 ms :[p1, true, (OR (NOT p0) p1), (OR (NOT p0) p1)]
Running random walk in product with property : NeoElection-COL-4-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=p1, acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(GT 1 (ADD s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85)), p0:(GT 1 (ADD s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 39 steps with 0 reset in 0 ms.
FORMULA NeoElection-COL-4-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-4-LTLCardinality-14 finished in 284 ms.
All properties solved by simple procedures.
Total runtime 11281 ms.

BK_STOP 1716685467912

--------------------
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-4"
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-4, 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-171654372500287"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NeoElection-COL-4.tgz
mv NeoElection-COL-4 execution
cd execution
if [ "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 ;