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.r490-tall-167912709601137.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 UtilityControlRoom-PT-Z2T4N06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912709601137
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 968K
-rw-r--r-- 1 mcc users 18K Feb 26 14:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 26 14:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 29K Feb 26 14:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 146K Feb 26 14:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 17:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 40K Feb 25 17:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 17:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 25 17:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 43K Feb 26 14:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 218K Feb 26 14:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 33K Feb 26 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 146K Feb 26 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 17:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K Feb 25 17:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 70K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679379721946

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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-PT-Z2T4N06
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-21 06:22:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 06:22:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 06:22:03] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2023-03-21 06:22:03] [INFO ] Transformed 106 places.
[2023-03-21 06:22:03] [INFO ] Transformed 162 transitions.
[2023-03-21 06:22:03] [INFO ] Parsed PT model containing 106 places and 162 transitions and 510 arcs in 97 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Ensure Unique test removed 24 transitions
Reduce redundant transitions removed 24 transitions.
Support contains 106 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 138/138 transitions.
Applied a total of 0 rules in 8 ms. Remains 106 /106 variables (removed 0) and now considering 138/138 (removed 0) transitions.
// Phase 1: matrix 138 rows 106 cols
[2023-03-21 06:22:03] [INFO ] Computed 15 place invariants in 15 ms
[2023-03-21 06:22:03] [INFO ] Implicit Places using invariants in 165 ms returned []
[2023-03-21 06:22:03] [INFO ] Invariant cache hit.
[2023-03-21 06:22:03] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2023-03-21 06:22:03] [INFO ] Invariant cache hit.
[2023-03-21 06:22:03] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 396 ms. Remains : 106/106 places, 138/138 transitions.
Support contains 106 out of 106 places after structural reductions.
[2023-03-21 06:22:04] [INFO ] Flatten gal took : 39 ms
[2023-03-21 06:22:04] [INFO ] Flatten gal took : 14 ms
[2023-03-21 06:22:04] [INFO ] Input system was already deterministic with 138 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 572 ms. (steps per millisecond=17 ) properties (out of 83) seen :33
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 50) seen :0
Running SMT prover for 50 properties.
[2023-03-21 06:22:05] [INFO ] Invariant cache hit.
[2023-03-21 06:22:05] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-03-21 06:22:05] [INFO ] After 209ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:46
[2023-03-21 06:22:05] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-03-21 06:22:05] [INFO ] After 189ms SMT Verify possible using all constraints in natural domain returned unsat :50 sat :0
Fused 50 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 3 ms.
Successfully simplified 50 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA UtilityControlRoom-PT-Z2T4N06-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T4N06-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T4N06-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T4N06-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-21 06:22:05] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2023-03-21 06:22:05] [INFO ] Flatten gal took : 14 ms
[2023-03-21 06:22:05] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA UtilityControlRoom-PT-Z2T4N06-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T4N06-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T4N06-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T4N06-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T4N06-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T4N06-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-21 06:22:05] [INFO ] Flatten gal took : 8 ms
[2023-03-21 06:22:05] [INFO ] Input system was already deterministic with 138 transitions.
Support contains 46 out of 106 places (down from 78) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 94 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 94 transition count 126
Applied a total of 24 rules in 8 ms. Remains 94 /106 variables (removed 12) and now considering 126/138 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 94/106 places, 126/138 transitions.
[2023-03-21 06:22:05] [INFO ] Flatten gal took : 7 ms
[2023-03-21 06:22:05] [INFO ] Flatten gal took : 8 ms
[2023-03-21 06:22:05] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 138/138 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 95 transition count 127
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 95 transition count 127
Applied a total of 22 rules in 24 ms. Remains 95 /106 variables (removed 11) and now considering 127/138 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 95/106 places, 127/138 transitions.
[2023-03-21 06:22:05] [INFO ] Flatten gal took : 6 ms
[2023-03-21 06:22:05] [INFO ] Flatten gal took : 9 ms
[2023-03-21 06:22:05] [INFO ] Input system was already deterministic with 127 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 106/106 places, 138/138 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 106 transition count 119
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 47 place count 87 transition count 110
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 47 place count 87 transition count 100
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 67 place count 77 transition count 100
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 68 place count 76 transition count 99
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 76 transition count 99
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 77 place count 72 transition count 95
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 87 place count 67 transition count 90
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 67 transition count 89
Applied a total of 88 rules in 57 ms. Remains 67 /106 variables (removed 39) and now considering 89/138 (removed 49) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 57 ms. Remains : 67/106 places, 89/138 transitions.
[2023-03-21 06:22:05] [INFO ] Flatten gal took : 9 ms
[2023-03-21 06:22:05] [INFO ] Flatten gal took : 5 ms
[2023-03-21 06:22:05] [INFO ] Input system was already deterministic with 89 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 138/138 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 96 transition count 128
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 96 transition count 128
Applied a total of 20 rules in 4 ms. Remains 96 /106 variables (removed 10) and now considering 128/138 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 96/106 places, 128/138 transitions.
[2023-03-21 06:22:05] [INFO ] Flatten gal took : 6 ms
[2023-03-21 06:22:05] [INFO ] Flatten gal took : 7 ms
[2023-03-21 06:22:05] [INFO ] Input system was already deterministic with 128 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 138/138 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 95 transition count 127
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 95 transition count 127
Applied a total of 22 rules in 4 ms. Remains 95 /106 variables (removed 11) and now considering 127/138 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 95/106 places, 127/138 transitions.
[2023-03-21 06:22:06] [INFO ] Flatten gal took : 10 ms
[2023-03-21 06:22:06] [INFO ] Flatten gal took : 6 ms
[2023-03-21 06:22:06] [INFO ] Input system was already deterministic with 127 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 138/138 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 96 transition count 128
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 96 transition count 128
Applied a total of 20 rules in 4 ms. Remains 96 /106 variables (removed 10) and now considering 128/138 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 96/106 places, 128/138 transitions.
[2023-03-21 06:22:06] [INFO ] Flatten gal took : 9 ms
[2023-03-21 06:22:06] [INFO ] Flatten gal took : 6 ms
[2023-03-21 06:22:06] [INFO ] Input system was already deterministic with 128 transitions.
[2023-03-21 06:22:06] [INFO ] Flatten gal took : 6 ms
[2023-03-21 06:22:06] [INFO ] Flatten gal took : 7 ms
[2023-03-21 06:22:06] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-21 06:22:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 106 places, 138 transitions and 414 arcs took 2 ms.
Total runtime 2776 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=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 106 NrTr: 138 NrArc: 414)

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

