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.r170-tall-167838856800122.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 Election2020-PT-none, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838856800122
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 5.9K Feb 25 21:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 25 21:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 21:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 30K Feb 25 21:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Feb 25 21:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 21:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 21:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Feb 25 21:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 37K Mar 5 18:22 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 Election2020-PT-none-CTLFireability-00
FORMULA_NAME Election2020-PT-none-CTLFireability-01
FORMULA_NAME Election2020-PT-none-CTLFireability-02
FORMULA_NAME Election2020-PT-none-CTLFireability-03
FORMULA_NAME Election2020-PT-none-CTLFireability-04
FORMULA_NAME Election2020-PT-none-CTLFireability-05
FORMULA_NAME Election2020-PT-none-CTLFireability-06
FORMULA_NAME Election2020-PT-none-CTLFireability-07
FORMULA_NAME Election2020-PT-none-CTLFireability-08
FORMULA_NAME Election2020-PT-none-CTLFireability-09
FORMULA_NAME Election2020-PT-none-CTLFireability-10
FORMULA_NAME Election2020-PT-none-CTLFireability-11
FORMULA_NAME Election2020-PT-none-CTLFireability-12
FORMULA_NAME Election2020-PT-none-CTLFireability-13
FORMULA_NAME Election2020-PT-none-CTLFireability-14
FORMULA_NAME Election2020-PT-none-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678490380022

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=Election2020-PT-none
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-10 23:19:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-10 23:19:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 23:19:41] [INFO ] Load time of PNML (sax parser for PT used): 31 ms
[2023-03-10 23:19:41] [INFO ] Transformed 53 places.
[2023-03-10 23:19:41] [INFO ] Transformed 102 transitions.
[2023-03-10 23:19:41] [INFO ] Parsed PT model containing 53 places and 102 transitions and 204 arcs in 89 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 8 ms.
Support contains 36 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 102/102 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 51 transition count 51
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 58 place count 46 transition count 46
Iterating global reduction 1 with 5 rules applied. Total rules applied 63 place count 46 transition count 46
Applied a total of 63 rules in 12 ms. Remains 46 /53 variables (removed 7) and now considering 46/102 (removed 56) transitions.
// Phase 1: matrix 46 rows 46 cols
[2023-03-10 23:19:41] [INFO ] Computed 0 place invariants in 6 ms
[2023-03-10 23:19:41] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
[2023-03-10 23:19:41] [INFO ] Invariant cache hit.
[2023-03-10 23:19:41] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-10 23:19:41] [INFO ] Invariant cache hit.
[2023-03-10 23:19:42] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
[2023-03-10 23:19:42] [INFO ] Invariant cache hit.
[2023-03-10 23:19:42] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 46/53 places, 46/102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 503 ms. Remains : 46/53 places, 46/102 transitions.
Support contains 36 out of 46 places after structural reductions.
[2023-03-10 23:19:42] [INFO ] Flatten gal took : 17 ms
[2023-03-10 23:19:42] [INFO ] Flatten gal took : 5 ms
[2023-03-10 23:19:42] [INFO ] Input system was already deterministic with 46 transitions.
Finished random walk after 203 steps, including 3 resets, run visited all 38 properties in 30 ms. (steps per millisecond=6 )
[2023-03-10 23:19:42] [INFO ] Flatten gal took : 3 ms
[2023-03-10 23:19:42] [INFO ] Flatten gal took : 3 ms
[2023-03-10 23:19:42] [INFO ] Input system was already deterministic with 46 transitions.
Computed a total of 46 stabilizing places and 46 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 46 transition count 46
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 2 formulas.
FORMULA Election2020-PT-none-CTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Election2020-PT-none-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 46/46 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 22 transition count 22
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 22 transition count 22
Applied a total of 48 rules in 3 ms. Remains 22 /46 variables (removed 24) and now considering 22/46 (removed 24) transitions.
// Phase 1: matrix 22 rows 22 cols
[2023-03-10 23:19:42] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 23:19:42] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 22/46 places, 22/46 transitions.
[2023-03-10 23:19:42] [INFO ] Flatten gal took : 1 ms
[2023-03-10 23:19:42] [INFO ] Flatten gal took : 1 ms
[2023-03-10 23:19:42] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 46/46 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 22 transition count 22
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 22 transition count 22
Applied a total of 48 rules in 2 ms. Remains 22 /46 variables (removed 24) and now considering 22/46 (removed 24) transitions.
// Phase 1: matrix 22 rows 22 cols
[2023-03-10 23:19:42] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 23:19:42] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 22/46 places, 22/46 transitions.
[2023-03-10 23:19:42] [INFO ] Flatten gal took : 1 ms
[2023-03-10 23:19:42] [INFO ] Flatten gal took : 1 ms
[2023-03-10 23:19:42] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 46/46 places, 46/46 transitions.
Graph (complete) has 0 edges and 46 vertex of which 1 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.1 ms
Discarding 45 places :
Also discarding 45 output transitions
Drop transitions removed 45 transitions
Applied a total of 1 rules in 2 ms. Remains 1 /46 variables (removed 45) and now considering 1/46 (removed 45) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 1/46 places, 1/46 transitions.
[2023-03-10 23:19:42] [INFO ] Flatten gal took : 0 ms
[2023-03-10 23:19:42] [INFO ] Flatten gal took : 0 ms
[2023-03-10 23:19:42] [INFO ] Input system was already deterministic with 1 transitions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 46/46 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 26 transition count 26
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 26 transition count 26
Applied a total of 40 rules in 1 ms. Remains 26 /46 variables (removed 20) and now considering 26/46 (removed 20) transitions.
// Phase 1: matrix 26 rows 26 cols
[2023-03-10 23:19:42] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-10 23:19:42] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 26/46 places, 26/46 transitions.
[2023-03-10 23:19:42] [INFO ] Flatten gal took : 1 ms
[2023-03-10 23:19:42] [INFO ] Flatten gal took : 1 ms
[2023-03-10 23:19:42] [INFO ] Input system was already deterministic with 26 transitions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 46/46 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 21 transition count 21
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 21 transition count 21
Applied a total of 50 rules in 2 ms. Remains 21 /46 variables (removed 25) and now considering 21/46 (removed 25) transitions.
// Phase 1: matrix 21 rows 21 cols
[2023-03-10 23:19:42] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-10 23:19:42] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 21/46 places, 21/46 transitions.
[2023-03-10 23:19:42] [INFO ] Flatten gal took : 1 ms
[2023-03-10 23:19:42] [INFO ] Flatten gal took : 1 ms
[2023-03-10 23:19:42] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 46/46 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 26 transition count 26
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 26 transition count 26
Applied a total of 40 rules in 1 ms. Remains 26 /46 variables (removed 20) and now considering 26/46 (removed 20) transitions.
// Phase 1: matrix 26 rows 26 cols
[2023-03-10 23:19:42] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 23:19:42] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 26/46 places, 26/46 transitions.
[2023-03-10 23:19:42] [INFO ] Flatten gal took : 1 ms
[2023-03-10 23:19:42] [INFO ] Flatten gal took : 1 ms
[2023-03-10 23:19:42] [INFO ] Input system was already deterministic with 26 transitions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 46/46 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 25 transition count 25
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 25 transition count 25
Applied a total of 42 rules in 2 ms. Remains 25 /46 variables (removed 21) and now considering 25/46 (removed 21) transitions.
// Phase 1: matrix 25 rows 25 cols
[2023-03-10 23:19:42] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 23:19:42] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 25/46 places, 25/46 transitions.
[2023-03-10 23:19:42] [INFO ] Flatten gal took : 1 ms
[2023-03-10 23:19:42] [INFO ] Flatten gal took : 1 ms
[2023-03-10 23:19:42] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 46/46 places, 46/46 transitions.
Graph (complete) has 0 edges and 46 vertex of which 6 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.0 ms
Discarding 40 places :
Also discarding 40 output transitions
Drop transitions removed 40 transitions
Applied a total of 1 rules in 1 ms. Remains 6 /46 variables (removed 40) and now considering 6/46 (removed 40) transitions.
// Phase 1: matrix 6 rows 6 cols
[2023-03-10 23:19:42] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-10 23:19:42] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 6/46 places, 6/46 transitions.
[2023-03-10 23:19:42] [INFO ] Flatten gal took : 1 ms
[2023-03-10 23:19:42] [INFO ] Flatten gal took : 1 ms
[2023-03-10 23:19:42] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 46/46 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 25 transition count 25
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 25 transition count 25
Applied a total of 42 rules in 1 ms. Remains 25 /46 variables (removed 21) and now considering 25/46 (removed 21) transitions.
// Phase 1: matrix 25 rows 25 cols
[2023-03-10 23:19:42] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 23:19:42] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63 ms. Remains : 25/46 places, 25/46 transitions.
[2023-03-10 23:19:42] [INFO ] Flatten gal took : 1 ms
[2023-03-10 23:19:42] [INFO ] Flatten gal took : 1 ms
[2023-03-10 23:19:42] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 46/46 places, 46/46 transitions.
Graph (complete) has 0 edges and 46 vertex of which 1 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.0 ms
Discarding 45 places :
Also discarding 45 output transitions
Drop transitions removed 45 transitions
Applied a total of 1 rules in 1 ms. Remains 1 /46 variables (removed 45) and now considering 1/46 (removed 45) transitions.
// Phase 1: matrix 1 rows 1 cols
[2023-03-10 23:19:42] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 23:19:42] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 1/46 places, 1/46 transitions.
[2023-03-10 23:19:42] [INFO ] Flatten gal took : 0 ms
[2023-03-10 23:19:42] [INFO ] Flatten gal took : 0 ms
[2023-03-10 23:19:42] [INFO ] Input system was already deterministic with 1 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 46/46 places, 46/46 transitions.
Graph (complete) has 0 edges and 46 vertex of which 1 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.0 ms
Discarding 45 places :
Also discarding 45 output transitions
Drop transitions removed 45 transitions
Applied a total of 1 rules in 0 ms. Remains 1 /46 variables (removed 45) and now considering 1/46 (removed 45) transitions.
// Phase 1: matrix 1 rows 1 cols
[2023-03-10 23:19:42] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-10 23:19:42] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 1/46 places, 1/46 transitions.
[2023-03-10 23:19:42] [INFO ] Flatten gal took : 0 ms
[2023-03-10 23:19:42] [INFO ] Flatten gal took : 0 ms
[2023-03-10 23:19:42] [INFO ] Input system was already deterministic with 1 transitions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 46/46 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 29 transition count 29
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 29 transition count 29
Applied a total of 34 rules in 1 ms. Remains 29 /46 variables (removed 17) and now considering 29/46 (removed 17) transitions.
// Phase 1: matrix 29 rows 29 cols
[2023-03-10 23:19:42] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 23:19:42] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50 ms. Remains : 29/46 places, 29/46 transitions.
[2023-03-10 23:19:42] [INFO ] Flatten gal took : 1 ms
[2023-03-10 23:19:42] [INFO ] Flatten gal took : 1 ms
[2023-03-10 23:19:42] [INFO ] Input system was already deterministic with 29 transitions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 46/46 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 21 transition count 21
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 21 transition count 21
Applied a total of 50 rules in 1 ms. Remains 21 /46 variables (removed 25) and now considering 21/46 (removed 25) transitions.
// Phase 1: matrix 21 rows 21 cols
[2023-03-10 23:19:42] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-10 23:19:42] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57 ms. Remains : 21/46 places, 21/46 transitions.
[2023-03-10 23:19:42] [INFO ] Flatten gal took : 1 ms
[2023-03-10 23:19:42] [INFO ] Flatten gal took : 0 ms
[2023-03-10 23:19:42] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 46/46 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 26 transition count 26
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 26 transition count 26
Applied a total of 40 rules in 2 ms. Remains 26 /46 variables (removed 20) and now considering 26/46 (removed 20) transitions.
// Phase 1: matrix 26 rows 26 cols
[2023-03-10 23:19:42] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 23:19:42] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 26/46 places, 26/46 transitions.
[2023-03-10 23:19:42] [INFO ] Flatten gal took : 1 ms
[2023-03-10 23:19:42] [INFO ] Flatten gal took : 2 ms
[2023-03-10 23:19:42] [INFO ] Input system was already deterministic with 26 transitions.
[2023-03-10 23:19:42] [INFO ] Flatten gal took : 1 ms
[2023-03-10 23:19:42] [INFO ] Flatten gal took : 3 ms
[2023-03-10 23:19:42] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 1 ms.
[2023-03-10 23:19:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 46 places, 46 transitions and 46 arcs took 0 ms.
Total runtime 1495 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: 46 NrTr: 46 NrArc: 46)

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

