Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r150-smll-165276998300044.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-4028
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 r150-smll-165276998300044
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 352K
-rw-r--r-- 1 mcc users 8.3K Apr 30 05:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 30 05:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 30 05:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 30 05:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K May 9 08:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 9 08:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 108K May 10 09:34 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 1652924840056

Running Version 202205111006
[2022-05-19 01:47:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 01:47:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 01:47:22] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-19 01:47:22] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-19 01:47:23] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1118 ms
[2022-05-19 01:47:23] [INFO ] Detected 6 constant HL places corresponding to 3552 PT places.
[2022-05-19 01:47:23] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 7128 PT places and 22272.0 transition bindings in 44 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2022-05-19 01:47:23] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 10 ms.
[2022-05-19 01:47:23] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 5 formulas.
FORMULA NeoElection-COL-7-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 14 stabilizing places and 8 stable transitions
Graph (complete) has 56 edges and 18 vertex of which 15 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 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.
Computed a total of 2 stabilizing places and 2 stable transitions
Finished random walk after 77 steps, including 2 resets, run visited all 8 properties in 30 ms. (steps per millisecond=2 )
[2022-05-19 01:47:23] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-19 01:47:23] [INFO ] Flatten gal took : 21 ms
FORMULA NeoElection-COL-7-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-19 01:47:23] [INFO ] Flatten gal took : 4 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.
[2022-05-19 01:47:24] [INFO ] Unfolded HLPN to a Petri net with 7128 places and 12460 transitions 70880 arcs in 319 ms.
[2022-05-19 01:47:24] [INFO ] Unfolded 10 HLPN properties in 10 ms.
Deduced a syphon composed of 6688 places in 43 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-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 250 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
Applied a total of 42 rules in 28 ms. Remains 341 /383 variables (removed 42) and now considering 610/610 (removed 0) transitions.
[2022-05-19 01:47:24] [INFO ] Flow matrix only has 574 transitions (discarded 36 similar events)
// Phase 1: matrix 574 rows 341 cols
[2022-05-19 01:47:24] [INFO ] Computed 62 place invariants in 43 ms
[2022-05-19 01:47:24] [INFO ] Implicit Places using invariants in 407 ms returned []
[2022-05-19 01:47:24] [INFO ] Flow matrix only has 574 transitions (discarded 36 similar events)
// Phase 1: matrix 574 rows 341 cols
[2022-05-19 01:47:24] [INFO ] Computed 62 place invariants in 14 ms
[2022-05-19 01:47:25] [INFO ] State equation strengthened by 126 read => feed constraints.
[2022-05-19 01:47:25] [INFO ] Implicit Places using invariants and state equation in 604 ms returned []
Implicit Place search using SMT with State Equation took 1052 ms to find 0 implicit places.
[2022-05-19 01:47:25] [INFO ] Flow matrix only has 574 transitions (discarded 36 similar events)
// Phase 1: matrix 574 rows 341 cols
[2022-05-19 01:47:25] [INFO ] Computed 62 place invariants in 10 ms
[2022-05-19 01:47:25] [INFO ] Dead Transitions using invariants and state equation in 485 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 341/383 places, 610/610 transitions.
Finished structural reductions, in 1 iterations. Remains : 341/383 places, 610/610 transitions.
Support contains 250 out of 341 places after structural reductions.
[2022-05-19 01:47:26] [INFO ] Flatten gal took : 135 ms
[2022-05-19 01:47:26] [INFO ] Flatten gal took : 135 ms
[2022-05-19 01:47:26] [INFO ] Input system was already deterministic with 610 transitions.
Finished random walk after 207 steps, including 0 resets, run visited all 10 properties in 77 ms. (steps per millisecond=2 )
Computed a total of 341 stabilizing places and 610 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 341 transition count 610
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 : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(X(((X(p1)||p2)&&p0)))))'
Support contains 14 out of 341 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 341/341 places, 610/610 transitions.
Discarding 65 places :
Symmetric choice reduction at 0 with 65 rule applications. Total rules 65 place count 276 transition count 250
Iterating global reduction 0 with 65 rules applied. Total rules applied 130 place count 276 transition count 250
Applied a total of 130 rules in 47 ms. Remains 276 /341 variables (removed 65) and now considering 250/610 (removed 360) transitions.
[2022-05-19 01:47:27] [INFO ] Flow matrix only has 214 transitions (discarded 36 similar events)
// Phase 1: matrix 214 rows 276 cols
[2022-05-19 01:47:27] [INFO ] Computed 62 place invariants in 5 ms
[2022-05-19 01:47:27] [INFO ] Implicit Places using invariants in 286 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, 67]
Discarding 49 places :
Implicit Place search using SMT only with invariants took 289 ms to find 49 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 227/341 places, 250/610 transitions.
Applied a total of 0 rules in 6 ms. Remains 227 /227 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 227/341 places, 250/610 transitions.
Stuttering acceptance computed with spot in 359 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : NeoElection-COL-7-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (LT s176 1) (LT s177 1) (LT s174 1) (LT s175 1) (LT s172 1) (LT s173 1) (LT s171 1)), p2:(AND (LT s212 1) (LT s198 1) (LT s184 1) (LT s219 1) (LT ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 574 ms.
Product exploration explored 100000 steps with 50000 reset in 426 ms.
Computed a total of 227 stabilizing places and 250 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 227 transition count 250
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 p2 (NOT p1)), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (G p0)), (F (G p2)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p2 (NOT p1))
Knowledge based reduction with 10 factoid took 388 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA NeoElection-COL-7-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-7-LTLFireability-00 finished in 2288 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U F(!(G(p0)||p1)))))'
Support contains 82 out of 341 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 341/341 places, 610/610 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 327 transition count 603
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 34 place count 300 transition count 501
Iterating global reduction 1 with 27 rules applied. Total rules applied 61 place count 300 transition count 501
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 299 transition count 500
Ensure Unique test removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 63 place count 298 transition count 500
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 297 transition count 499
Ensure Unique test removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 296 transition count 499
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 295 transition count 498
Ensure Unique test removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 67 place count 294 transition count 498
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 68 place count 293 transition count 497
Ensure Unique test removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 69 place count 292 transition count 497
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 70 place count 291 transition count 496
Ensure Unique test removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 71 place count 290 transition count 496
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 72 place count 289 transition count 495
Applied a total of 72 rules in 200 ms. Remains 289 /341 variables (removed 52) and now considering 495/610 (removed 115) transitions.
[2022-05-19 01:47:29] [INFO ] Flow matrix only has 459 transitions (discarded 36 similar events)
// Phase 1: matrix 459 rows 289 cols
[2022-05-19 01:47:29] [INFO ] Computed 50 place invariants in 5 ms
[2022-05-19 01:47:29] [INFO ] Implicit Places using invariants in 195 ms returned [13, 15, 17, 19, 21, 24, 26, 28, 30, 32, 35, 37, 39, 41, 43, 46, 48, 50, 52, 54, 57, 59, 61, 63, 65, 68, 70, 72, 74, 76, 78]
Discarding 31 places :
Implicit Place search using SMT only with invariants took 201 ms to find 31 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 258/341 places, 495/610 transitions.
Applied a total of 0 rules in 19 ms. Remains 258 /258 variables (removed 0) and now considering 495/495 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 258/341 places, 495/610 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR p0 p1), p0, p1]
Running random walk in product with property : NeoElection-COL-7-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s220 1) (GEQ s221 1) (GEQ s218 1) (GEQ s219 1) (GEQ s216 1) (GEQ s217 1) (GEQ s215 1)), p1:(OR (AND (GEQ s2 1) (GEQ s23 1) (GEQ s87 1) (GEQ s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 3459 reset in 1497 ms.
Product exploration explored 100000 steps with 3415 reset in 1520 ms.
Computed a total of 258 stabilizing places and 495 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 258 transition count 495
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 p1)), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(F (G (NOT p1)))
Knowledge based reduction with 5 factoid took 235 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA NeoElection-COL-7-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-7-LTLFireability-03 finished in 3993 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p1)||p0)))'
Support contains 106 out of 341 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 341/341 places, 610/610 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 314 transition count 413
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 314 transition count 413
Applied a total of 54 rules in 10 ms. Remains 314 /341 variables (removed 27) and now considering 413/610 (removed 197) transitions.
[2022-05-19 01:47:33] [INFO ] Flow matrix only has 377 transitions (discarded 36 similar events)
// Phase 1: matrix 377 rows 314 cols
[2022-05-19 01:47:33] [INFO ] Computed 62 place invariants in 6 ms
[2022-05-19 01:47:33] [INFO ] Implicit Places using invariants in 228 ms returned [19, 20, 21, 22, 23, 24, 25, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 76, 78, 80, 82, 84, 86, 88, 90, 92, 94, 96]
Discarding 43 places :
Implicit Place search using SMT only with invariants took 230 ms to find 43 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 271/341 places, 413/610 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 2 iterations. Remains : 271/341 places, 413/610 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : NeoElection-COL-7-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s84 1) (GEQ s209 1)) (AND (GEQ s178 1) (GEQ s213 1)) (AND (GEQ s70 1) (GEQ s208 1)) (AND (GEQ s174 1) (GEQ s213 1)) (AND (GEQ s96 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NeoElection-COL-7-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-7-LTLFireability-11 finished in 354 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||G(p1)))'
Support contains 82 out of 341 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 341/341 places, 610/610 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 314 transition count 508
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 314 transition count 508
Applied a total of 54 rules in 10 ms. Remains 314 /341 variables (removed 27) and now considering 508/610 (removed 102) transitions.
[2022-05-19 01:47:33] [INFO ] Flow matrix only has 472 transitions (discarded 36 similar events)
// Phase 1: matrix 472 rows 314 cols
[2022-05-19 01:47:33] [INFO ] Computed 62 place invariants in 4 ms
[2022-05-19 01:47:33] [INFO ] Implicit Places using invariants in 214 ms returned [19, 21, 23, 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, 92, 93, 94, 95, 96, 97]
Discarding 43 places :
Implicit Place search using SMT only with invariants took 218 ms to find 43 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 271/341 places, 508/610 transitions.
Applied a total of 0 rules in 5 ms. Remains 271 /271 variables (removed 0) and now considering 508/508 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 271/341 places, 508/610 transitions.
Stuttering acceptance computed with spot in 273 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : NeoElection-COL-7-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 1}, { cond=(NOT p1), acceptance={} source=5 dest: 3}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=5, aps=[p0:(OR (GEQ s0 1) (GEQ s2 1) (GEQ s1 1) (GEQ s4 1) (GEQ s3 1) (GEQ s6 1) (GEQ s5 1)), p1:(OR (AND (GEQ s9 1) (GEQ s30 1) (GEQ s94 1) (GEQ s209 1)) (AND (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1744 ms.
Product exploration explored 100000 steps with 33333 reset in 1732 ms.
Computed a total of 271 stabilizing places and 508 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 271 transition count 508
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p1) (NOT p0)))))
Knowledge based reduction with 7 factoid took 132 ms. Reduced automaton from 7 states, 11 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA NeoElection-COL-7-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NeoElection-COL-7-LTLFireability-12 finished in 4313 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(X(G(p0)))||F(p1))))'
Support contains 133 out of 341 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 341/341 places, 610/610 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 341 transition count 603
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 334 transition count 603
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 86 place count 262 transition count 236
Iterating global reduction 0 with 72 rules applied. Total rules applied 158 place count 262 transition count 236
Applied a total of 158 rules in 30 ms. Remains 262 /341 variables (removed 79) and now considering 236/610 (removed 374) transitions.
[2022-05-19 01:47:37] [INFO ] Flow matrix only has 200 transitions (discarded 36 similar events)
// Phase 1: matrix 200 rows 262 cols
[2022-05-19 01:47:37] [INFO ] Computed 62 place invariants in 2 ms
[2022-05-19 01:47:38] [INFO ] Implicit Places using invariants in 151 ms returned [20, 27, 34, 41, 48, 55, 62]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 154 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 255/341 places, 236/610 transitions.
Applied a total of 0 rules in 6 ms. Remains 255 /255 variables (removed 0) and now considering 236/236 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 255/341 places, 236/610 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NeoElection-COL-7-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s90 1) (GEQ s200 1)) (AND (GEQ s175 1) (GEQ s204 1)) (AND (GEQ s76 1) (GEQ s199 1)) (AND (GEQ s172 1) (GEQ s204 1)) (AND (GEQ s102 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 392 steps with 0 reset in 5 ms.
FORMULA NeoElection-COL-7-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeoElection-COL-7-LTLFireability-13 finished in 284 ms.
All properties solved by simple procedures.
Total runtime 16193 ms.

BK_STOP 1652924858531

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-4028"
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 r150-smll-165276998300044"
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 ;