fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r266-smll-167863540500122
Last Updated
May 14, 2023

About the Execution of Marcie+red for NeoElection-COL-3

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5816.420 24923.00 31620.00 640.20 TFTTFTFFFFTFFFTT normal

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-167863540500122.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-3, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r266-smll-167863540500122
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 7.2K Feb 26 15:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 26 15:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 15:50 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 3.9K Feb 25 16:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 16:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 16:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 16:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 26 16:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Feb 26 16:02 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 75K 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-3-CTLFireability-00
FORMULA_NAME NeoElection-COL-3-CTLFireability-01
FORMULA_NAME NeoElection-COL-3-CTLFireability-02
FORMULA_NAME NeoElection-COL-3-CTLFireability-03
FORMULA_NAME NeoElection-COL-3-CTLFireability-04
FORMULA_NAME NeoElection-COL-3-CTLFireability-05
FORMULA_NAME NeoElection-COL-3-CTLFireability-06
FORMULA_NAME NeoElection-COL-3-CTLFireability-07
FORMULA_NAME NeoElection-COL-3-CTLFireability-08
FORMULA_NAME NeoElection-COL-3-CTLFireability-09
FORMULA_NAME NeoElection-COL-3-CTLFireability-10
FORMULA_NAME NeoElection-COL-3-CTLFireability-11
FORMULA_NAME NeoElection-COL-3-CTLFireability-12
FORMULA_NAME NeoElection-COL-3-CTLFireability-13
FORMULA_NAME NeoElection-COL-3-CTLFireability-14
FORMULA_NAME NeoElection-COL-3-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678806197491

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-3
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-14 15:03:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 15:03:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 15:03:21] [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 15:03:21] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-14 15:03:22] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1197 ms
[2023-03-14 15:03:22] [INFO ] Detected 6 constant HL places corresponding to 448 PT places.
[2023-03-14 15:03:22] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 972 PT places and 1808.0 transition bindings in 50 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 22 ms.
[2023-03-14 15:03:22] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 10 ms.
[2023-03-14 15:03:22] [INFO ] Skeletonized 9 HLPN properties in 2 ms. Removed 7 properties that had guard overlaps.
Computed a total of 14 stabilizing places and 8 stable transitions
Graph (complete) has 56 edges and 18 vertex of which 15 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Remains 8 properties that can be checked using skeleton over-approximation.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 12 places and 7 transitions.
Ensure Unique test removed 8 transitions
Reduce redundant transitions removed 8 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Finished random walk after 40 steps, including 2 resets, run visited all 5 properties in 21 ms. (steps per millisecond=1 )
[2023-03-14 15:03:22] [INFO ] Flatten gal took : 26 ms
[2023-03-14 15:03:22] [INFO ] Flatten gal took : 5 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :MT
Arc [9:1*[$m, $s, 3, 0]] contains constants of sort MT
Transition T_poll__handleAI1 : constants on arcs in [[9:1*[$m, $s, 3, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 2 subsets.
Arc [9:1*[$m, $s, 3, 0]] contains constants of sort MT
Transition T_poll__handleAI2 : constants on arcs in [[9:1*[$m, $s, 3, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 2 subsets.
Arc [9:1*[$m, $s, 4, 0]] contains constants of sort MT
Transition T_poll__handleAnnP1 : constants on arcs in [[9:1*[$m, $s, 4, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 3 subsets.
Arc [9:1*[$m, $s, 4, 0]] contains constants of sort MT
Transition T_poll__handleAnnP2 : constants on arcs in [[9:1*[$m, $s, 4, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 3 subsets.
Arc [9:1*[$m, $s, 1, 0]] contains constants of sort MT
Transition T_poll__handleAnsP1 : constants on arcs in [[9:1*[$m, $s, 1, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 4 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP1 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP2 : constants on arcs in [[9:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP2 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP3 : constants on arcs in [[9:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [11:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP4 : constants on arcs in [[11:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP4 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 0, 0]] contains constants of sort MT
Transition T_poll__handleAskP : constants on arcs in [[9:1*[$m, $s, 0, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 6 subsets.
Domain [M(4), POS(3), M(4)] of place P_masterList breaks symmetries in sort M
Arc [15:1*[$m, (MOD (ADD $i 1) 3)]] contains successor/predecessor on variables of sort POS
Symmetric sort wr.t. initial and guards and successors and join/free detected :STAGE
Arc [16:1*[$m, 0]] contains constants of sort STAGE
Transition T_poll__iAmPrimary : constants on arcs in [[16:1*[$m, 0]]] introduces in STAGE(3) partition with 1 elements that refines current partition to 2 subsets.
Arc [16:1*[$m, 1]] contains constants of sort STAGE
Transition T_poll__iAmPrimary : constants on arcs in [[16:1*[$m, 1]]] introduces in STAGE(3) partition with 1 elements that refines current partition to 3 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :NEGSTEP
Arc [8:1*[$m, $r, 1]] contains constants of sort NEGSTEP
Transition T_poll__handleAI1 : constants on arcs in [[8:1*[$m, $r, 1]]] introduces in NEGSTEP(3) partition with 1 elements that refines current partition to 2 subsets.
Arc [8:1*[$m, $r, 2]] contains constants of sort NEGSTEP
Transition T_poll__handleAI1 : constants on arcs in [[8:1*[$m, $r, 2]]] introduces in NEGSTEP(3) partition with 1 elements that refines current partition to 3 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :BOOL
Arc [7:1*[$m, 0, $pm]] contains constants of sort BOOL
Transition T_poll__handleAI2 : constants on arcs in [[7:1*[$m, 0, $pm]]] introduces in BOOL(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-14 15:03:22] [INFO ] Unfolded HLPN to a Petri net with 972 places and 848 transitions 4688 arcs in 112 ms.
[2023-03-14 15:03:22] [INFO ] Unfolded 16 HLPN properties in 2 ms.
Deduced a syphon composed of 892 places in 5 ms
Reduce places removed 901 places and 790 transitions.
Reduce places removed 4 places and 0 transitions.
FORMULA NeoElection-COL-3-CTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-CTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-CTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 52 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 58/58 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 61 transition count 58
Applied a total of 6 rules in 17 ms. Remains 61 /67 variables (removed 6) and now considering 58/58 (removed 0) transitions.
[2023-03-14 15:03:23] [INFO ] Flow matrix only has 54 transitions (discarded 4 similar events)
// Phase 1: matrix 54 rows 61 cols
[2023-03-14 15:03:23] [INFO ] Computed 14 place invariants in 24 ms
[2023-03-14 15:03:23] [INFO ] Implicit Places using invariants in 310 ms returned []
[2023-03-14 15:03:23] [INFO ] Flow matrix only has 54 transitions (discarded 4 similar events)
[2023-03-14 15:03:23] [INFO ] Invariant cache hit.
[2023-03-14 15:03:23] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-14 15:03:23] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
[2023-03-14 15:03:23] [INFO ] Flow matrix only has 54 transitions (discarded 4 similar events)
[2023-03-14 15:03:23] [INFO ] Invariant cache hit.
[2023-03-14 15:03:23] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/67 places, 58/58 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 655 ms. Remains : 61/67 places, 58/58 transitions.
Support contains 52 out of 61 places after structural reductions.
[2023-03-14 15:03:23] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2023-03-14 15:03:23] [INFO ] Flatten gal took : 18 ms
FORMULA NeoElection-COL-3-CTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-CTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-CTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-14 15:03:23] [INFO ] Flatten gal took : 23 ms
[2023-03-14 15:03:23] [INFO ] Input system was already deterministic with 58 transitions.
Finished random walk after 35 steps, including 0 resets, run visited all 9 properties in 19 ms. (steps per millisecond=1 )
[2023-03-14 15:03:23] [INFO ] Flatten gal took : 10 ms
[2023-03-14 15:03:23] [INFO ] Flatten gal took : 12 ms
[2023-03-14 15:03:23] [INFO ] Input system was already deterministic with 58 transitions.
Computed a total of 61 stabilizing places and 58 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 61 transition count 58
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 58/58 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 59 transition count 55
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 59 transition count 55
Applied a total of 4 rules in 5 ms. Remains 59 /61 variables (removed 2) and now considering 55/58 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 59/61 places, 55/58 transitions.
[2023-03-14 15:03:23] [INFO ] Flatten gal took : 9 ms
[2023-03-14 15:03:23] [INFO ] Flatten gal took : 11 ms
[2023-03-14 15:03:23] [INFO ] Input system was already deterministic with 55 transitions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 58/58 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 56 transition count 49
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 56 transition count 49
Applied a total of 10 rules in 5 ms. Remains 56 /61 variables (removed 5) and now considering 49/58 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 56/61 places, 49/58 transitions.
[2023-03-14 15:03:23] [INFO ] Flatten gal took : 7 ms
[2023-03-14 15:03:23] [INFO ] Flatten gal took : 9 ms
[2023-03-14 15:03:24] [INFO ] Input system was already deterministic with 49 transitions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 58/58 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 56 transition count 46
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 56 transition count 46
Applied a total of 10 rules in 2 ms. Remains 56 /61 variables (removed 5) and now considering 46/58 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 56/61 places, 46/58 transitions.
[2023-03-14 15:03:24] [INFO ] Flatten gal took : 7 ms
[2023-03-14 15:03:24] [INFO ] Flatten gal took : 6 ms
[2023-03-14 15:03:24] [INFO ] Input system was already deterministic with 46 transitions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 58/58 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 53 transition count 43
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 53 transition count 43
Applied a total of 16 rules in 4 ms. Remains 53 /61 variables (removed 8) and now considering 43/58 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 53/61 places, 43/58 transitions.
[2023-03-14 15:03:24] [INFO ] Flatten gal took : 6 ms
[2023-03-14 15:03:24] [INFO ] Flatten gal took : 7 ms
[2023-03-14 15:03:24] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 61/61 places, 58/58 transitions.
Reduce places removed 3 places and 3 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 55 transition count 55
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 55 transition count 52
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 52 transition count 52
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 14 place count 47 transition count 40
Iterating global reduction 1 with 5 rules applied. Total rules applied 19 place count 47 transition count 40
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 25 place count 44 transition count 37
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 41 transition count 34
Ensure Unique test removed 3 places
Iterating post reduction 1 with 3 rules applied. Total rules applied 31 place count 38 transition count 34
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 34 place count 35 transition count 31
Applied a total of 34 rules in 25 ms. Remains 35 /61 variables (removed 26) and now considering 31/58 (removed 27) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 35/61 places, 31/58 transitions.
[2023-03-14 15:03:24] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-14 15:03:24] [INFO ] Flatten gal took : 5 ms
FORMULA NeoElection-COL-3-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-14 15:03:24] [INFO ] Flatten gal took : 5 ms
[2023-03-14 15:03:24] [INFO ] Input system was already deterministic with 31 transitions.
Support contains 0 out of 35 places (down from 3) after GAL structural reductions.
Starting structural reductions in SI_CTL mode, iteration 0 : 61/61 places, 58/58 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 61 transition count 55
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 58 transition count 55
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 14 place count 50 transition count 40
Iterating global reduction 0 with 8 rules applied. Total rules applied 22 place count 50 transition count 40
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 22 place count 50 transition count 37
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 47 transition count 37
Applied a total of 28 rules in 9 ms. Remains 47 /61 variables (removed 14) and now considering 37/58 (removed 21) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 47/61 places, 37/58 transitions.
[2023-03-14 15:03:24] [INFO ] Flatten gal took : 4 ms
[2023-03-14 15:03:24] [INFO ] Flatten gal took : 5 ms
[2023-03-14 15:03:24] [INFO ] Input system was already deterministic with 37 transitions.
[2023-03-14 15:03:24] [INFO ] Flatten gal took : 11 ms
[2023-03-14 15:03:24] [INFO ] Flatten gal took : 10 ms
[2023-03-14 15:03:24] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-14 15:03:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 61 places, 58 transitions and 254 arcs took 1 ms.
Total runtime 3074 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: 61 NrTr: 58 NrArc: 254)

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

net check time: 0m 0.000sec

init dd package: 0m 3.518sec


RS generation: 0m 0.375sec


-> reachability set: #nodes 17371 (1.7e+04) #states 974,325 (5)



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

checking: AG [AX [AG [[p0<=0 & [p1<=0 & p2<=0]]]]]
normalized: ~ [E [true U EX [E [true U ~ [[[p1<=0 & p2<=0] & p0<=0]]]]]]

abstracting: (p0<=0)
states: 973,974 (5)
abstracting: (p2<=0)
states: 973,968 (5)
abstracting: (p1<=0)
states: 973,971 (5)
.-> the formula is FALSE

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

MC time: 0m 0.069sec

checking: AG [AF [[[[1<=p11 & 1<=p55] | [[1<=p17 & 1<=p59] | [1<=p9 & 1<=p53]]] | [[1<=p7 & 1<=p52] | [[1<=p15 & 1<=p58] | [1<=p13 & 1<=p56]]]]]]
normalized: ~ [E [true U EG [~ [[[[[1<=p13 & 1<=p56] | [1<=p15 & 1<=p58]] | [1<=p7 & 1<=p52]] | [[[1<=p9 & 1<=p53] | [1<=p17 & 1<=p59]] | [1<=p11 & 1<=p55]]]]]]]

abstracting: (1<=p55)
states: 354
abstracting: (1<=p11)
states: 708
abstracting: (1<=p59)
states: 693
abstracting: (1<=p17)
states: 1,407 (3)
abstracting: (1<=p53)
states: 684
abstracting: (1<=p9)
states: 1,386 (3)
abstracting: (1<=p52)
states: 351
abstracting: (1<=p7)
states: 702
abstracting: (1<=p58)
states: 357
abstracting: (1<=p15)
states: 714
abstracting: (1<=p56)
states: 690
abstracting: (1<=p13)
states: 1,398 (3)
..............................
EG iterations: 30
-> the formula is FALSE

FORMULA NeoElection-COL-3-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.936sec

checking: [EX [AX [A [[1<=p50 | [1<=p51 | 1<=p49]] U [[[1<=p11 & 1<=p55] | [[1<=p17 & 1<=p59] | [1<=p9 & 1<=p53]]] | [[1<=p7 & 1<=p52] | [[1<=p15 & 1<=p58] | [1<=p13 & 1<=p56]]]]]]] & AG [EF [EX [[p47<=0 & [p48<=0 & p46<=0]]]]]]
normalized: [~ [E [true U ~ [E [true U EX [[p47<=0 & [p48<=0 & p46<=0]]]]]]] & EX [~ [EX [~ [[~ [EG [~ [[[[[1<=p13 & 1<=p56] | [1<=p15 & 1<=p58]] | [1<=p7 & 1<=p52]] | [[[1<=p9 & 1<=p53] | [1<=p17 & 1<=p59]] | [1<=p11 & 1<=p55]]]]]] & ~ [E [~ [[[[[1<=p13 & 1<=p56] | [1<=p15 & 1<=p58]] | [1<=p7 & 1<=p52]] | [[[1<=p9 & 1<=p53] | [1<=p17 & 1<=p59]] | [1<=p11 & 1<=p55]]]] U [~ [[1<=p50 | [1<=p51 | 1<=p49]]] & ~ [[[[[1<=p13 & 1<=p56] | [1<=p15 & 1<=p58]] | [1<=p7 & 1<=p52]] | [[[1<=p9 & 1<=p53] | [1<=p17 & 1<=p59]] | [1<=p11 & 1<=p55]]]]]]]]]]]]]

abstracting: (1<=p55)
states: 354
abstracting: (1<=p11)
states: 708
abstracting: (1<=p59)
states: 693
abstracting: (1<=p17)
states: 1,407 (3)
abstracting: (1<=p53)
states: 684
abstracting: (1<=p9)
states: 1,386 (3)
abstracting: (1<=p52)
states: 351
abstracting: (1<=p7)
states: 702
abstracting: (1<=p58)
states: 357
abstracting: (1<=p15)
states: 714
abstracting: (1<=p56)
states: 690
abstracting: (1<=p13)
states: 1,398 (3)
abstracting: (1<=p49)
states: 324,313 (5)
abstracting: (1<=p51)
states: 324,306 (5)
abstracting: (1<=p50)
states: 324,309 (5)
abstracting: (1<=p55)
states: 354
abstracting: (1<=p11)
states: 708
abstracting: (1<=p59)
states: 693
abstracting: (1<=p17)
states: 1,407 (3)
abstracting: (1<=p53)
states: 684
abstracting: (1<=p9)
states: 1,386 (3)
abstracting: (1<=p52)
states: 351
abstracting: (1<=p7)
states: 702
abstracting: (1<=p58)
states: 357
abstracting: (1<=p15)
states: 714
abstracting: (1<=p56)
states: 690
abstracting: (1<=p13)
states: 1,398 (3)
abstracting: (1<=p55)
states: 354
abstracting: (1<=p11)
states: 708
abstracting: (1<=p59)
states: 693
abstracting: (1<=p17)
states: 1,407 (3)
abstracting: (1<=p53)
states: 684
abstracting: (1<=p9)
states: 1,386 (3)
abstracting: (1<=p52)
states: 351
abstracting: (1<=p7)
states: 702
abstracting: (1<=p58)
states: 357
abstracting: (1<=p15)
states: 714
abstracting: (1<=p56)
states: 690
abstracting: (1<=p13)
states: 1,398 (3)
..............................
EG iterations: 30
..abstracting: (p46<=0)
states: 651,353 (5)
abstracting: (p48<=0)
states: 651,372 (5)
abstracting: (p47<=0)
states: 651,363 (5)
.-> the formula is FALSE

FORMULA NeoElection-COL-3-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.828sec

checking: AF [[[AF [EX [EF [[p50<=0 & [p51<=0 & p49<=0]]]]] & [[p14<=0 | [p30<=0 | p44<=0]] & [p18<=0 | [p38<=0 | p45<=0]]]] & [[[p16<=0 | [p38<=0 | p45<=0]] & [p12<=0 | [p30<=0 | p44<=0]]] & [[p16<=0 | [p42<=0 | p45<=0]] & [p18<=0 | [p42<=0 | p45<=0]]]]]]
normalized: ~ [EG [~ [[[[[p18<=0 | [p42<=0 | p45<=0]] & [p16<=0 | [p42<=0 | p45<=0]]] & [[p12<=0 | [p30<=0 | p44<=0]] & [p16<=0 | [p38<=0 | p45<=0]]]] & [[[p18<=0 | [p38<=0 | p45<=0]] & [p14<=0 | [p30<=0 | p44<=0]]] & ~ [EG [~ [EX [E [true U [p50<=0 & [p51<=0 & p49<=0]]]]]]]]]]]]

abstracting: (p49<=0)
states: 650,012 (5)
abstracting: (p51<=0)
states: 650,019 (5)
abstracting: (p50<=0)
states: 650,016 (5)
..
EG iterations: 1
abstracting: (p44<=0)
states: 650,016 (5)
abstracting: (p30<=0)
states: 797,691 (5)
abstracting: (p14<=0)
states: 266,457 (5)
abstracting: (p45<=0)
states: 650,019 (5)
abstracting: (p38<=0)
states: 797,691 (5)
abstracting: (p18<=0)
states: 266,466 (5)
abstracting: (p45<=0)
states: 650,019 (5)
abstracting: (p38<=0)
states: 797,691 (5)
abstracting: (p16<=0)
states: 265,773 (5)
abstracting: (p44<=0)
states: 650,016 (5)
abstracting: (p30<=0)
states: 797,691 (5)
abstracting: (p12<=0)
states: 265,767 (5)
abstracting: (p45<=0)
states: 650,019 (5)
abstracting: (p42<=0)
states: 797,691 (5)
abstracting: (p16<=0)
states: 265,773 (5)
abstracting: (p45<=0)
states: 650,019 (5)
abstracting: (p42<=0)
states: 797,691 (5)
abstracting: (p18<=0)
states: 266,466 (5)
.....................................................................
EG iterations: 69
-> the formula is TRUE

FORMULA NeoElection-COL-3-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.379sec

checking: [EG [[[[[[1<=p3 & [1<=p23 & 1<=p43]] | [1<=p39 & 1<=p45]] | [[1<=p6 & [1<=p31 & 1<=p44]] | [[1<=p5 & [1<=p27 & 1<=p44]] | [1<=p35 & 1<=p45]]]] | [[[1<=p4 & [1<=p19 & 1<=p43]] | [1<=p6 & [1<=p27 & 1<=p44]]] | [[1<=p3 & [1<=p19 & 1<=p43]] | [[1<=p4 & [1<=p23 & 1<=p43]] | [1<=p5 & [1<=p31 & 1<=p44]]]]]] & AG [A [[[[[[1<=p5 & 1<=p14] & [1<=p34 & 1<=p44]] | [[[1<=p4 & 1<=p8] & [1<=p22 & 1<=p43]] | [[1<=p4 & 1<=p10] & [1<=p22 & 1<=p43]]]] | [[[1<=p4 & 1<=p10] & [1<=p26 & 1<=p43]] | [[[1<=p3 & 1<=p8] & [1<=p22 & 1<=p43]] | [[1<=p6 & 1<=p14] & [1<=p34 & 1<=p44]]]]] | [[[[1<=p3 & 1<=p10] & [1<=p26 & 1<=p43]] | [[[1<=p5 & 1<=p12] & [1<=p34 & 1<=p44]] | [[1<=p3 & 1<=p10] & [1<=p22 & 1<=p43]]]] | [[[1<=p3 & 1<=p8] & [1<=p26 & 1<=p43]] | [[[1<=p6 & 1<=p12] & [1<=p34 & 1<=p44]] | [[1<=p4 & 1<=p8] & [1<=p26 & 1<=p43]]]]]] U [1<=p47 | [1<=p48 | 1<=p46]]]]]] | E [[AX [[[[[[1<=p5 & 1<=p14] & [1<=p34 & 1<=p44]] | [[[1<=p4 & 1<=p8] & [1<=p22 & 1<=p43]] | [[1<=p4 & 1<=p10] & [1<=p22 & 1<=p43]]]] | [[[1<=p4 & 1<=p10] & [1<=p26 & 1<=p43]] | [[[1<=p3 & 1<=p8] & [1<=p22 & 1<=p43]] | [[1<=p6 & 1<=p14] & [1<=p34 & 1<=p44]]]]] | [[[[1<=p3 & 1<=p10] & [1<=p26 & 1<=p43]] | [[[1<=p5 & 1<=p12] & [1<=p34 & 1<=p44]] | [[1<=p3 & 1<=p10] & [1<=p22 & 1<=p43]]]] | [[[1<=p3 & 1<=p8] & [1<=p26 & 1<=p43]] | [[[1<=p6 & 1<=p12] & [1<=p34 & 1<=p44]] | [[1<=p4 & 1<=p8] & [1<=p26 & 1<=p43]]]]]]] | AX [[EX [[[[1<=p20 & 1<=p43] | [[1<=p32 & 1<=p44] | [1<=p24 & 1<=p43]]] | [[1<=p36 & 1<=p45] | [[1<=p40 & 1<=p45] | [1<=p28 & 1<=p44]]]]] | AF [[1<=p47 | [1<=p48 | 1<=p46]]]]]] U AG [AF [[[[[[1<=p5 & 1<=p14] & [1<=p34 & 1<=p44]] | [[[1<=p4 & 1<=p8] & [1<=p22 & 1<=p43]] | [[1<=p4 & 1<=p10] & [1<=p22 & 1<=p43]]]] | [[[1<=p4 & 1<=p10] & [1<=p26 & 1<=p43]] | [[[1<=p3 & 1<=p8] & [1<=p22 & 1<=p43]] | [[1<=p6 & 1<=p14] & [1<=p34 & 1<=p44]]]]] | [[[[1<=p3 & 1<=p10] & [1<=p26 & 1<=p43]] | [[[1<=p5 & 1<=p12] & [1<=p34 & 1<=p44]] | [[1<=p3 & 1<=p10] & [1<=p22 & 1<=p43]]]] | [[[1<=p26 & 1<=p43] & [1<=p3 & 1<=p8]] | [[[1<=p6 & 1<=p12] & [1<=p34 & 1<=p44]] | [[1<=p4 & 1<=p8] & [1<=p26 & 1<=p43]]]]]]]]]]
normalized: [E [[~ [EX [~ [[~ [EG [~ [[1<=p47 | [1<=p48 | 1<=p46]]]]] | EX [[[[[1<=p28 & 1<=p44] | [1<=p40 & 1<=p45]] | [1<=p36 & 1<=p45]] | [[[1<=p24 & 1<=p43] | [1<=p32 & 1<=p44]] | [1<=p20 & 1<=p43]]]]]]]] | ~ [EX [~ [[[[[[[1<=p26 & 1<=p43] & [1<=p4 & 1<=p8]] | [[1<=p34 & 1<=p44] & [1<=p6 & 1<=p12]]] | [[1<=p26 & 1<=p43] & [1<=p3 & 1<=p8]]] | [[[[1<=p22 & 1<=p43] & [1<=p3 & 1<=p10]] | [[1<=p34 & 1<=p44] & [1<=p5 & 1<=p12]]] | [[1<=p26 & 1<=p43] & [1<=p3 & 1<=p10]]]] | [[[[[1<=p34 & 1<=p44] & [1<=p6 & 1<=p14]] | [[1<=p22 & 1<=p43] & [1<=p3 & 1<=p8]]] | [[1<=p26 & 1<=p43] & [1<=p4 & 1<=p10]]] | [[[[1<=p22 & 1<=p43] & [1<=p4 & 1<=p10]] | [[1<=p22 & 1<=p43] & [1<=p4 & 1<=p8]]] | [[1<=p34 & 1<=p44] & [1<=p5 & 1<=p14]]]]]]]]] U ~ [E [true U EG [~ [[[[[[[1<=p26 & 1<=p43] & [1<=p4 & 1<=p8]] | [[1<=p34 & 1<=p44] & [1<=p6 & 1<=p12]]] | [[1<=p3 & 1<=p8] & [1<=p26 & 1<=p43]]] | [[[[1<=p22 & 1<=p43] & [1<=p3 & 1<=p10]] | [[1<=p34 & 1<=p44] & [1<=p5 & 1<=p12]]] | [[1<=p26 & 1<=p43] & [1<=p3 & 1<=p10]]]] | [[[[[1<=p34 & 1<=p44] & [1<=p6 & 1<=p14]] | [[1<=p22 & 1<=p43] & [1<=p3 & 1<=p8]]] | [[1<=p26 & 1<=p43] & [1<=p4 & 1<=p10]]] | [[[[1<=p22 & 1<=p43] & [1<=p4 & 1<=p10]] | [[1<=p22 & 1<=p43] & [1<=p4 & 1<=p8]]] | [[1<=p34 & 1<=p44] & [1<=p5 & 1<=p14]]]]]]]]]] | EG [[~ [E [true U ~ [[~ [EG [~ [[1<=p47 | [1<=p48 | 1<=p46]]]]] & ~ [E [~ [[1<=p47 | [1<=p48 | 1<=p46]]] U [~ [[[[[[[1<=p26 & 1<=p43] & [1<=p4 & 1<=p8]] | [[1<=p34 & 1<=p44] & [1<=p6 & 1<=p12]]] | [[1<=p26 & 1<=p43] & [1<=p3 & 1<=p8]]] | [[[[1<=p22 & 1<=p43] & [1<=p3 & 1<=p10]] | [[1<=p34 & 1<=p44] & [1<=p5 & 1<=p12]]] | [[1<=p26 & 1<=p43] & [1<=p3 & 1<=p10]]]] | [[[[[1<=p34 & 1<=p44] & [1<=p6 & 1<=p14]] | [[1<=p22 & 1<=p43] & [1<=p3 & 1<=p8]]] | [[1<=p26 & 1<=p43] & [1<=p4 & 1<=p10]]] | [[[[1<=p22 & 1<=p43] & [1<=p4 & 1<=p10]] | [[1<=p22 & 1<=p43] & [1<=p4 & 1<=p8]]] | [[1<=p34 & 1<=p44] & [1<=p5 & 1<=p14]]]]]] & ~ [[1<=p47 | [1<=p48 | 1<=p46]]]]]]]]]] & [[[[[1<=p5 & [1<=p31 & 1<=p44]] | [1<=p4 & [1<=p23 & 1<=p43]]] | [1<=p3 & [1<=p19 & 1<=p43]]] | [[1<=p6 & [1<=p27 & 1<=p44]] | [1<=p4 & [1<=p19 & 1<=p43]]]] | [[[[1<=p35 & 1<=p45] | [1<=p5 & [1<=p27 & 1<=p44]]] | [1<=p6 & [1<=p31 & 1<=p44]]] | [[1<=p39 & 1<=p45] | [1<=p3 & [1<=p23 & 1<=p43]]]]]]]]

abstracting: (1<=p43)
states: 324,313 (5)
abstracting: (1<=p23)
states: 178,314 (5)
abstracting: (1<=p3)
states: 500,715 (5)
abstracting: (1<=p45)
states: 324,306 (5)
abstracting: (1<=p39)
states: 177,966 (5)
abstracting: (1<=p44)
states: 324,309 (5)
abstracting: (1<=p31)
states: 177,957 (5)
abstracting: (1<=p6)
states: 709,266 (5)
abstracting: (1<=p44)
states: 324,309 (5)
abstracting: (1<=p27)
states: 178,329 (5)
abstracting: (1<=p5)
states: 265,059 (5)
abstracting: (1<=p45)
states: 324,306 (5)
abstracting: (1<=p35)
states: 177,978 (5)
abstracting: (1<=p43)
states: 324,313 (5)
abstracting: (1<=p19)
states: 178,320 (5)
abstracting: (1<=p4)
states: 473,610 (5)
abstracting: (1<=p44)
states: 324,309 (5)
abstracting: (1<=p27)
states: 178,329 (5)
abstracting: (1<=p6)
states: 709,266 (5)
abstracting: (1<=p43)
states: 324,313 (5)
abstracting: (1<=p19)
states: 178,320 (5)
abstracting: (1<=p3)
states: 500,715 (5)
abstracting: (1<=p43)
states: 324,313 (5)
abstracting: (1<=p23)
states: 178,314 (5)
abstracting: (1<=p4)
states: 473,610 (5)
abstracting: (1<=p44)
states: 324,309 (5)
abstracting: (1<=p31)
states: 177,957 (5)
abstracting: (1<=p5)
states: 265,059 (5)
abstracting: (1<=p46)
states: 322,972 (5)
abstracting: (1<=p48)
states: 322,953 (5)
abstracting: (1<=p47)
states: 322,962 (5)
abstracting: (1<=p14)
states: 707,868 (5)
abstracting: (1<=p5)
states: 265,059 (5)
abstracting: (1<=p44)
states: 324,309 (5)
abstracting: (1<=p34)
states: 176,634 (5)
abstracting: (1<=p8)
states: 708,564 (5)
abstracting: (1<=p4)
states: 473,610 (5)
abstracting: (1<=p43)
states: 324,313 (5)
abstracting: (1<=p22)
states: 176,634 (5)
abstracting: (1<=p10)
states: 707,880 (5)
abstracting: (1<=p4)
states: 473,610 (5)
abstracting: (1<=p43)
states: 324,313 (5)
abstracting: (1<=p22)
states: 176,634 (5)
abstracting: (1<=p10)
states: 707,880 (5)
abstracting: (1<=p4)
states: 473,610 (5)
abstracting: (1<=p43)
states: 324,313 (5)
abstracting: (1<=p26)
states: 176,634 (5)
abstracting: (1<=p8)
states: 708,564 (5)
abstracting: (1<=p3)
states: 500,715 (5)
abstracting: (1<=p43)
states: 324,313 (5)
abstracting: (1<=p22)
states: 176,634 (5)
abstracting: (1<=p14)
states: 707,868 (5)
abstracting: (1<=p6)
states: 709,266 (5)
abstracting: (1<=p44)
states: 324,309 (5)
abstracting: (1<=p34)
states: 176,634 (5)
abstracting: (1<=p10)
states: 707,880 (5)
abstracting: (1<=p3)
states: 500,715 (5)
abstracting: (1<=p43)
states: 324,313 (5)
abstracting: (1<=p26)
states: 176,634 (5)
abstracting: (1<=p12)
states: 708,558 (5)
abstracting: (1<=p5)
states: 265,059 (5)
abstracting: (1<=p44)
states: 324,309 (5)
abstracting: (1<=p34)
states: 176,634 (5)
abstracting: (1<=p10)
states: 707,880 (5)
abstracting: (1<=p3)
states: 500,715 (5)
abstracting: (1<=p43)
states: 324,313 (5)
abstracting: (1<=p22)
states: 176,634 (5)
abstracting: (1<=p8)
states: 708,564 (5)
abstracting: (1<=p3)
states: 500,715 (5)
abstracting: (1<=p43)
states: 324,313 (5)
abstracting: (1<=p26)
states: 176,634 (5)
abstracting: (1<=p12)
states: 708,558 (5)
abstracting: (1<=p6)
states: 709,266 (5)
abstracting: (1<=p44)
states: 324,309 (5)
abstracting: (1<=p34)
states: 176,634 (5)
abstracting: (1<=p8)
states: 708,564 (5)
abstracting: (1<=p4)
states: 473,610 (5)
abstracting: (1<=p43)
states: 324,313 (5)
abstracting: (1<=p26)
states: 176,634 (5)
abstracting: (1<=p46)
states: 322,972 (5)
abstracting: (1<=p48)
states: 322,953 (5)
abstracting: (1<=p47)
states: 322,962 (5)
abstracting: (1<=p46)
states: 322,972 (5)
abstracting: (1<=p48)
states: 322,953 (5)
abstracting: (1<=p47)
states: 322,962 (5)
.................
EG iterations: 17
.
EG iterations: 1
abstracting: (1<=p14)
states: 707,868 (5)
abstracting: (1<=p5)
states: 265,059 (5)
abstracting: (1<=p44)
states: 324,309 (5)
abstracting: (1<=p34)
states: 176,634 (5)
abstracting: (1<=p8)
states: 708,564 (5)
abstracting: (1<=p4)
states: 473,610 (5)
abstracting: (1<=p43)
states: 324,313 (5)
abstracting: (1<=p22)
states: 176,634 (5)
abstracting: (1<=p10)
states: 707,880 (5)
abstracting: (1<=p4)
states: 473,610 (5)
abstracting: (1<=p43)
states: 324,313 (5)
abstracting: (1<=p22)
states: 176,634 (5)
abstracting: (1<=p10)
states: 707,880 (5)
abstracting: (1<=p4)
states: 473,610 (5)
abstracting: (1<=p43)
states: 324,313 (5)
abstracting: (1<=p26)
states: 176,634 (5)
abstracting: (1<=p8)
states: 708,564 (5)
abstracting: (1<=p3)
states: 500,715 (5)
abstracting: (1<=p43)
states: 324,313 (5)
abstracting: (1<=p22)
states: 176,634 (5)
abstracting: (1<=p14)
states: 707,868 (5)
abstracting: (1<=p6)
states: 709,266 (5)
abstracting: (1<=p44)
states: 324,309 (5)
abstracting: (1<=p34)
states: 176,634 (5)
abstracting: (1<=p10)
states: 707,880 (5)
abstracting: (1<=p3)
states: 500,715 (5)
abstracting: (1<=p43)
states: 324,313 (5)
abstracting: (1<=p26)
states: 176,634 (5)
abstracting: (1<=p12)
states: 708,558 (5)
abstracting: (1<=p5)
states: 265,059 (5)
abstracting: (1<=p44)
states: 324,309 (5)
abstracting: (1<=p34)
states: 176,634 (5)
abstracting: (1<=p10)
states: 707,880 (5)
abstracting: (1<=p3)
states: 500,715 (5)
abstracting: (1<=p43)
states: 324,313 (5)
abstracting: (1<=p22)
states: 176,634 (5)
abstracting: (1<=p43)
states: 324,313 (5)
abstracting: (1<=p26)
states: 176,634 (5)
abstracting: (1<=p8)
states: 708,564 (5)
abstracting: (1<=p3)
states: 500,715 (5)
abstracting: (1<=p12)
states: 708,558 (5)
abstracting: (1<=p6)
states: 709,266 (5)
abstracting: (1<=p44)
states: 324,309 (5)
abstracting: (1<=p34)
states: 176,634 (5)
abstracting: (1<=p8)
states: 708,564 (5)
abstracting: (1<=p4)
states: 473,610 (5)
abstracting: (1<=p43)
states: 324,313 (5)
abstracting: (1<=p26)
states: 176,634 (5)
..............................................................................
EG iterations: 78
abstracting: (1<=p14)
states: 707,868 (5)
abstracting: (1<=p5)
states: 265,059 (5)
abstracting: (1<=p44)
states: 324,309 (5)
abstracting: (1<=p34)
states: 176,634 (5)
abstracting: (1<=p8)
states: 708,564 (5)
abstracting: (1<=p4)
states: 473,610 (5)
abstracting: (1<=p43)
states: 324,313 (5)
abstracting: (1<=p22)
states: 176,634 (5)
abstracting: (1<=p10)
states: 707,880 (5)
abstracting: (1<=p4)
states: 473,610 (5)
abstracting: (1<=p43)
states: 324,313 (5)
abstracting: (1<=p22)
states: 176,634 (5)
abstracting: (1<=p10)
states: 707,880 (5)
abstracting: (1<=p4)
states: 473,610 (5)
abstracting: (1<=p43)
states: 324,313 (5)
abstracting: (1<=p26)
states: 176,634 (5)
abstracting: (1<=p8)
states: 708,564 (5)
abstracting: (1<=p3)
states: 500,715 (5)
abstracting: (1<=p43)
states: 324,313 (5)
abstracting: (1<=p22)
states: 176,634 (5)
abstracting: (1<=p14)
states: 707,868 (5)
abstracting: (1<=p6)
states: 709,266 (5)
abstracting: (1<=p44)
states: 324,309 (5)
abstracting: (1<=p34)
states: 176,634 (5)
abstracting: (1<=p10)
states: 707,880 (5)
abstracting: (1<=p3)
states: 500,715 (5)
abstracting: (1<=p43)
states: 324,313 (5)
abstracting: (1<=p26)
states: 176,634 (5)
abstracting: (1<=p12)
states: 708,558 (5)
abstracting: (1<=p5)
states: 265,059 (5)
abstracting: (1<=p44)
states: 324,309 (5)
abstracting: (1<=p34)
states: 176,634 (5)
abstracting: (1<=p10)
states: 707,880 (5)
abstracting: (1<=p3)
states: 500,715 (5)
abstracting: (1<=p43)
states: 324,313 (5)
abstracting: (1<=p22)
states: 176,634 (5)
abstracting: (1<=p8)
states: 708,564 (5)
abstracting: (1<=p3)
states: 500,715 (5)
abstracting: (1<=p43)
states: 324,313 (5)
abstracting: (1<=p26)
states: 176,634 (5)
abstracting: (1<=p12)
states: 708,558 (5)
abstracting: (1<=p6)
states: 709,266 (5)
abstracting: (1<=p44)
states: 324,309 (5)
abstracting: (1<=p34)
states: 176,634 (5)
abstracting: (1<=p8)
states: 708,564 (5)
abstracting: (1<=p4)
states: 473,610 (5)
abstracting: (1<=p43)
states: 324,313 (5)
abstracting: (1<=p26)
states: 176,634 (5)
.abstracting: (1<=p43)
states: 324,313 (5)
abstracting: (1<=p20)
states: 176,967 (5)
abstracting: (1<=p44)
states: 324,309 (5)
abstracting: (1<=p32)
states: 176,634 (5)
abstracting: (1<=p43)
states: 324,313 (5)
abstracting: (1<=p24)
states: 176,634 (5)
abstracting: (1<=p45)
states: 324,306 (5)
abstracting: (1<=p36)
states: 176,970 (5)
abstracting: (1<=p45)
states: 324,306 (5)
abstracting: (1<=p40)
states: 176,634 (5)
abstracting: (1<=p44)
states: 324,309 (5)
abstracting: (1<=p28)
states: 176,970 (5)
.abstracting: (1<=p46)
states: 322,972 (5)
abstracting: (1<=p48)
states: 322,953 (5)
abstracting: (1<=p47)
states: 322,962 (5)
.................
EG iterations: 17
.-> the formula is FALSE

FORMULA NeoElection-COL-3-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.249sec

totally nodes used: 4969344 (5.0e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 6226835 13831863 20058698
used/not used/entry size/cache size: 15918657 51190207 16 1024MB
basic ops cache: hits/miss/sum: 1194054 2564190 3758244
used/not used/entry size/cache size: 4145503 12631713 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: 78297 177319 255616
used/not used/entry size/cache size: 175647 8212961 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 62530341
1 4224949
2 319477
3 31178
4 2699
5 212
6 6
7 1
8 1
9 0
>= 10 0

Total processing time: 0m17.132sec


BK_STOP 1678806222414

--------------------
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:2114 (36), effective:110 (1)

initing FirstDep: 0m 0.000sec


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

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

iterations count:86 (1), effective:9 (0)

iterations count:115 (1), effective:3 (0)

iterations count:923 (15), effective:36 (0)

iterations count:2716 (46), effective:152 (2)

iterations count:115 (1), effective:3 (0)

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

iterations count:1154 (19), effective:66 (1)

iterations count:1904 (32), effective:103 (1)

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

tar xzf /home/mcc/BenchKit/INPUTS/NeoElection-COL-3.tgz
mv NeoElection-COL-3 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 ;