net check time: 0m 0.000sec

init dd package: 0m 2.719sec


RS generation: 0m 0.002sec


-> reachability set: #nodes 46 (4.6e+01) #states 4,007,719,883,243,520 (15)



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

checking: EG [1<=p16]
normalized: EG [1<=p16]

abstracting: (1<=p16)
states: 3,206,175,906,594,816 (15)
...........................................................
EG iterations: 59
-> the formula is FALSE

FORMULA Election2020-PT-none-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.026sec

checking: AX [EF [20<=p34]]
normalized: ~ [EX [~ [E [true U 20<=p34]]]]

abstracting: (20<=p34)
states: 2,003,859,941,621,760 (15)
.-> the formula is FALSE

FORMULA Election2020-PT-none-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EG [3<=p23]
normalized: EG [3<=p23]

abstracting: (3<=p23)
states: 2,003,859,941,621,760 (15)
...........................................................
EG iterations: 59
-> the formula is FALSE

FORMULA Election2020-PT-none-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.025sec

checking: EG [14<=p27]
normalized: EG [14<=p27]

abstracting: (14<=p27)
states: 2,003,859,941,621,760 (15)
...........................................................
EG iterations: 59
-> the formula is FALSE

FORMULA Election2020-PT-none-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

checking: AX [AG [EF [[p35<=3 & p37<=10]]]]
normalized: ~ [EX [E [true U ~ [E [true U [p35<=3 & p37<=10]]]]]]

