About the Execution of GreatSPN+red for NeoElection-COL-6
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
494.323 | 12387.00 | 25187.00 | 102.50 | TFFFFTTFTFTFTFFF | normal |
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.r245-tall-171654350000476.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 greatspnxred
Input is NeoElection-COL-6, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-171654350000476
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 8.4K Apr 11 19:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 11 19:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 11 19:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 11 19:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Apr 23 07:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 21:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Apr 11 21:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 20:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 11 20:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 98K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME NeoElection-COL-6-LTLFireability-00
FORMULA_NAME NeoElection-COL-6-LTLFireability-01
FORMULA_NAME NeoElection-COL-6-LTLFireability-02
FORMULA_NAME NeoElection-COL-6-LTLFireability-03
FORMULA_NAME NeoElection-COL-6-LTLFireability-04
FORMULA_NAME NeoElection-COL-6-LTLFireability-05
FORMULA_NAME NeoElection-COL-6-LTLFireability-06
FORMULA_NAME NeoElection-COL-6-LTLFireability-07
FORMULA_NAME NeoElection-COL-6-LTLFireability-08
FORMULA_NAME NeoElection-COL-6-LTLFireability-09
FORMULA_NAME NeoElection-COL-6-LTLFireability-10
FORMULA_NAME NeoElection-COL-6-LTLFireability-11
FORMULA_NAME NeoElection-COL-6-LTLFireability-12
FORMULA_NAME NeoElection-COL-6-LTLFireability-13
FORMULA_NAME NeoElection-COL-6-LTLFireability-14
FORMULA_NAME NeoElection-COL-6-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716670252073
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeoElection-COL-6
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 20:50:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-25 20:50:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 20:50:53] [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-25 20:50:53] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 20:50:54] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 682 ms
[2024-05-25 20:50:54] [INFO ] Detected 6 constant HL places corresponding to 2380 PT places.
[2024-05-25 20:50:54] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 4830 PT places and 13580.0 transition bindings in 34 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
[2024-05-25 20:50:54] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 5 ms.
[2024-05-25 20:50:54] [INFO ] Skeletonized 12 HLPN properties in 1 ms. Removed 4 properties that had guard overlaps.
Initial state reduction rules removed 1 formulas.
FORMULA NeoElection-COL-6-LTLFireability-04 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.4 ms
Remains 9 properties that can be checked using skeleton over-approximation.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 12 places and 7 transitions.
Ensure Unique test removed 8 transitions
Reduce redundant transitions removed 8 transitions.
FORMULA NeoElection-COL-6-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 2 stable transitions
RANDOM walk for 209 steps (5 resets) in 11 ms. (17 steps per ms) remains 0/4 properties
[2024-05-25 20:50:54] [INFO ] Flatten gal took : 12 ms
[2024-05-25 20:50:54] [INFO ] Flatten gal took : 1 ms
Domain [M(7), POS(6), M(7)] of place P_masterList breaks symmetries in sort M
Arc [15:1*[$m, (MOD (ADD $i 1) 6)]] contains successor/predecessor on variables of sort POS
Symmetric sort wr.t. initial and guards and successors and join/free detected :MT
Arc [9:1*[$m, $s, 3, 0]] contains constants of sort MT
Transition T_poll__handleAI1 : constants on arcs in [[9:1*[$m, $s, 3, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 2 subsets.
Arc [9:1*[$m, $s, 3, 0]] contains constants of sort MT
Transition T_poll__handleAI2 : constants on arcs in [[9:1*[$m, $s, 3, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 2 subsets.
Arc [9:1*[$m, $s, 4, 0]] contains constants of sort MT
Transition T_poll__handleAnnP1 : constants on arcs in [[9:1*[$m, $s, 4, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 3 subsets.
Arc [9:1*[$m, $s, 4, 0]] contains constants of sort MT
Transition T_poll__handleAnnP2 : constants on arcs in [[9:1*[$m, $s, 4, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 3 subsets.
Arc [9:1*[$m, $s, 1, 0]] contains constants of sort MT
Transition T_poll__handleAnsP1 : constants on arcs in [[9:1*[$m, $s, 1, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 4 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP1 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP2 : constants on arcs in [[9:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP2 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP3 : constants on arcs in [[9:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [11:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP4 : constants on arcs in [[11:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP4 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 0, 0]] contains constants of sort MT
Transition T_poll__handleAskP : constants on arcs in [[9:1*[$m, $s, 0, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 6 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :STAGE
Arc [16:1*[$m, 0]] contains constants of sort STAGE
Transition T_poll__iAmPrimary : constants on arcs in [[16:1*[$m, 0]]] introduces in STAGE(3) partition with 1 elements that refines current partition to 2 subsets.
Arc [16:1*[$m, 1]] contains constants of sort STAGE
Transition T_poll__iAmPrimary : constants on arcs in [[16:1*[$m, 1]]] introduces in STAGE(3) partition with 1 elements that refines current partition to 3 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :NEGSTEP
Arc [8:1*[$m, $r, 1]] contains constants of sort NEGSTEP
Transition T_poll__handleAI1 : constants on arcs in [[8:1*[$m, $r, 1]]] introduces in NEGSTEP(3) partition with 1 elements that refines current partition to 2 subsets.
Arc [8:1*[$m, $r, 2]] contains constants of sort NEGSTEP
Transition T_poll__handleAI1 : constants on arcs in [[8:1*[$m, $r, 2]]] introduces in NEGSTEP(3) partition with 1 elements that refines current partition to 3 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :BOOL
Arc [7:1*[$m, 0, $pm]] contains constants of sort BOOL
Transition T_poll__handleAI2 : constants on arcs in [[7:1*[$m, 0, $pm]]] introduces in BOOL(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-25 20:50:54] [INFO ] Unfolded HLPN to a Petri net with 4830 places and 7361 transitions 41792 arcs in 179 ms.
[2024-05-25 20:50:54] [INFO ] Unfolded 11 HLPN properties in 3 ms.
Deduced a syphon composed of 4507 places in 22 ms
Reduce places removed 4543 places and 6967 transitions.
Reduce places removed 7 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA NeoElection-COL-6-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 224 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 394/394 transitions.
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 250 transition count 394
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 44 place count 236 transition count 286
Iterating global reduction 1 with 14 rules applied. Total rules applied 58 place count 236 transition count 286
Applied a total of 58 rules in 29 ms. Remains 236 /280 variables (removed 44) and now considering 286/394 (removed 108) transitions.
[2024-05-25 20:50:54] [INFO ] Flow matrix only has 261 transitions (discarded 25 similar events)
// Phase 1: matrix 261 rows 236 cols
[2024-05-25 20:50:54] [INFO ] Computed 47 invariants in 22 ms
[2024-05-25 20:50:55] [INFO ] Implicit Places using invariants in 332 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 360 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 235/280 places, 286/394 transitions.
Applied a total of 0 rules in 3 ms. Remains 235 /235 variables (removed 0) and now considering 286/286 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 403 ms. Remains : 235/280 places, 286/394 transitions.
Support contains 224 out of 235 places after structural reductions.
[2024-05-25 20:50:55] [INFO ] Flatten gal took : 42 ms
[2024-05-25 20:50:55] [INFO ] Flatten gal took : 41 ms
[2024-05-25 20:50:55] [INFO ] Input system was already deterministic with 286 transitions.
RANDOM walk for 447 steps (0 resets) in 187 ms. (2 steps per ms) remains 0/8 properties
Computed a total of 235 stabilizing places and 286 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 235 transition count 286
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' '!((G(p0)||F(G(p1))))'
Support contains 42 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 286/286 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 235 transition count 280
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 229 transition count 280
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 48 place count 193 transition count 172
Iterating global reduction 0 with 36 rules applied. Total rules applied 84 place count 193 transition count 172
Applied a total of 84 rules in 68 ms. Remains 193 /235 variables (removed 42) and now considering 172/286 (removed 114) transitions.
[2024-05-25 20:50:55] [INFO ] Flow matrix only has 147 transitions (discarded 25 similar events)
// Phase 1: matrix 147 rows 193 cols
[2024-05-25 20:50:55] [INFO ] Computed 46 invariants in 10 ms
[2024-05-25 20:50:56] [INFO ] Implicit Places using invariants in 311 ms returned [16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 316 ms to find 35 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 158/235 places, 172/286 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 158 transition count 166
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 152 transition count 166
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 60 place count 128 transition count 142
Applied a total of 60 rules in 16 ms. Remains 128 /158 variables (removed 30) and now considering 142/172 (removed 30) transitions.
[2024-05-25 20:50:56] [INFO ] Flow matrix only has 117 transitions (discarded 25 similar events)
// Phase 1: matrix 117 rows 128 cols
[2024-05-25 20:50:56] [INFO ] Computed 11 invariants in 1 ms
[2024-05-25 20:50:56] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-25 20:50:56] [INFO ] Flow matrix only has 117 transitions (discarded 25 similar events)
[2024-05-25 20:50:56] [INFO ] Invariant cache hit.
[2024-05-25 20:50:56] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 20:50:56] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 128/235 places, 142/286 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 668 ms. Remains : 128/235 places, 142/286 transitions.
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : NeoElection-COL-6-LTLFireability-00
Product exploration explored 100000 steps with 395 reset in 569 ms.
Product exploration explored 100000 steps with 395 reset in 516 ms.
Computed a total of 128 stabilizing places and 142 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 128 transition count 142
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X 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 16 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-6-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-6-LTLFireability-00 finished in 2127 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(G(p0)))'
Support contains 46 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 286/286 transitions.
Reduce places removed 6 places and 6 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 223 transition count 280
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 6 place count 223 transition count 274
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 18 place count 217 transition count 274
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 54 place count 181 transition count 166
Iterating global reduction 1 with 36 rules applied. Total rules applied 90 place count 181 transition count 166
Applied a total of 90 rules in 25 ms. Remains 181 /235 variables (removed 54) and now considering 166/286 (removed 120) transitions.
[2024-05-25 20:50:57] [INFO ] Flow matrix only has 141 transitions (discarded 25 similar events)
// Phase 1: matrix 141 rows 181 cols
[2024-05-25 20:50:57] [INFO ] Computed 40 invariants in 2 ms
[2024-05-25 20:50:57] [INFO ] Implicit Places using invariants in 161 ms returned [10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 163 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 152/235 places, 166/286 transitions.
Applied a total of 0 rules in 7 ms. Remains 152 /152 variables (removed 0) and now considering 166/166 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 195 ms. Remains : 152/235 places, 166/286 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : NeoElection-COL-6-LTLFireability-05
Product exploration explored 100000 steps with 361 reset in 811 ms.
Product exploration explored 100000 steps with 361 reset in 797 ms.
Computed a total of 152 stabilizing places and 166 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 152 transition count 166
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 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-6-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-6-LTLFireability-05 finished in 1954 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((F(p0)&&G(p1))))'
Support contains 12 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 286/286 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 205 transition count 184
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 205 transition count 184
Applied a total of 60 rules in 11 ms. Remains 205 /235 variables (removed 30) and now considering 184/286 (removed 102) transitions.
[2024-05-25 20:50:59] [INFO ] Flow matrix only has 159 transitions (discarded 25 similar events)
// Phase 1: matrix 159 rows 205 cols
[2024-05-25 20:50:59] [INFO ] Computed 46 invariants in 4 ms
[2024-05-25 20:51:00] [INFO ] Implicit Places using invariants in 418 ms returned [16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 421 ms to find 35 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/235 places, 184/286 transitions.
Applied a total of 0 rules in 2 ms. Remains 170 /170 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 435 ms. Remains : 170/235 places, 184/286 transitions.
Stuttering acceptance computed with spot in 215 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : NeoElection-COL-6-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NeoElection-COL-6-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-6-LTLFireability-07 finished in 677 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 36 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 286/286 transitions.
Reduce places removed 6 places and 6 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 223 transition count 280
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 6 place count 223 transition count 274
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 18 place count 217 transition count 274
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 54 place count 181 transition count 166
Iterating global reduction 1 with 36 rules applied. Total rules applied 90 place count 181 transition count 166
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 96 place count 175 transition count 160
Ensure Unique test removed 6 places
Iterating post reduction 1 with 6 rules applied. Total rules applied 102 place count 169 transition count 160
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 108 place count 163 transition count 154
Ensure Unique test removed 6 places
Iterating post reduction 2 with 6 rules applied. Total rules applied 114 place count 157 transition count 154
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 120 place count 151 transition count 148
Ensure Unique test removed 6 places
Iterating post reduction 3 with 6 rules applied. Total rules applied 126 place count 145 transition count 148
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 132 place count 139 transition count 142
Ensure Unique test removed 6 places
Iterating post reduction 4 with 6 rules applied. Total rules applied 138 place count 133 transition count 142
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 144 place count 127 transition count 136
Applied a total of 144 rules in 56 ms. Remains 127 /235 variables (removed 108) and now considering 136/286 (removed 150) transitions.
[2024-05-25 20:51:00] [INFO ] Flow matrix only has 111 transitions (discarded 25 similar events)
// Phase 1: matrix 111 rows 127 cols
[2024-05-25 20:51:00] [INFO ] Computed 16 invariants in 1 ms
[2024-05-25 20:51:00] [INFO ] Implicit Places using invariants in 82 ms returned [10, 11, 12, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 93 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 122/235 places, 136/286 transitions.
Applied a total of 0 rules in 3 ms. Remains 122 /122 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 152 ms. Remains : 122/235 places, 136/286 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-6-LTLFireability-10
Product exploration explored 100000 steps with 7973 reset in 495 ms.
Product exploration explored 100000 steps with 7935 reset in 459 ms.
Computed a total of 122 stabilizing places and 136 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 122 transition count 136
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 11 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-6-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-6-LTLFireability-10 finished in 1232 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 45 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 286/286 transitions.
Reduce places removed 6 places and 6 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 223 transition count 280
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 6 place count 223 transition count 274
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 18 place count 217 transition count 274
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 211 transition count 268
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 211 transition count 268
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 30 place count 211 transition count 267
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 210 transition count 267
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 209 transition count 266
Ensure Unique test removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 208 transition count 266
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 207 transition count 265
Ensure Unique test removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 206 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 37 place count 205 transition count 264
Ensure Unique test removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 38 place count 204 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 39 place count 203 transition count 263
Ensure Unique test removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 40 place count 202 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 41 place count 201 transition count 262
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 42 place count 200 transition count 262
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 42 place count 200 transition count 257
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 52 place count 195 transition count 257
Applied a total of 52 rules in 63 ms. Remains 195 /235 variables (removed 40) and now considering 257/286 (removed 29) transitions.
[2024-05-25 20:51:01] [INFO ] Flow matrix only has 232 transitions (discarded 25 similar events)
// Phase 1: matrix 232 rows 195 cols
[2024-05-25 20:51:01] [INFO ] Computed 35 invariants in 2 ms
[2024-05-25 20:51:01] [INFO ] Implicit Places using invariants in 94 ms returned [11, 13, 15, 17, 20, 22, 24, 26, 29, 31, 33, 35, 38, 40, 42, 44, 47, 49, 51, 53]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 96 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 175/235 places, 257/286 transitions.
Applied a total of 0 rules in 9 ms. Remains 175 /175 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 168 ms. Remains : 175/235 places, 257/286 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-6-LTLFireability-11
Product exploration explored 100000 steps with 2108 reset in 887 ms.
Product exploration explored 100000 steps with 2113 reset in 892 ms.
Computed a total of 175 stabilizing places and 257 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 175 transition count 257
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 204 steps (0 resets) in 8 ms. (22 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 95 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA NeoElection-COL-6-LTLFireability-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-6-LTLFireability-11 finished in 2370 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(G(p0)))'
Support contains 60 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 286/286 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 199 transition count 178
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 199 transition count 178
Applied a total of 72 rules in 4 ms. Remains 199 /235 variables (removed 36) and now considering 178/286 (removed 108) transitions.
[2024-05-25 20:51:03] [INFO ] Flow matrix only has 153 transitions (discarded 25 similar events)
// Phase 1: matrix 153 rows 199 cols
[2024-05-25 20:51:03] [INFO ] Computed 46 invariants in 3 ms
[2024-05-25 20:51:04] [INFO ] Implicit Places using invariants in 99 ms returned [22, 28, 34, 40, 46]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 100 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 194/235 places, 178/286 transitions.
Applied a total of 0 rules in 1 ms. Remains 194 /194 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 105 ms. Remains : 194/235 places, 178/286 transitions.
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NeoElection-COL-6-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NeoElection-COL-6-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-6-LTLFireability-13 finished in 188 ms.
All properties solved by simple procedures.
Total runtime 10871 ms.
ITS solved all properties within timeout
BK_STOP 1716670264460
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NeoElection-COL-6"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is NeoElection-COL-6, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r245-tall-171654350000476"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NeoElection-COL-6.tgz
mv NeoElection-COL-6 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;