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.r246-tall-171654351700484.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 itstools
Input is NeoElection-COL-7, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-tall-171654351700484
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 11K Apr 11 19:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Apr 11 19:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 11 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 11 18:54 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.7K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 21:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 11 21:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 20:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 20:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 108K 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-7-LTLFireability-00
FORMULA_NAME NeoElection-COL-7-LTLFireability-01
FORMULA_NAME NeoElection-COL-7-LTLFireability-02
FORMULA_NAME NeoElection-COL-7-LTLFireability-03
FORMULA_NAME NeoElection-COL-7-LTLFireability-04
FORMULA_NAME NeoElection-COL-7-LTLFireability-05
FORMULA_NAME NeoElection-COL-7-LTLFireability-06
FORMULA_NAME NeoElection-COL-7-LTLFireability-07
FORMULA_NAME NeoElection-COL-7-LTLFireability-08
FORMULA_NAME NeoElection-COL-7-LTLFireability-09
FORMULA_NAME NeoElection-COL-7-LTLFireability-10
FORMULA_NAME NeoElection-COL-7-LTLFireability-11
FORMULA_NAME NeoElection-COL-7-LTLFireability-12
FORMULA_NAME NeoElection-COL-7-LTLFireability-13
FORMULA_NAME NeoElection-COL-7-LTLFireability-14
FORMULA_NAME NeoElection-COL-7-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716684220132

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeoElection-COL-7
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202405141337
[2024-05-26 00:43:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 00:43:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 00:43:41] [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 00:43:41] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-26 00:43:41] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 617 ms
[2024-05-26 00:43:42] [INFO ] Detected 6 constant HL places corresponding to 3552 PT places.
[2024-05-26 00:43:42] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 7128 PT places and 22272.0 transition bindings in 31 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2024-05-26 00:43:42] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 5 ms.
[2024-05-26 00:43:42] [INFO ] Skeletonized 9 HLPN properties in 2 ms. Removed 7 properties that had guard overlaps.
Initial state reduction rules removed 1 formulas.
FORMULA NeoElection-COL-7-LTLFireability-10 FALSE 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 8 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-7-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 2 stable transitions
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 184 steps (4 resets) in 7 ms. (23 steps per ms) remains 0/3 properties
[2024-05-26 00:43:42] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-05-26 00:43:42] [INFO ] Flatten gal took : 38 ms
FORMULA NeoElection-COL-7-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-26 00:43:42] [INFO ] Flatten gal took : 2 ms
Domain [M(8), POS(7), M(8)] of place P_masterList breaks symmetries in sort M
Arc [15:1*[$m, (MOD (ADD $i 1) 7)]] contains successor/predecessor on variables of sort POS
Symmetric sort wr.t. initial and guards and successors and join/free detected :MT
Arc [9:1*[$m, $s, 3, 0]] contains constants of sort MT
Transition T_poll__handleAI1 : constants on arcs in [[9:1*[$m, $s, 3, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 2 subsets.
Arc [9:1*[$m, $s, 3, 0]] contains constants of sort MT
Transition T_poll__handleAI2 : constants on arcs in [[9:1*[$m, $s, 3, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 2 subsets.
Arc [9:1*[$m, $s, 4, 0]] contains constants of sort MT
Transition T_poll__handleAnnP1 : constants on arcs in [[9:1*[$m, $s, 4, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 3 subsets.
Arc [9:1*[$m, $s, 4, 0]] contains constants of sort MT
Transition T_poll__handleAnnP2 : constants on arcs in [[9:1*[$m, $s, 4, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 3 subsets.
Arc [9:1*[$m, $s, 1, 0]] contains constants of sort MT
Transition T_poll__handleAnsP1 : constants on arcs in [[9:1*[$m, $s, 1, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 4 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP1 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP2 : constants on arcs in [[9:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP2 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP3 : constants on arcs in [[9:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [11:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP4 : constants on arcs in [[11:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP4 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 0, 0]] contains constants of sort MT
Transition T_poll__handleAskP : constants on arcs in [[9:1*[$m, $s, 0, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 6 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :STAGE
Arc [16:1*[$m, 0]] contains constants of sort STAGE
Transition T_poll__iAmPrimary : constants on arcs in [[16:1*[$m, 0]]] introduces in STAGE(3) partition with 1 elements that refines current partition to 2 subsets.
Arc [16:1*[$m, 1]] contains constants of sort STAGE
Transition T_poll__iAmPrimary : constants on arcs in [[16:1*[$m, 1]]] introduces in STAGE(3) partition with 1 elements that refines current partition to 3 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :NEGSTEP
Arc [8:1*[$m, $r, 1]] contains constants of sort NEGSTEP
Transition T_poll__handleAI1 : constants on arcs in [[8:1*[$m, $r, 1]]] introduces in NEGSTEP(3) partition with 1 elements that refines current partition to 2 subsets.
Arc [8:1*[$m, $r, 2]] contains constants of sort NEGSTEP
Transition T_poll__handleAI1 : constants on arcs in [[8:1*[$m, $r, 2]]] introduces in NEGSTEP(3) partition with 1 elements that refines current partition to 3 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :BOOL
Arc [7:1*[$m, 0, $pm]] contains constants of sort BOOL
Transition T_poll__handleAI2 : constants on arcs in [[7:1*[$m, 0, $pm]]] introduces in BOOL(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-26 00:43:42] [INFO ] Unfolded HLPN to a Petri net with 7128 places and 12460 transitions 70880 arcs in 174 ms.
[2024-05-26 00:43:42] [INFO ] Unfolded 11 HLPN properties in 7 ms.
Deduced a syphon composed of 6688 places in 28 ms
Reduce places removed 6737 places and 11850 transitions.
Reduce places removed 8 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA NeoElection-COL-7-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 293 out of 383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 383/383 places, 610/610 transitions.
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 341 transition count 610
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 62 place count 321 transition count 420
Iterating global reduction 1 with 20 rules applied. Total rules applied 82 place count 321 transition count 420
Applied a total of 82 rules in 24 ms. Remains 321 /383 variables (removed 62) and now considering 420/610 (removed 190) transitions.
[2024-05-26 00:43:42] [INFO ] Flow matrix only has 384 transitions (discarded 36 similar events)
// Phase 1: matrix 384 rows 321 cols
[2024-05-26 00:43:42] [INFO ] Computed 62 invariants in 33 ms
[2024-05-26 00:43:43] [INFO ] Implicit Places using invariants in 246 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 329 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 320/383 places, 420/610 transitions.
Applied a total of 0 rules in 3 ms. Remains 320 /320 variables (removed 0) and now considering 420/420 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 365 ms. Remains : 320/383 places, 420/610 transitions.
Support contains 293 out of 320 places after structural reductions.
[2024-05-26 00:43:43] [INFO ] Flatten gal took : 56 ms
[2024-05-26 00:43:43] [INFO ] Flatten gal took : 63 ms
[2024-05-26 00:43:43] [INFO ] Input system was already deterministic with 420 transitions.
RANDOM walk for 703 steps (0 resets) in 141 ms. (4 steps per ms) remains 0/6 properties
Computed a total of 320 stabilizing places and 420 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 320 transition count 420
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.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 63 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 420/420 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 313 transition count 413
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 313 transition count 413
Applied a total of 14 rules in 28 ms. Remains 313 /320 variables (removed 7) and now considering 413/420 (removed 7) transitions.
[2024-05-26 00:43:43] [INFO ] Flow matrix only has 377 transitions (discarded 36 similar events)
// Phase 1: matrix 377 rows 313 cols
[2024-05-26 00:43:43] [INFO ] Computed 61 invariants in 5 ms
[2024-05-26 00:43:43] [INFO ] Implicit Places using invariants in 226 ms returned [19, 20, 21, 22, 23, 24, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95]
Discarding 42 places :
Implicit Place search using SMT only with invariants took 231 ms to find 42 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 271/320 places, 413/420 transitions.
Applied a total of 0 rules in 5 ms. Remains 271 /271 variables (removed 0) and now considering 413/413 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 264 ms. Remains : 271/320 places, 413/420 transitions.
Stuttering acceptance computed with spot in 192 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-7-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA NeoElection-COL-7-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-7-LTLFireability-03 finished in 520 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 49 out of 320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 320/320 places, 420/420 transitions.
Reduce places removed 7 places and 7 transitions.
Ensure Unique test removed 7 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 306 transition count 413
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 7 place count 306 transition count 406
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 21 place count 299 transition count 406
Discarding 52 places :
Symmetric choice reduction at 1 with 52 rule applications. Total rules 73 place count 247 transition count 229
Iterating global reduction 1 with 52 rules applied. Total rules applied 125 place count 247 transition count 229
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 1 with 7 rules applied. Total rules applied 132 place count 240 transition count 222
Ensure Unique test removed 7 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 139 place count 233 transition count 222
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 146 place count 226 transition count 215
Ensure Unique test removed 7 places
Iterating post reduction 2 with 7 rules applied. Total rules applied 153 place count 219 transition count 215
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 160 place count 212 transition count 208
Ensure Unique test removed 7 places
Iterating post reduction 3 with 7 rules applied. Total rules applied 167 place count 205 transition count 208
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 4 with 7 rules applied. Total rules applied 174 place count 198 transition count 201
Ensure Unique test removed 7 places
Iterating post reduction 4 with 7 rules applied. Total rules applied 181 place count 191 transition count 201
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 5 with 7 rules applied. Total rules applied 188 place count 184 transition count 194
Ensure Unique test removed 7 places
Iterating post reduction 5 with 7 rules applied. Total rules applied 195 place count 177 transition count 194
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 6 with 7 rules applied. Total rules applied 202 place count 170 transition count 187
Applied a total of 202 rules in 86 ms. Remains 170 /320 variables (removed 150) and now considering 187/420 (removed 233) transitions.
[2024-05-26 00:43:44] [INFO ] Flow matrix only has 151 transitions (discarded 36 similar events)
// Phase 1: matrix 151 rows 170 cols
[2024-05-26 00:43:44] [INFO ] Computed 19 invariants in 3 ms
[2024-05-26 00:43:44] [INFO ] Implicit Places using invariants in 108 ms returned [12, 13, 14, 15, 16, 17]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 114 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 164/320 places, 187/420 transitions.
Applied a total of 0 rules in 6 ms. Remains 164 /164 variables (removed 0) and now considering 187/187 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 207 ms. Remains : 164/320 places, 187/420 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-7-LTLFireability-04
Product exploration explored 100000 steps with 12456 reset in 637 ms.
Product exploration explored 100000 steps with 12474 reset in 581 ms.
Computed a total of 164 stabilizing places and 187 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 164 transition count 187
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 18 steps (0 resets) in 5 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Property proved to be false thanks to negative knowledge :(F p0)
Knowledge based reduction with 4 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-7-LTLFireability-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-7-LTLFireability-04 finished in 1895 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 7 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 420/420 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 275 transition count 250
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 275 transition count 250
Applied a total of 90 rules in 8 ms. Remains 275 /320 variables (removed 45) and now considering 250/420 (removed 170) transitions.
[2024-05-26 00:43:46] [INFO ] Flow matrix only has 214 transitions (discarded 36 similar events)
// Phase 1: matrix 214 rows 275 cols
[2024-05-26 00:43:46] [INFO ] Computed 61 invariants in 10 ms
[2024-05-26 00:43:46] [INFO ] Implicit Places using invariants in 172 ms returned [19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66]
Discarding 48 places :
Implicit Place search using SMT only with invariants took 174 ms to find 48 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 227/320 places, 250/420 transitions.
Applied a total of 0 rules in 2 ms. Remains 227 /227 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 184 ms. Remains : 227/320 places, 250/420 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-7-LTLFireability-06
Entered a terminal (fully accepting) state of product in 32 steps with 0 reset in 0 ms.
FORMULA NeoElection-COL-7-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-7-LTLFireability-06 finished in 315 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!(p0 U (G(p0)||!p1))&&p0)))'
Support contains 103 out of 320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 320/320 places, 420/420 transitions.
Reduce places removed 7 places and 7 transitions.
Ensure Unique test removed 7 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 306 transition count 413
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 7 place count 306 transition count 406
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 21 place count 299 transition count 406
Discarding 52 places :
Symmetric choice reduction at 1 with 52 rule applications. Total rules 73 place count 247 transition count 229
Iterating global reduction 1 with 52 rules applied. Total rules applied 125 place count 247 transition count 229
Applied a total of 125 rules in 24 ms. Remains 247 /320 variables (removed 73) and now considering 229/420 (removed 191) transitions.
[2024-05-26 00:43:46] [INFO ] Flow matrix only has 193 transitions (discarded 36 similar events)
// Phase 1: matrix 193 rows 247 cols
[2024-05-26 00:43:46] [INFO ] Computed 54 invariants in 3 ms
[2024-05-26 00:43:46] [INFO ] Implicit Places using invariants in 112 ms returned [12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52]
Discarding 41 places :
Implicit Place search using SMT only with invariants took 114 ms to find 41 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 206/320 places, 229/420 transitions.
Applied a total of 0 rules in 4 ms. Remains 206 /206 variables (removed 0) and now considering 229/229 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 143 ms. Remains : 206/320 places, 229/420 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (OR (NOT p1) p0)]
Running random walk in product with property : NeoElection-COL-7-LTLFireability-07
Product exploration explored 100000 steps with 700 reset in 1166 ms.
Product exploration explored 100000 steps with 686 reset in 1102 ms.
Computed a total of 206 stabilizing places and 229 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 206 transition count 229
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 179 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[true, (OR (NOT p1) p0)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 228 steps (0 resets) in 21 ms. (10 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 11 factoid took 263 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[true, (OR (NOT p1) p0)]
Stuttering acceptance computed with spot in 84 ms :[true, (OR (NOT p1) p0)]
[2024-05-26 00:43:49] [INFO ] Flow matrix only has 193 transitions (discarded 36 similar events)
// Phase 1: matrix 193 rows 206 cols
[2024-05-26 00:43:49] [INFO ] Computed 13 invariants in 4 ms
Proved EG true
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) (NOT p1)))), true]
Knowledge based reduction with 11 factoid took 299 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[true, (OR (NOT p1) p0)]
Support contains 103 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 229/229 transitions.
Applied a total of 0 rules in 11 ms. Remains 206 /206 variables (removed 0) and now considering 229/229 (removed 0) transitions.
[2024-05-26 00:43:50] [INFO ] Flow matrix only has 193 transitions (discarded 36 similar events)
[2024-05-26 00:43:50] [INFO ] Invariant cache hit.
[2024-05-26 00:43:50] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-26 00:43:50] [INFO ] Flow matrix only has 193 transitions (discarded 36 similar events)
[2024-05-26 00:43:50] [INFO ] Invariant cache hit.
[2024-05-26 00:43:50] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-26 00:43:50] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2024-05-26 00:43:50] [INFO ] Redundant transitions in 7 ms returned []
Running 222 sub problems to find dead transitions.
[2024-05-26 00:43:50] [INFO ] Flow matrix only has 193 transitions (discarded 36 similar events)
[2024-05-26 00:43:50] [INFO ] Invariant cache hit.
[2024-05-26 00:43:50] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (OVERLAPS) 7/206 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Problem TDEAD11 is UNSAT
At refinement iteration 4 (OVERLAPS) 193/399 variables, 206/219 constraints. Problems are: Problem set: 1 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 6/225 constraints. Problems are: Problem set: 1 solved, 221 unsolved
[2024-05-26 00:43:54] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 7 ms to minimize.
[2024-05-26 00:43:54] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 2 ms to minimize.
[2024-05-26 00:43:54] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-05-26 00:43:54] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-26 00:43:55] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-26 00:43:55] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 0 ms to minimize.
[2024-05-26 00:43:55] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-26 00:43:55] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 1 ms to minimize.
[2024-05-26 00:43:55] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
[2024-05-26 00:43:55] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2024-05-26 00:43:55] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 1 ms to minimize.
[2024-05-26 00:43:55] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-05-26 00:43:55] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
[2024-05-26 00:43:55] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 1 ms to minimize.
[2024-05-26 00:43:55] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 1 ms to minimize.
[2024-05-26 00:43:55] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 2 ms to minimize.
[2024-05-26 00:43:55] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-05-26 00:43:55] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-05-26 00:43:55] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-05-26 00:43:56] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 20/245 constraints. Problems are: Problem set: 1 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 0/245 constraints. Problems are: Problem set: 1 solved, 221 unsolved
[2024-05-26 00:43:59] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 2 ms to minimize.
[2024-05-26 00:43:59] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/399 variables, 2/247 constraints. Problems are: Problem set: 1 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 0/247 constraints. Problems are: Problem set: 1 solved, 221 unsolved
At refinement iteration 10 (OVERLAPS) 0/399 variables, 0/247 constraints. Problems are: Problem set: 1 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 399/399 variables, and 247 constraints, problems are : Problem set: 1 solved, 221 unsolved in 12255 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 206/206 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 1 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 7/206 variables, 7/13 constraints. Problems are: Problem set: 1 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 22/35 constraints. Problems are: Problem set: 1 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/35 constraints. Problems are: Problem set: 1 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 193/399 variables, 206/241 constraints. Problems are: Problem set: 1 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 6/247 constraints. Problems are: Problem set: 1 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 221/468 constraints. Problems are: Problem set: 1 solved, 221 unsolved
[2024-05-26 00:44:07] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-26 00:44:07] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-26 00:44:07] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-26 00:44:07] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-26 00:44:07] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-26 00:44:07] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 1 ms to minimize.
[2024-05-26 00:44:07] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-05-26 00:44:08] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 8/476 constraints. Problems are: Problem set: 1 solved, 221 unsolved
[2024-05-26 00:44:11] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2024-05-26 00:44:11] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 2 ms to minimize.
[2024-05-26 00:44:11] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
[2024-05-26 00:44:11] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
[2024-05-26 00:44:11] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 1 ms to minimize.
[2024-05-26 00:44:11] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 6/482 constraints. Problems are: Problem set: 1 solved, 221 unsolved
[2024-05-26 00:44:14] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 1/483 constraints. Problems are: Problem set: 1 solved, 221 unsolved
[2024-05-26 00:44:18] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2024-05-26 00:44:18] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 2/485 constraints. Problems are: Problem set: 1 solved, 221 unsolved
[2024-05-26 00:44:21] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2024-05-26 00:44:21] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2024-05-26 00:44:21] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-05-26 00:44:21] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2024-05-26 00:44:21] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-05-26 00:44:21] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/399 variables, 6/491 constraints. Problems are: Problem set: 1 solved, 221 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/399 variables, 0/491 constraints. Problems are: Problem set: 1 solved, 221 unsolved
At refinement iteration 14 (OVERLAPS) 0/399 variables, 0/491 constraints. Problems are: Problem set: 1 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 399/399 variables, and 491 constraints, problems are : Problem set: 1 solved, 221 unsolved in 28603 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 206/206 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 221/222 constraints, Known Traps: 45/45 constraints]
After SMT, in 41015ms problems are : Problem set: 1 solved, 221 unsolved
Search for dead transitions found 1 dead transitions in 41026ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 206/206 places, 228/229 transitions.
Applied a total of 0 rules in 10 ms. Remains 206 /206 variables (removed 0) and now considering 228/228 (removed 0) transitions.
[2024-05-26 00:44:31] [INFO ] Redundant transitions in 9 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 41237 ms. Remains : 206/206 places, 228/229 transitions.
Computed a total of 206 stabilizing places and 228 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 206 transition count 228
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 116 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[true, (OR (NOT p1) p0)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 256 steps (0 resets) in 17 ms. (14 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 11 factoid took 249 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[true, (OR (NOT p1) p0)]
Stuttering acceptance computed with spot in 87 ms :[true, (OR (NOT p1) p0)]
[2024-05-26 00:44:32] [INFO ] Flow matrix only has 192 transitions (discarded 36 similar events)
// Phase 1: matrix 192 rows 206 cols
[2024-05-26 00:44:32] [INFO ] Computed 14 invariants in 1 ms
Proved EG true
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) (NOT p1)))), true]
Knowledge based reduction with 11 factoid took 340 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[true, (OR (NOT p1) p0)]
Stuttering acceptance computed with spot in 81 ms :[true, (OR (NOT p1) p0)]
Product exploration explored 100000 steps with 688 reset in 1095 ms.
Product exploration explored 100000 steps with 696 reset in 1111 ms.
Built C files in :
/tmp/ltsmin16061574691440094338
[2024-05-26 00:44:35] [INFO ] Computing symmetric may disable matrix : 228 transitions.
[2024-05-26 00:44:35] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 00:44:35] [INFO ] Computing symmetric may enable matrix : 228 transitions.
[2024-05-26 00:44:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 00:44:35] [INFO ] Computing Do-Not-Accords matrix : 228 transitions.
[2024-05-26 00:44:35] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 00:44:35] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16061574691440094338
Running compilation step : cd /tmp/ltsmin16061574691440094338;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 827 ms.
Running link step : cd /tmp/ltsmin16061574691440094338;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin16061574691440094338;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3988424916048482695.hoa' '--buchi-type=spotba'
LTSmin run took 741 ms.
FORMULA NeoElection-COL-7-LTLFireability-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property NeoElection-COL-7-LTLFireability-07 finished in 50354 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U X(G(p0)))&&(F(G(!p0)) U p0))))'
Support contains 49 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 420/420 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 268 transition count 243
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 268 transition count 243
Applied a total of 104 rules in 8 ms. Remains 268 /320 variables (removed 52) and now considering 243/420 (removed 177) transitions.
[2024-05-26 00:44:36] [INFO ] Flow matrix only has 207 transitions (discarded 36 similar events)
// Phase 1: matrix 207 rows 268 cols
[2024-05-26 00:44:36] [INFO ] Computed 61 invariants in 2 ms
[2024-05-26 00:44:36] [INFO ] Implicit Places using invariants in 136 ms returned [19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66]
Discarding 48 places :
Implicit Place search using SMT only with invariants took 142 ms to find 48 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 220/320 places, 243/420 transitions.
Applied a total of 0 rules in 1 ms. Remains 220 /220 variables (removed 0) and now considering 243/243 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 151 ms. Remains : 220/320 places, 243/420 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : NeoElection-COL-7-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NeoElection-COL-7-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-7-LTLFireability-14 finished in 331 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 84 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 420/420 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 268 transition count 243
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 268 transition count 243
Applied a total of 104 rules in 6 ms. Remains 268 /320 variables (removed 52) and now considering 243/420 (removed 177) transitions.
[2024-05-26 00:44:37] [INFO ] Flow matrix only has 207 transitions (discarded 36 similar events)
[2024-05-26 00:44:37] [INFO ] Invariant cache hit.
[2024-05-26 00:44:37] [INFO ] Implicit Places using invariants in 114 ms returned [26, 33, 40, 47, 54, 61]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 115 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 262/320 places, 243/420 transitions.
Applied a total of 0 rules in 2 ms. Remains 262 /262 variables (removed 0) and now considering 243/243 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 123 ms. Remains : 262/320 places, 243/420 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : NeoElection-COL-7-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 256 ms.
Product exploration explored 100000 steps with 50000 reset in 270 ms.
Computed a total of 262 stabilizing places and 243 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 262 transition count 243
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 20 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-7-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-7-LTLFireability-15 finished in 870 ms.
All properties solved by simple procedures.
Total runtime 56684 ms.

BK_STOP 1716684278321

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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-7"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is NeoElection-COL-7, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r246-tall-171654351700484"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NeoElection-COL-7.tgz
mv NeoElection-COL-7 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;