abstracting: (p37<=10)
states: 2,003,859,941,621,760 (15)
abstracting: (p35<=3)
states: 2,003,859,941,621,760 (15)
.-> the formula is TRUE

FORMULA Election2020-PT-none-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AF [AG [AX [[p25<=5 & p42<=4]]]]
normalized: ~ [EG [E [true U EX [~ [[p25<=5 & p42<=4]]]]]]

abstracting: (p42<=4)
states: 2,003,859,941,621,760 (15)
abstracting: (p25<=5)
states: 2,003,859,941,621,760 (15)
...........................................................
EG iterations: 58
-> the formula is TRUE

FORMULA Election2020-PT-none-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.037sec

checking: AX [AF [E [1<=p16 U [EG [15<=p29] | EF [13<=p41]]]]]
normalized: ~ [EX [EG [~ [E [1<=p16 U [E [true U 13<=p41] | EG [15<=p29]]]]]]]

abstracting: (15<=p29)
states: 2,003,859,941,621,760 (15)
...........................................................
EG iterations: 59
abstracting: (13<=p41)
states: 2,003,859,941,621,760 (15)
abstracting: (1<=p16)
states: 3,206,175,906,594,816 (15)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA Election2020-PT-none-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

checking: AG [~ [A [EX [[6<=p14 & EX [9<=p0]]] U ~ [[AX [6<=p39] | [[7<=p33 & 3<=p40] | p8<=28]]]]]]
normalized: ~ [E [true U [~ [E [[[[7<=p33 & 3<=p40] | p8<=28] | ~ [EX [~ [6<=p39]]]] U [~ [EX [[6<=p14 & EX [9<=p0]]]] & [[[7<=p33 & 3<=p40] | p8<=28] | ~ [EX [~ [6<=p39]]]]]]] & ~ [EG [[[[7<=p33 & 3<=p40] | p8<=28] | ~ [EX [~ [6<=p39]]]]]]]]]