net check time: 0m 0.000sec

init dd package: 0m 2.872sec


RS generation: 0m 1.026sec


-> reachability set: #nodes 13625 (1.4e+04) #states 27,622,035 (7)



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

checking: [EX [AF [[EG [p75<=p9] & [~ [p90<=p66] | p69<=p32]]]] | AX [1<=0]]
normalized: [~ [EX [~ [1<=0]]] | EX [~ [EG [~ [[EG [p75<=p9] & [~ [p90<=p66] | p69<=p32]]]]]]]

abstracting: (p69<=p32)
states: 22,819,881 (7)
abstracting: (p90<=p66)
states: 17,031,924 (7)
abstracting: (p75<=p9)
states: 357
.......
EG iterations: 7

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

FORMULA UtilityControlRoom-PT-Z2T4N06-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.480sec

checking: EF [EG [AX [[E [p2<=p67 U p88<=p102] | [1<=p94 | [2<=p37 & 3<=p65]]]]]]
normalized: E [true U EG [~ [EX [~ [[E [p2<=p67 U p88<=p102] | [1<=p94 | [2<=p37 & 3<=p65]]]]]]]]

abstracting: (3<=p65)
states: 0
abstracting: (2<=p37)
states: 0
abstracting: (1<=p94)
states: 431,494 (5)
abstracting: (p88<=p102)
states: 16,864,442 (7)
abstracting: (p2<=p67)
states: 25,220,958 (7)
.
EG iterations: 0
-> the formula is TRUE

FORMULA UtilityControlRoom-PT-Z2T4N06-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.012sec

