Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r266-smll-167863540500114.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is NeoElection-COL-2, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r266-smll-167863540500114
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 8.3K Feb 26 15:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 15:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 26 15:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 15:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 15:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Feb 26 15:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 15:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 15:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 70K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678805927281

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeoElection-COL-2
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-14 14:58:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 14:58:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 14:58:50] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-14 14:58:50] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-14 14:58:51] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 904 ms
[2023-03-14 14:58:51] [INFO ] Detected 6 constant HL places corresponding to 192 PT places.
[2023-03-14 14:58:51] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 438 PT places and 672.0 transition bindings in 55 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 18 ms.
[2023-03-14 14:58:51] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 6 ms.
[2023-03-14 14:58:51] [INFO ] Skeletonized 6 HLPN properties in 2 ms. Removed 10 properties that had guard overlaps.
Initial state reduction rules removed 1 formulas.
FORMULA NeoElection-COL-2-CTLFireability-13 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.2 ms
Remains 5 properties that can be checked using skeleton over-approximation.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 12 places and 7 transitions.
Ensure Unique test removed 8 transitions
Reduce redundant transitions removed 8 transitions.
FORMULA NeoElection-COL-2-CTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-2-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 2 stable transitions
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=1 )
[2023-03-14 14:58:51] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-14 14:58:51] [INFO ] Flatten gal took : 19 ms
FORMULA NeoElection-COL-2-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-14 14:58:51] [INFO ] Flatten gal took : 2 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :MT
Arc [9:1*[$m, $s, 3, 0]] contains constants of sort MT
Transition T_poll__handleAI1 : constants on arcs in [[9:1*[$m, $s, 3, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 2 subsets.
Arc [9:1*[$m, $s, 3, 0]] contains constants of sort MT
Transition T_poll__handleAI2 : constants on arcs in [[9:1*[$m, $s, 3, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 2 subsets.
Arc [9:1*[$m, $s, 4, 0]] contains constants of sort MT
Transition T_poll__handleAnnP1 : constants on arcs in [[9:1*[$m, $s, 4, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 3 subsets.
Arc [9:1*[$m, $s, 4, 0]] contains constants of sort MT
Transition T_poll__handleAnnP2 : constants on arcs in [[9:1*[$m, $s, 4, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 3 subsets.
Arc [9:1*[$m, $s, 1, 0]] contains constants of sort MT
Transition T_poll__handleAnsP1 : constants on arcs in [[9:1*[$m, $s, 1, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 4 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP1 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP2 : constants on arcs in [[9:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP2 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP3 : constants on arcs in [[9:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [11:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP4 : constants on arcs in [[11:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP4 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 0, 0]] contains constants of sort MT
Transition T_poll__handleAskP : constants on arcs in [[9:1*[$m, $s, 0, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 6 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :STAGE
Arc [16:1*[$m, 0]] contains constants of sort STAGE
Transition T_poll__iAmPrimary : constants on arcs in [[16:1*[$m, 0]]] introduces in STAGE(3) partition with 1 elements that refines current partition to 2 subsets.
Arc [16:1*[$m, 1]] contains constants of sort STAGE
Transition T_poll__iAmPrimary : constants on arcs in [[16:1*[$m, 1]]] introduces in STAGE(3) partition with 1 elements that refines current partition to 3 subsets.
Domain [M(3), POS(2), M(3)] of place P_masterList breaks symmetries in sort M
Symmetric sort wr.t. initial and guards and successors and join/free detected :NEGSTEP
Arc [8:1*[$m, $r, 1]] contains constants of sort NEGSTEP
Transition T_poll__handleAI1 : constants on arcs in [[8:1*[$m, $r, 1]]] introduces in NEGSTEP(3) partition with 1 elements that refines current partition to 2 subsets.
Arc [8:1*[$m, $r, 2]] contains constants of sort NEGSTEP
Transition T_poll__handleAI1 : constants on arcs in [[8:1*[$m, $r, 2]]] introduces in NEGSTEP(3) partition with 1 elements that refines current partition to 3 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :BOOL
Arc [7:1*[$m, 0, $pm]] contains constants of sort BOOL
Transition T_poll__handleAI2 : constants on arcs in [[7:1*[$m, 0, $pm]]] introduces in BOOL(2) partition with 1 elements that refines current partition to 2 subsets.
Arc [15:1*[$m, (MOD (ADD $i 1) 2)]] contains successor/predecessor on variables of sort POS
[2023-03-14 14:58:51] [INFO ] Unfolded HLPN to a Petri net with 438 places and 295 transitions 1570 arcs in 55 ms.
[2023-03-14 14:58:51] [INFO ] Unfolded 12 HLPN properties in 2 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 403 places in 2 ms
Reduce places removed 407 places and 275 transitions.
Reduce places removed 3 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA NeoElection-COL-2-CTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-2-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-2-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 20/20 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 26 transition count 20
Applied a total of 2 rules in 9 ms. Remains 26 /28 variables (removed 2) and now considering 20/20 (removed 0) transitions.
[2023-03-14 14:58:51] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
// Phase 1: matrix 19 rows 26 cols
[2023-03-14 14:58:51] [INFO ] Computed 7 place invariants in 8 ms
[2023-03-14 14:58:52] [INFO ] Implicit Places using invariants in 298 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 336 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/28 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 346 ms. Remains : 25/28 places, 20/20 transitions.
Support contains 24 out of 25 places after structural reductions.
[2023-03-14 14:58:52] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-14 14:58:52] [INFO ] Flatten gal took : 8 ms
[2023-03-14 14:58:52] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA NeoElection-COL-2-CTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-2-CTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-14 14:58:52] [INFO ] Flatten gal took : 7 ms
[2023-03-14 14:58:52] [INFO ] Input system was already deterministic with 20 transitions.
Finished random walk after 21 steps, including 0 resets, run visited all 10 properties in 67 ms. (steps per millisecond=0 )
[2023-03-14 14:58:52] [INFO ] Flatten gal took : 25 ms
[2023-03-14 14:58:52] [INFO ] Flatten gal took : 30 ms
[2023-03-14 14:58:52] [INFO ] Input system was already deterministic with 20 transitions.
Computed a total of 25 stabilizing places and 20 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 25 transition count 20
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
FORMULA NeoElection-COL-2-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 20/20 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 23 transition count 18
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 23 transition count 18
Applied a total of 4 rules in 4 ms. Remains 23 /25 variables (removed 2) and now considering 18/20 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 23/25 places, 18/20 transitions.
[2023-03-14 14:58:52] [INFO ] Flatten gal took : 23 ms
[2023-03-14 14:58:52] [INFO ] Flatten gal took : 6 ms
[2023-03-14 14:58:52] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 20/20 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 25/25 places, 20/20 transitions.
[2023-03-14 14:58:52] [INFO ] Flatten gal took : 18 ms
[2023-03-14 14:58:52] [INFO ] Flatten gal took : 6 ms
[2023-03-14 14:58:52] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 25/25 places, 20/20 transitions.
Reduce places removed 2 places and 2 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 2 place count 21 transition count 16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 19 transition count 16
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 17 transition count 14
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 17 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 10 place count 17 transition count 13
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 12 place count 16 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 15 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 14 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 14 place count 14 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 13 transition count 11
Applied a total of 16 rules in 31 ms. Remains 13 /25 variables (removed 12) and now considering 11/20 (removed 9) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31 ms. Remains : 13/25 places, 11/20 transitions.
[2023-03-14 14:58:52] [INFO ] Flatten gal took : 7 ms
[2023-03-14 14:58:52] [INFO ] Flatten gal took : 3 ms
[2023-03-14 14:58:52] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 20/20 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 23 transition count 18
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 23 transition count 18
Applied a total of 4 rules in 2 ms. Remains 23 /25 variables (removed 2) and now considering 18/20 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 23/25 places, 18/20 transitions.
[2023-03-14 14:58:52] [INFO ] Flatten gal took : 3 ms
[2023-03-14 14:58:52] [INFO ] Flatten gal took : 3 ms
[2023-03-14 14:58:52] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 25/25 places, 20/20 transitions.
[2023-03-14 14:58:52] [INFO ] Flatten gal took : 4 ms
[2023-03-14 14:58:52] [INFO ] Flatten gal took : 15 ms
[2023-03-14 14:58:52] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 25/25 places, 20/20 transitions.
[2023-03-14 14:58:52] [INFO ] Flatten gal took : 11 ms
[2023-03-14 14:58:52] [INFO ] Flatten gal took : 4 ms
[2023-03-14 14:58:52] [INFO ] Input system was already deterministic with 20 transitions.
[2023-03-14 14:58:52] [INFO ] Flatten gal took : 21 ms
[2023-03-14 14:58:52] [INFO ] Flatten gal took : 3 ms
[2023-03-14 14:58:52] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-14 14:58:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 25 places, 20 transitions and 71 arcs took 14 ms.
Total runtime 2521 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 25 NrTr: 20 NrArc: 71)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

net check time: 0m 0.000sec

init dd package: 0m 3.508sec


RS generation: 0m 0.001sec


-> reachability set: #nodes 208 (2.1e+02) #states 241



starting MCC model checker
--------------------------

checking: AX [1<=0]
normalized: ~ [EX [~ [1<=0]]]

abstracting: (1<=0)
states: 0
.-> the formula is FALSE

FORMULA NeoElection-COL-2-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.036sec

checking: AF [EG [[p6<=0 | [p14<=0 | p16<=0]]]]
normalized: ~ [EG [~ [EG [[[p14<=0 | p16<=0] | p6<=0]]]]]

abstracting: (p6<=0)
states: 55
abstracting: (p16<=0)
states: 164
abstracting: (p14<=0)
states: 196
..............................
EG iterations: 30
...............................
EG iterations: 31
-> the formula is TRUE

FORMULA NeoElection-COL-2-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: [EX [0<=0] & EX [AX [[1<=p24 | [1<=p22 | AX [[[1<=p3 & [1<=p7 & 1<=p15]] | [[1<=p2 & [1<=p7 & 1<=p15]] | [1<=p11 & 1<=p16]]]]]]]]]
normalized: [EX [~ [EX [~ [[[~ [EX [~ [[[[1<=p11 & 1<=p16] | [[1<=p7 & 1<=p15] & 1<=p2]] | [[1<=p7 & 1<=p15] & 1<=p3]]]]] | 1<=p22] | 1<=p24]]]]] & EX [0<=0]]

abstracting: (0<=0)
states: 241
.abstracting: (1<=p24)
states: 8
abstracting: (1<=p22)
states: 8
abstracting: (1<=p3)
states: 196
abstracting: (1<=p15)
states: 77
abstracting: (1<=p7)
states: 51
abstracting: (1<=p2)
states: 45
abstracting: (1<=p15)
states: 77
abstracting: (1<=p7)
states: 51
abstracting: (1<=p16)
states: 77
abstracting: (1<=p11)
states: 51
...-> the formula is FALSE

FORMULA NeoElection-COL-2-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: A [~ [[AF [~ [[1<=p6 & [1<=p14 & 1<=p16]]]] & E [~ [AG [[1<=p24 | 1<=p22]]] U [1<=p18 | 1<=p17]]]] U EG [AX [AF [[[1<=p5 & 1<=p23] | [1<=p4 & 1<=p21]]]]]]
normalized: [~ [EG [~ [EG [~ [EX [EG [~ [[[1<=p4 & 1<=p21] | [1<=p5 & 1<=p23]]]]]]]]]] & ~ [E [~ [EG [~ [EX [EG [~ [[[1<=p4 & 1<=p21] | [1<=p5 & 1<=p23]]]]]]]] U [~ [EG [~ [EX [EG [~ [[[1<=p4 & 1<=p21] | [1<=p5 & 1<=p23]]]]]]]] & [E [E [true U ~ [[1<=p24 | 1<=p22]]] U [1<=p18 | 1<=p17]] & ~ [EG [[[1<=p14 & 1<=p16] & 1<=p6]]]]]]]]

abstracting: (1<=p6)
states: 186
abstracting: (1<=p16)
states: 77
abstracting: (1<=p14)
states: 45
.......
EG iterations: 7
abstracting: (1<=p17)
states: 69
abstracting: (1<=p18)
states: 69
abstracting: (1<=p22)
states: 8
abstracting: (1<=p24)
states: 8
abstracting: (1<=p23)
states: 5
abstracting: (1<=p5)
states: 10
abstracting: (1<=p21)
states: 5
abstracting: (1<=p4)
states: 10
....
EG iterations: 4
.......
EG iterations: 6
abstracting: (1<=p23)
states: 5
abstracting: (1<=p5)
states: 10
abstracting: (1<=p21)
states: 5
abstracting: (1<=p4)
states: 10
....
EG iterations: 4
.......
EG iterations: 6
abstracting: (1<=p23)
states: 5
abstracting: (1<=p5)
states: 10
abstracting: (1<=p21)
states: 5
abstracting: (1<=p4)
states: 10
....
EG iterations: 4
.......
EG iterations: 6
.................................
EG iterations: 33
-> the formula is FALSE

FORMULA NeoElection-COL-2-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: AX [[[[AF [[[[p7<=0 | p15<=0] | p3<=0] & [[p2<=0 | [p7<=0 | p15<=0]] & [p11<=0 | p16<=0]]]] | 1<=p0] | [1<=p1 | [1<=p20 | 1<=p19]]] | [[EX [0<=0] | EF [[[p5<=0 | p23<=0] & [p4<=0 | p21<=0]]]] | [[1<=p3 & [1<=p7 & 1<=p15]] | [[1<=p2 & [1<=p7 & 1<=p15]] | [1<=p11 & 1<=p16]]]]]]
normalized: ~ [EX [~ [[[[~ [EG [~ [[[p3<=0 | [p7<=0 | p15<=0]] & [[p11<=0 | p16<=0] & [p2<=0 | [p7<=0 | p15<=0]]]]]]] | 1<=p0] | [[1<=p20 | 1<=p19] | 1<=p1]] | [[[[1<=p11 & 1<=p16] | [[1<=p7 & 1<=p15] & 1<=p2]] | [[1<=p7 & 1<=p15] & 1<=p3]] | [E [true U [[p4<=0 | p21<=0] & [p5<=0 | p23<=0]]] | EX [0<=0]]]]]]]

abstracting: (0<=0)
states: 241
.abstracting: (p23<=0)
states: 236
abstracting: (p5<=0)
states: 231
abstracting: (p21<=0)
states: 236
abstracting: (p4<=0)
states: 231
abstracting: (1<=p3)
states: 196
abstracting: (1<=p15)
states: 77
abstracting: (1<=p7)
states: 51
abstracting: (1<=p2)
states: 45
abstracting: (1<=p15)
states: 77
abstracting: (1<=p7)
states: 51
abstracting: (1<=p16)
states: 77
abstracting: (1<=p11)
states: 51
abstracting: (1<=p1)
states: 5
abstracting: (1<=p19)
states: 77
abstracting: (1<=p20)
states: 77
abstracting: (1<=p0)
states: 5
abstracting: (p15<=0)
states: 164
abstracting: (p7<=0)
states: 190
abstracting: (p2<=0)
states: 196
abstracting: (p16<=0)
states: 164
abstracting: (p11<=0)
states: 190
abstracting: (p15<=0)
states: 164
abstracting: (p7<=0)
states: 190
abstracting: (p3<=0)
states: 45
.......
EG iterations: 7
.-> the formula is TRUE

FORMULA NeoElection-COL-2-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: [E [[AG [~ [[[1<=p6 & [1<=p14 & 1<=p16]] | [[1<=p9 & 1<=p15] | [1<=p13 & 1<=p16]]]]] | E [[E [[1<=p18 | 1<=p17] U [1<=p6 & [1<=p14 & 1<=p16]]] & ~ [[[1<=p5 & 1<=p23] | [1<=p4 & 1<=p21]]]] U EG [[1<=p6 & [1<=p14 & 1<=p16]]]]] U AX [~ [[[1<=p9 & 1<=p15] | [1<=p13 & 1<=p16]]]]] & AX [~ [A [[1<=p18 | 1<=p17] U ~ [[[1<=p5 & 1<=p23] | [1<=p4 & 1<=p21]]]]]]]
normalized: [~ [EX [[~ [EG [[[1<=p4 & 1<=p21] | [1<=p5 & 1<=p23]]]] & ~ [E [[[1<=p4 & 1<=p21] | [1<=p5 & 1<=p23]] U [~ [[1<=p18 | 1<=p17]] & [[1<=p4 & 1<=p21] | [1<=p5 & 1<=p23]]]]]]]] & E [[E [[~ [[[1<=p4 & 1<=p21] | [1<=p5 & 1<=p23]]] & E [[1<=p18 | 1<=p17] U [[1<=p14 & 1<=p16] & 1<=p6]]] U EG [[[1<=p14 & 1<=p16] & 1<=p6]]] | ~ [E [true U [[[1<=p13 & 1<=p16] | [1<=p9 & 1<=p15]] | [[1<=p14 & 1<=p16] & 1<=p6]]]]] U ~ [EX [[[1<=p13 & 1<=p16] | [1<=p9 & 1<=p15]]]]]]

abstracting: (1<=p15)
states: 77
abstracting: (1<=p9)
states: 45
abstracting: (1<=p16)
states: 77
abstracting: (1<=p13)
states: 45
.abstracting: (1<=p6)
states: 186
abstracting: (1<=p16)
states: 77
abstracting: (1<=p14)
states: 45
abstracting: (1<=p15)
states: 77
abstracting: (1<=p9)
states: 45
abstracting: (1<=p16)
states: 77
abstracting: (1<=p13)
states: 45
abstracting: (1<=p6)
states: 186
abstracting: (1<=p16)
states: 77
abstracting: (1<=p14)
states: 45
.......
EG iterations: 7
abstracting: (1<=p6)
states: 186
abstracting: (1<=p16)
states: 77
abstracting: (1<=p14)
states: 45
abstracting: (1<=p17)
states: 69
abstracting: (1<=p18)
states: 69
abstracting: (1<=p23)
states: 5
abstracting: (1<=p5)
states: 10
abstracting: (1<=p21)
states: 5
abstracting: (1<=p4)
states: 10
abstracting: (1<=p23)
states: 5
abstracting: (1<=p5)
states: 10
abstracting: (1<=p21)
states: 5
abstracting: (1<=p4)
states: 10
abstracting: (1<=p17)
states: 69
abstracting: (1<=p18)
states: 69
abstracting: (1<=p23)
states: 5
abstracting: (1<=p5)
states: 10
abstracting: (1<=p21)
states: 5
abstracting: (1<=p4)
states: 10
abstracting: (1<=p23)
states: 5
abstracting: (1<=p5)
states: 10
abstracting: (1<=p21)
states: 5
abstracting: (1<=p4)
states: 10
......
EG iterations: 6
.-> the formula is TRUE

FORMULA NeoElection-COL-2-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

totally nodes used: 21767 (2.2e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 22801 51654 74455
used/not used/entry size/cache size: 70544 67038320 16 1024MB
basic ops cache: hits/miss/sum: 7183 16533 23716
used/not used/entry size/cache size: 31802 16745414 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 573 1268 1841
used/not used/entry size/cache size: 1268 8387340 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 67087229
1 21504
2 130
3 1
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.145sec


BK_STOP 1678805939043

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:205 (10), effective:32 (1)

initing FirstDep: 0m 0.000sec


iterations count:24 (1), effective:2 (0)

iterations count:171 (8), effective:24 (1)

iterations count:20 (1), effective:0 (0)

iterations count:27 (1), effective:2 (0)

iterations count:170 (8), effective:26 (1)

iterations count:188 (9), effective:24 (1)

iterations count:20 (1), effective:0 (0)

iterations count:20 (1), effective:0 (0)

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NeoElection-COL-2"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is NeoElection-COL-2, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r266-smll-167863540500114"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NeoElection-COL-2.tgz
mv NeoElection-COL-2 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;