abstracting: (6<=p39)
states: 2,003,859,941,621,760 (15)
.abstracting: (p8<=28)
states: 2,003,859,941,621,760 (15)
abstracting: (3<=p40)
states: 2,003,859,941,621,760 (15)
abstracting: (7<=p33)
states: 2,003,859,941,621,760 (15)
.
EG iterations: 1
abstracting: (6<=p39)
states: 2,003,859,941,621,760 (15)
.abstracting: (p8<=28)
states: 2,003,859,941,621,760 (15)
abstracting: (3<=p40)
states: 2,003,859,941,621,760 (15)
abstracting: (7<=p33)
states: 2,003,859,941,621,760 (15)
abstracting: (9<=p0)
states: 2,003,859,941,621,760 (15)
.abstracting: (6<=p14)
states: 2,003,859,941,621,760 (15)
.abstracting: (6<=p39)
states: 2,003,859,941,621,760 (15)
.abstracting: (p8<=28)
states: 2,003,859,941,621,760 (15)
abstracting: (3<=p40)
states: 2,003,859,941,621,760 (15)
abstracting: (7<=p33)
states: 2,003,859,941,621,760 (15)
-> the formula is FALSE

FORMULA Election2020-PT-none-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: AX [[E [E [4<=p26 U [38<=p38 | [7<=p33 | 10<=p22]]] U 10<=p44] | p3<=5]]
normalized: ~ [EX [~ [[E [E [4<=p26 U [[7<=p33 | 10<=p22] | 38<=p38]] U 10<=p44] | p3<=5]]]]