checking: [EF [[EF [~ [p49<=p82]] & [[p57<=1 | ~ [p74<=1]] & [~ [p2<=1] | p69<=p59]]]] | AX [EF [EG [~ [p72<=p38]]]]]
normalized: [~ [EX [~ [E [true U EG [~ [p72<=p38]]]]]] | E [true U [[[p69<=p59 | ~ [p2<=1]] & [p57<=1 | ~ [p74<=1]]] & E [true U ~ [p49<=p82]]]]]

abstracting: (p49<=p82)
states: 27,094,011 (7)
abstracting: (p74<=1)
states: 8,966,265 (6)
abstracting: (p57<=1)
states: 27,622,035 (7)
abstracting: (p2<=1)
states: 27,622,035 (7)
abstracting: (p69<=p59)
states: 22,639,953 (7)
abstracting: (p72<=p38)
states: 22,819,881 (7)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA UtilityControlRoom-PT-Z2T4N06-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.786sec

checking: EG [[[A [[p96<=p89 & p40<=p65] U ~ [p93<=p43]] | p37<=p22] | [p80<=p77 | ~ [p86<=1]]]]
normalized: EG [[[p80<=p77 | ~ [p86<=1]] | [p37<=p22 | [~ [EG [p93<=p43]] & ~ [E [p93<=p43 U [p93<=p43 & ~ [[p96<=p89 & p40<=p65]]]]]]]]]

abstracting: (p40<=p65)
states: 26,775,315 (7)
abstracting: (p96<=p89)
states: 27,190,541 (7)
abstracting: (p93<=p43)
states: 17,031,924 (7)
abstracting: (p93<=p43)
states: 17,031,924 (7)
abstracting: (p93<=p43)
states: 17,031,924 (7)
.
EG iterations: 1
abstracting: (p37<=p22)
states: 26,759,047 (7)
abstracting: (p86<=1)
states: 27,622,035 (7)
abstracting: (p80<=p77)
states: 25,382,196 (7)
.
EG iterations: 1
-> the formula is TRUE

FORMULA UtilityControlRoom-PT-Z2T4N06-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.874sec

checking: [~ [E [EG [AX [p95<=p54]] U [EG [EF [p43<=p19]] & p64<=p43]]] | ~ [A [A [EX [p68<=p3] U ~ [E [p102<=p92 U 1<=p65]]] U EG [[3<=p98 | p102<=p92]]]]]
normalized: [~ [[~ [EG [~ [EG [[3<=p98 | p102<=p92]]]]] & ~ [E [~ [EG [[3<=p98 | p102<=p92]]] U [~ [[~ [EG [E [p102<=p92 U 1<=p65]]] & ~ [E [E [p102<=p92 U 1<=p65] U [~ [EX [p68<=p3]] & E [p102<=p92 U 1<=p65]]]]]] & ~ [EG [[3<=p98 | p102<=p92]]]]]]]] | ~ [E [EG [~ [EX [~ [p95<=p54]]]] U [p64<=p43 & EG [E [true U p43<=p19]]]]]]

abstracting: (p43<=p19)
states: 26,938,975 (7)

EG iterations: 0
abstracting: (p64<=p43)
states: 26,775,315 (7)
abstracting: (p95<=p54)
states: 27,198,675 (7)
...................
EG iterations: 18
abstracting: (p102<=p92)
states: 27,190,541 (7)
abstracting: (3<=p98)
states: 0
.
EG iterations: 1
abstracting: (1<=p65)
states: 862,988 (5)
abstracting: (p102<=p92)
states: 27,190,541 (7)
abstracting: (p68<=p3)
states: 23,060,817 (7)
.abstracting: (1<=p65)
states: 862,988 (5)
abstracting: (p102<=p92)
states: 27,190,541 (7)
abstracting: (1<=p65)
states: 862,988 (5)
abstracting: (p102<=p92)
states: 27,190,541 (7)
.
EG iterations: 1
abstracting: (p102<=p92)
states: 27,190,541 (7)
abstracting: (3<=p98)
states: 0
.
EG iterations: 1
abstracting: (p102<=p92)
states: 27,190,541 (7)
abstracting: (3<=p98)
states: 0
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA UtilityControlRoom-PT-Z2T4N06-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.493sec