abstracting: (p3<=5)
states: 2,003,859,941,621,760 (15)
abstracting: (10<=p44)
states: 2,003,859,941,621,760 (15)
abstracting: (38<=p38)
states: 2,003,859,941,621,760 (15)
abstracting: (10<=p22)
states: 2,003,859,941,621,760 (15)
abstracting: (7<=p33)
states: 2,003,859,941,621,760 (15)
abstracting: (4<=p26)
states: 2,003,859,941,621,760 (15)
.-> the formula is FALSE

FORMULA Election2020-PT-none-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EG [E [~ [[EF [4<=p35] & ~ [[10<=p20 | [13<=p41 | AG [38<=p38]]]]]] U [29<=p8 & 1<=p16]]]
normalized: EG [E [~ [[~ [[[~ [E [true U ~ [38<=p38]]] | 13<=p41] | 10<=p20]] & E [true U 4<=p35]]] U [29<=p8 & 1<=p16]]]

abstracting: (1<=p16)
states: 3,206,175,906,594,816 (15)
abstracting: (29<=p8)
states: 2,003,859,941,621,760 (15)
abstracting: (4<=p35)
states: 2,003,859,941,621,760 (15)
abstracting: (10<=p20)
states: 2,003,859,941,621,760 (15)
abstracting: (13<=p41)
states: 2,003,859,941,621,760 (15)
abstracting: (38<=p38)
states: 2,003,859,941,621,760 (15)
..........................................................
EG iterations: 58
-> the formula is FALSE

FORMULA Election2020-PT-none-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.028sec