checking: AG [~ [A [A [~ [EF [sum(p93, p92, p91, p90, p89, p88)<=sum(p67, p66, p65, p64, p63, p62, p61, p60, p59, p58, p57, p56)]] U AX [1<=0]] U ~ [AF [EG [sum(p67, p66, p65, p64, p63, p62, p61, p60, p59, p58, p57, p56)<=sum(p1, p0)]]]]]]
normalized: ~ [E [true U [~ [EG [~ [EG [~ [EG [sum(p67, p66, p65, p64, p63, p62, p61, p60, p59, p58, p57, p56)<=sum(p1, p0)]]]]]] & ~ [E [~ [EG [~ [EG [sum(p67, p66, p65, p64, p63, p62, p61, p60, p59, p58, p57, p56)<=sum(p1, p0)]]]] U [~ [[~ [EG [EX [~ [1<=0]]]] & ~ [E [EX [~ [1<=0]] U [E [true U sum(p93, p92, p91, p90, p89, p88)<=sum(p67, p66, p65, p64, p63, p62, p61, p60, p59, p58, p57, p56)] & EX [~ [1<=0]]]]]]] & ~ [EG [~ [EG [sum(p67, p66, p65, p64, p63, p62, p61, p60, p59, p58, p57, p56)<=sum(p1, p0)]]]]]]]]]]

abstracting: (sum(p67, p66, p65, p64, p63, p62, p61, p60, p59, p58, p57, p56)<=sum(p1, p0))
states: 19,813,395 (7)
....................
EG iterations: 20
.......................
EG iterations: 23
abstracting: (1<=0)
states: 0
.abstracting: (sum(p93, p92, p91, p90, p89, p88)<=sum(p67, p66, p65, p64, p63, p62, p61, p60, p59, p58, p57, p56))
states: 3,313,656 (6)
abstracting: (1<=0)
states: 0
.abstracting: (1<=0)
states: 0
.
EG iterations: 0
abstracting: (sum(p67, p66, p65, p64, p63, p62, p61, p60, p59, p58, p57, p56)<=sum(p1, p0))
states: 19,813,395 (7)
....................
EG iterations: 20
.......................
EG iterations: 23
abstracting: (sum(p67, p66, p65, p64, p63, p62, p61, p60, p59, p58, p57, p56)<=sum(p1, p0))
states: 19,813,395 (7)
....................
EG iterations: 20
.......................
EG iterations: 23

EG iterations: 0
-> the formula is TRUE

FORMULA UtilityControlRoom-PT-Z2T4N06-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10.048sec

totally nodes used: 6826371 (6.8e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 13940864 41398482 55339346
used/not used/entry size/cache size: 34216598 32892266 16 1024MB
basic ops cache: hits/miss/sum: 973205 2957695 3930900
used/not used/entry size/cache size: 3990117 12787099 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 294910 294910
used/not used/entry size/cache size: 1 16777215 12 192MB
state nr cache: hits/miss/sum: 49535 150612 200147
used/not used/entry size/cache size: 149338 8239270 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 61243865
1 5056740
2 676712
3 113420
4 15839
5 1825
6 238
7 132
8 32
9 4
>= 10 57

Total processing time: 0m21.133sec


BK_STOP 1679379748247

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -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.002sec


iterations count:8652 (62), effective:253 (1)

initing FirstDep: 0m 0.000sec


iterations count:1122 (8), effective:79 (0)

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

iterations count:2288 (16), effective:149 (1)

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

iterations count:2224 (16), effective:149 (1)

iterations count:2021 (14), effective:137 (0)

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

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

iterations count:1266 (9), effective:74 (0)

iterations count:1266 (9), effective:74 (0)

iterations count:1266 (9), effective:74 (0)

iterations count:7725 (55), effective:586 (4)

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="UtilityControlRoom-PT-Z2T4N06"
export BK_EXAMINATION="CTLCardinality"
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 UtilityControlRoom-PT-Z2T4N06, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r490-tall-167912709601137"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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