checking: AX [[[p17<=9 | AX [10<=p22]] | [EG [1<=p24] | [A [3<=p45 U 10<=p17] & AF [3<=p23]]]]]
normalized: ~ [EX [~ [[[[~ [EG [~ [3<=p23]]] & [~ [EG [~ [10<=p17]]] & ~ [E [~ [10<=p17] U [~ [3<=p45] & ~ [10<=p17]]]]]] | EG [1<=p24]] | [~ [EX [~ [10<=p22]]] | p17<=9]]]]]

abstracting: (p17<=9)
states: 2,003,859,941,621,760 (15)
abstracting: (10<=p22)
states: 2,003,859,941,621,760 (15)
.abstracting: (1<=p24)
states: 3,339,766,569,369,600 (15)
...........................................................
EG iterations: 59
abstracting: (10<=p17)
states: 2,003,859,941,621,760 (15)
abstracting: (3<=p45)
states: 2,003,859,941,621,760 (15)
abstracting: (10<=p17)
states: 2,003,859,941,621,760 (15)
abstracting: (10<=p17)
states: 2,003,859,941,621,760 (15)
.
EG iterations: 1
abstracting: (3<=p23)
states: 2,003,859,941,621,760 (15)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA Election2020-PT-none-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.040sec

checking: [AG [[AX [[p7<=2 & 4<=p11]] & [[EF [p18<=10] | AF [p41<=12]] & AG [10<=p20]]]] | EX [~ [E [EF [15<=p29] U [p13<=5 | 11<=p37]]]]]
normalized: [EX [~ [E [E [true U 15<=p29] U [p13<=5 | 11<=p37]]]] | ~ [E [true U ~ [[[~ [E [true U ~ [10<=p20]]] & [~ [EG [~ [p41<=12]]] | E [true U p18<=10]]] & ~ [EX [~ [[p7<=2 & 4<=p11]]]]]]]]]

abstracting: (4<=p11)
states: 2,003,859,941,621,760 (15)
abstracting: (p7<=2)
states: 2,003,859,941,621,760 (15)
.abstracting: (p18<=10)
states: 2,003,859,941,621,760 (15)
abstracting: (p41<=12)
states: 2,003,859,941,621,760 (15)
...........................................................
EG iterations: 59
abstracting: (10<=p20)
states: 2,003,859,941,621,760 (15)
abstracting: (11<=p37)
states: 2,003,859,941,621,760 (15)
abstracting: (p13<=5)
states: 2,003,859,941,621,760 (15)
abstracting: (15<=p29)
states: 2,003,859,941,621,760 (15)
.-> the formula is FALSE

FORMULA Election2020-PT-none-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: EG [E [12<=p43 U [[~ [EF [4<=p11]] | EX [[12<=p43 | 16<=p9]]] & [EF [38<=p38] | [1<=p24 | [A [6<=p39 U 20<=p12] & EX [29<=p28]]]]]]]
normalized: EG [E [12<=p43 U [[[[EX [29<=p28] & [~ [EG [~ [20<=p12]]] & ~ [E [~ [20<=p12] U [~ [6<=p39] & ~ [20<=p12]]]]]] | 1<=p24] | E [true U 38<=p38]] & [EX [[12<=p43 | 16<=p9]] | ~ [E [true U 4<=p11]]]]]]

abstracting: (4<=p11)
states: 2,003,859,941,621,760 (15)
abstracting: (16<=p9)
states: 2,003,859,941,621,760 (15)
abstracting: (12<=p43)
states: 2,003,859,941,621,760 (15)
.abstracting: (38<=p38)
states: 2,003,859,941,621,760 (15)
abstracting: (1<=p24)
states: 3,339,766,569,369,600 (15)
abstracting: (20<=p12)
states: 2,003,859,941,621,760 (15)
abstracting: (6<=p39)
states: 2,003,859,941,621,760 (15)
abstracting: (20<=p12)
states: 2,003,859,941,621,760 (15)
abstracting: (20<=p12)
states: 2,003,859,941,621,760 (15)
.
EG iterations: 1
abstracting: (29<=p28)
states: 2,003,859,941,621,760 (15)
.abstracting: (12<=p43)
states: 2,003,859,941,621,760 (15)
...........................................................
EG iterations: 59
-> the formula is FALSE

FORMULA Election2020-PT-none-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.080sec

checking: E [[~ [[AX [AX [6<=p14]] | A [p45<=2 U AF [6<=p25]]]] & [EX [4<=p26] & [AF [6<=p25] | [EX [[p30<=2 & AG [4<=p10]]] | AF [[AG [20<=p12] & ~ [A [3<=p23 U 3<=p30]]]]]]]] U EG [3<=p7]]
normalized: E [[[[[~ [EG [~ [[~ [[~ [EG [~ [3<=p30]]] & ~ [E [~ [3<=p30] U [~ [3<=p23] & ~ [3<=p30]]]]]] & ~ [E [true U ~ [20<=p12]]]]]]] | EX [[~ [E [true U ~ [4<=p10]]] & p30<=2]]] | ~ [EG [~ [6<=p25]]]] & EX [4<=p26]] & ~ [[[~ [EG [EG [~ [6<=p25]]]] & ~ [E [EG [~ [6<=p25]] U [~ [p45<=2] & EG [~ [6<=p25]]]]]] | ~ [EX [EX [~ [6<=p14]]]]]]] U EG [3<=p7]]

abstracting: (3<=p7)
states: 2,003,859,941,621,760 (15)
...........................................................
EG iterations: 59
abstracting: (6<=p14)
states: 2,003,859,941,621,760 (15)
..abstracting: (6<=p25)
states: 2,003,859,941,621,760 (15)
.
EG iterations: 1
abstracting: (p45<=2)
states: 2,003,859,941,621,760 (15)
abstracting: (6<=p25)
states: 2,003,859,941,621,760 (15)
.
EG iterations: 1
abstracting: (6<=p25)
states: 2,003,859,941,621,760 (15)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (4<=p26)
states: 2,003,859,941,621,760 (15)
.abstracting: (6<=p25)
states: 2,003,859,941,621,760 (15)
.
EG iterations: 1
abstracting: (p30<=2)
states: 2,003,859,941,621,760 (15)
abstracting: (4<=p10)
states: 2,003,859,941,621,760 (15)
.abstracting: (20<=p12)
states: 2,003,859,941,621,760 (15)
abstracting: (3<=p30)
states: 2,003,859,941,621,760 (15)
abstracting: (3<=p23)
states: 2,003,859,941,621,760 (15)
abstracting: (3<=p30)
states: 2,003,859,941,621,760 (15)
abstracting: (3<=p30)
states: 2,003,859,941,621,760 (15)
.
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

FORMULA Election2020-PT-none-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.028sec

totally nodes used: 530237 (5.3e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 502674 512175 1014849
used/not used/entry size/cache size: 1000404 66108460 16 1024MB
basic ops cache: hits/miss/sum: 99059 95161 194220
used/not used/entry size/cache size: 176762 16600454 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: 1035 971 2006
used/not used/entry size/cache size: 970 8387638 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 66708354
1 301674
2 76727
3 17306
4 3355
5 578
6 130
7 162
8 343
9 156
>= 10 79

Total processing time: 0m 4.674sec


BK_STOP 1678490388629

--------------------
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:104 (2), effective:58 (1)

initing FirstDep: 0m 0.000sec


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

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

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

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

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

iterations count:56 (1), effective:10 (0)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

iterations count:47 (1), effective:1 (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="Election2020-PT-none"
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 Election2020-PT-none, 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 r170-tall-167838856800122"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Election2020-PT-none.tgz
mv Election2020-PT-none 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 ;