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.r362-smll-167891813300665.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 SharedMemory-PT-000010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r362-smll-167891813300665
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.6M
-rw-r--r-- 1 mcc users 37K Feb 25 14:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 200K Feb 25 14:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 67K Feb 25 14:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 302K Feb 25 14:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 17K Feb 25 16:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 16:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 34K Feb 25 16:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 115K Feb 25 16:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 94K Feb 25 14:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 523K Feb 25 14:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 189K Feb 25 14:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 836K Feb 25 14:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.7K Feb 25 16:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 104K 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 SharedMemory-PT-000010-CTLCardinality-00
FORMULA_NAME SharedMemory-PT-000010-CTLCardinality-01
FORMULA_NAME SharedMemory-PT-000010-CTLCardinality-02
FORMULA_NAME SharedMemory-PT-000010-CTLCardinality-03
FORMULA_NAME SharedMemory-PT-000010-CTLCardinality-04
FORMULA_NAME SharedMemory-PT-000010-CTLCardinality-05
FORMULA_NAME SharedMemory-PT-000010-CTLCardinality-06
FORMULA_NAME SharedMemory-PT-000010-CTLCardinality-07
FORMULA_NAME SharedMemory-PT-000010-CTLCardinality-08
FORMULA_NAME SharedMemory-PT-000010-CTLCardinality-09
FORMULA_NAME SharedMemory-PT-000010-CTLCardinality-10
FORMULA_NAME SharedMemory-PT-000010-CTLCardinality-11
FORMULA_NAME SharedMemory-PT-000010-CTLCardinality-12
FORMULA_NAME SharedMemory-PT-000010-CTLCardinality-13
FORMULA_NAME SharedMemory-PT-000010-CTLCardinality-14
FORMULA_NAME SharedMemory-PT-000010-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679364994736

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=SharedMemory-PT-000010
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-21 02:16:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 02:16:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 02:16:38] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2023-03-21 02:16:38] [INFO ] Transformed 131 places.
[2023-03-21 02:16:38] [INFO ] Transformed 210 transitions.
[2023-03-21 02:16:38] [INFO ] Found NUPN structural information;
[2023-03-21 02:16:38] [INFO ] Completing missing partition info from NUPN : creating a component with [Ext_Mem_Acc_10_6, Ext_Mem_Acc_8_7]
[2023-03-21 02:16:38] [INFO ] Parsed PT model containing 131 places and 210 transitions and 800 arcs in 316 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 51 ms.
Initial state reduction rules removed 1 formulas.
FORMULA SharedMemory-PT-000010-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 131 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 19 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2023-03-21 02:16:38] [INFO ] Computed 21 place invariants in 24 ms
[2023-03-21 02:16:38] [INFO ] Implicit Places using invariants in 387 ms returned []
[2023-03-21 02:16:38] [INFO ] Invariant cache hit.
[2023-03-21 02:16:39] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 742 ms to find 0 implicit places.
[2023-03-21 02:16:39] [INFO ] Invariant cache hit.
[2023-03-21 02:16:39] [INFO ] Dead Transitions using invariants and state equation in 460 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1229 ms. Remains : 131/131 places, 210/210 transitions.
Support contains 131 out of 131 places after structural reductions.
[2023-03-21 02:16:40] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-21 02:16:40] [INFO ] Flatten gal took : 113 ms
FORMULA SharedMemory-PT-000010-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000010-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-21 02:16:40] [INFO ] Flatten gal took : 45 ms
[2023-03-21 02:16:40] [INFO ] Input system was already deterministic with 210 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1141 ms. (steps per millisecond=8 ) properties (out of 53) seen :32
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) 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 21) 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 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) 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 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) 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 21) 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 21) 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 21) 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 21) seen :0
Running SMT prover for 21 properties.
[2023-03-21 02:16:41] [INFO ] Invariant cache hit.
[2023-03-21 02:16:42] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :17 sat :0 real:4
[2023-03-21 02:16:42] [INFO ] [Nat]Absence check using 21 positive place invariants in 13 ms returned sat
[2023-03-21 02:16:42] [INFO ] After 148ms SMT Verify possible using all constraints in natural domain returned unsat :21 sat :0
Fused 21 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 4 ms.
Successfully simplified 21 atomic propositions for a total of 13 simplifications.
FORMULA SharedMemory-PT-000010-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-21 02:16:42] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2023-03-21 02:16:42] [INFO ] Flatten gal took : 33 ms
FORMULA SharedMemory-PT-000010-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000010-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000010-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-21 02:16:42] [INFO ] Flatten gal took : 29 ms
[2023-03-21 02:16:42] [INFO ] Input system was already deterministic with 210 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 44 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 45 ms. Remains : 131/131 places, 210/210 transitions.
[2023-03-21 02:16:42] [INFO ] Flatten gal took : 26 ms
[2023-03-21 02:16:42] [INFO ] Flatten gal took : 28 ms
[2023-03-21 02:16:42] [INFO ] Input system was already deterministic with 210 transitions.
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
FORMULA SharedMemory-PT-000010-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 13 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 131/131 places, 210/210 transitions.
[2023-03-21 02:16:42] [INFO ] Flatten gal took : 23 ms
[2023-03-21 02:16:42] [INFO ] Flatten gal took : 24 ms
[2023-03-21 02:16:42] [INFO ] Input system was already deterministic with 210 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 131 transition count 130
Reduce places removed 88 places and 0 transitions.
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Graph (trivial) has 28 edges and 43 vertex of which 16 / 43 are part of one of the 8 SCC in 3 ms
Free SCC test removed 8 places
Iterating post reduction 1 with 151 rules applied. Total rules applied 231 place count 35 transition count 68
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 239 place count 35 transition count 60
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 247 place count 35 transition count 52
Applied a total of 247 rules in 26 ms. Remains 35 /131 variables (removed 96) and now considering 52/210 (removed 158) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 35/131 places, 52/210 transitions.
[2023-03-21 02:16:42] [INFO ] Flatten gal took : 5 ms
[2023-03-21 02:16:42] [INFO ] Flatten gal took : 4 ms
[2023-03-21 02:16:42] [INFO ] Input system was already deterministic with 52 transitions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 12 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 131/131 places, 210/210 transitions.
[2023-03-21 02:16:42] [INFO ] Flatten gal took : 21 ms
[2023-03-21 02:16:42] [INFO ] Flatten gal took : 30 ms
[2023-03-21 02:16:42] [INFO ] Input system was already deterministic with 210 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Drop transitions removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 87 rules applied. Total rules applied 87 place count 131 transition count 123
Reduce places removed 94 places and 0 transitions.
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Graph (trivial) has 27 edges and 37 vertex of which 14 / 37 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Iterating post reduction 1 with 148 rules applied. Total rules applied 235 place count 30 transition count 70
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 242 place count 30 transition count 63
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 3 with 24 rules applied. Total rules applied 266 place count 30 transition count 39
Applied a total of 266 rules in 11 ms. Remains 30 /131 variables (removed 101) and now considering 39/210 (removed 171) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 30/131 places, 39/210 transitions.
[2023-03-21 02:16:42] [INFO ] Flatten gal took : 3 ms
[2023-03-21 02:16:42] [INFO ] Flatten gal took : 2 ms
[2023-03-21 02:16:42] [INFO ] Input system was already deterministic with 39 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Drop transitions removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 87 rules applied. Total rules applied 87 place count 131 transition count 123
Reduce places removed 95 places and 0 transitions.
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Graph (trivial) has 26 edges and 36 vertex of which 14 / 36 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Iterating post reduction 1 with 158 rules applied. Total rules applied 245 place count 29 transition count 61
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 252 place count 29 transition count 54
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 3 with 15 rules applied. Total rules applied 267 place count 29 transition count 39
Applied a total of 267 rules in 9 ms. Remains 29 /131 variables (removed 102) and now considering 39/210 (removed 171) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 29/131 places, 39/210 transitions.
[2023-03-21 02:16:42] [INFO ] Flatten gal took : 2 ms
[2023-03-21 02:16:42] [INFO ] Flatten gal took : 2 ms
[2023-03-21 02:16:42] [INFO ] Input system was already deterministic with 39 transitions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 7 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 131/131 places, 210/210 transitions.
[2023-03-21 02:16:42] [INFO ] Flatten gal took : 14 ms
[2023-03-21 02:16:42] [INFO ] Flatten gal took : 14 ms
[2023-03-21 02:16:42] [INFO ] Input system was already deterministic with 210 transitions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 5 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 131/131 places, 210/210 transitions.
[2023-03-21 02:16:42] [INFO ] Flatten gal took : 11 ms
[2023-03-21 02:16:42] [INFO ] Flatten gal took : 12 ms
[2023-03-21 02:16:43] [INFO ] Input system was already deterministic with 210 transitions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 4 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 131/131 places, 210/210 transitions.
[2023-03-21 02:16:43] [INFO ] Flatten gal took : 11 ms
[2023-03-21 02:16:43] [INFO ] Flatten gal took : 12 ms
[2023-03-21 02:16:43] [INFO ] Input system was already deterministic with 210 transitions.
[2023-03-21 02:16:43] [INFO ] Flatten gal took : 11 ms
[2023-03-21 02:16:43] [INFO ] Flatten gal took : 12 ms
[2023-03-21 02:16:43] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-21 02:16:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 131 places, 210 transitions and 800 arcs took 3 ms.
Total runtime 5179 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: 131 NrTr: 210 NrArc: 800)

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

net check time: 0m 0.000sec

init dd package: 0m 3.615sec


RS generation: 0m 0.276sec


-> reachability set: #nodes 3494 (3.5e+03) #states 1,830,519 (6)



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

checking: EF [EX [0<=0]]
normalized: E [true U EX [0<=0]]

abstracting: (0<=0)
states: 1,830,519 (6)
.-> the formula is TRUE

FORMULA SharedMemory-PT-000010-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.342sec

checking: EF [AG [[[p63<=0 & 0<=p63] & [p93<=1 & 1<=p93]]]]
normalized: E [true U ~ [E [true U ~ [[[p93<=1 & 1<=p93] & [p63<=0 & 0<=p63]]]]]]

abstracting: (0<=p63)
states: 1,830,519 (6)
abstracting: (p63<=0)
states: 1,810,836 (6)
abstracting: (1<=p93)
states: 1,653,372 (6)
abstracting: (p93<=1)
states: 1,830,519 (6)
-> the formula is FALSE

FORMULA SharedMemory-PT-000010-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.391sec

checking: EX [EF [AG [~ [A [[[0<=p93 & p93<=0] | [p3<=1 & 1<=p3]] U [p86<=1 & 1<=p86]]]]]]
normalized: EX [E [true U ~ [E [true U [~ [EG [~ [[p86<=1 & 1<=p86]]]] & ~ [E [~ [[p86<=1 & 1<=p86]] U [~ [[[p3<=1 & 1<=p3] | [0<=p93 & p93<=0]]] & ~ [[p86<=1 & 1<=p86]]]]]]]]]]

abstracting: (1<=p86)
states: 19,683 (4)
abstracting: (p86<=1)
states: 1,830,519 (6)
abstracting: (p93<=0)
states: 177,147 (5)
abstracting: (0<=p93)
states: 1,830,519 (6)
abstracting: (1<=p3)
states: 19,683 (4)
abstracting: (p3<=1)
states: 1,830,519 (6)
abstracting: (1<=p86)
states: 19,683 (4)
abstracting: (p86<=1)
states: 1,830,519 (6)
abstracting: (1<=p86)
states: 19,683 (4)
abstracting: (p86<=1)
states: 1,830,519 (6)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA SharedMemory-PT-000010-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.252sec

checking: E [EF [EG [AG [[[p60<=0 & 0<=p60] | [p3<=1 & 1<=p3]]]]] U AG [[p62<=0 & 0<=p62]]]
normalized: E [E [true U EG [~ [E [true U ~ [[[p3<=1 & 1<=p3] | [p60<=0 & 0<=p60]]]]]]] U ~ [E [true U ~ [[p62<=0 & 0<=p62]]]]]

abstracting: (0<=p62)
states: 1,830,519 (6)
abstracting: (p62<=0)
states: 1,810,836 (6)
abstracting: (0<=p60)
states: 1,830,519 (6)
abstracting: (p60<=0)
states: 1,810,836 (6)
abstracting: (1<=p3)
states: 19,683 (4)
abstracting: (p3<=1)
states: 1,830,519 (6)
.
EG iterations: 1
-> the formula is FALSE

FORMULA SharedMemory-PT-000010-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.250sec

checking: EF [~ [E [A [[p130<=0 & 0<=p130] U [p17<=1 & 1<=p17]] U AF [[[p16<=0 & 0<=p16] | [p24<=1 & 1<=p24]]]]]]
normalized: E [true U ~ [E [[~ [EG [~ [[p17<=1 & 1<=p17]]]] & ~ [E [~ [[p17<=1 & 1<=p17]] U [~ [[p130<=0 & 0<=p130]] & ~ [[p17<=1 & 1<=p17]]]]]] U ~ [EG [~ [[[p24<=1 & 1<=p24] | [p16<=0 & 0<=p16]]]]]]]]

abstracting: (0<=p16)
states: 1,830,519 (6)
abstracting: (p16<=0)
states: 1,810,836 (6)
abstracting: (1<=p24)
states: 19,683 (4)
abstracting: (p24<=1)
states: 1,830,519 (6)
...
EG iterations: 3
abstracting: (1<=p17)
states: 19,683 (4)
abstracting: (p17<=1)
states: 1,830,519 (6)
abstracting: (0<=p130)
states: 1,830,519 (6)
abstracting: (p130<=0)
states: 1,279,395 (6)
abstracting: (1<=p17)
states: 19,683 (4)
abstracting: (p17<=1)
states: 1,830,519 (6)
abstracting: (1<=p17)
states: 19,683 (4)
abstracting: (p17<=1)
states: 1,830,519 (6)
.
EG iterations: 1
-> the formula is TRUE

FORMULA SharedMemory-PT-000010-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.405sec

checking: AF [[EF [AX [~ [A [[[p44<=0 & 0<=p44] | [p71<=1 & 1<=p71]] U [p0<=0 & 0<=p0]]]]] | AG [EF [[[p64<=0 & 0<=p64] & [p48<=1 & 1<=p48]]]]]]
normalized: ~ [EG [~ [[~ [E [true U ~ [E [true U [[p48<=1 & 1<=p48] & [p64<=0 & 0<=p64]]]]]] | E [true U ~ [EX [[~ [EG [~ [[p0<=0 & 0<=p0]]]] & ~ [E [~ [[p0<=0 & 0<=p0]] U [~ [[[p71<=1 & 1<=p71] | [p44<=0 & 0<=p44]]] & ~ [[p0<=0 & 0<=p0]]]]]]]]]]]]]

abstracting: (0<=p0)
states: 1,830,519 (6)
abstracting: (p0<=0)
states: 1,810,836 (6)
abstracting: (0<=p44)
states: 1,830,519 (6)
abstracting: (p44<=0)
states: 1,810,836 (6)
abstracting: (1<=p71)
states: 19,683 (4)
abstracting: (p71<=1)
states: 1,830,519 (6)
abstracting: (0<=p0)
states: 1,830,519 (6)
abstracting: (p0<=0)
states: 1,810,836 (6)
abstracting: (0<=p0)
states: 1,830,519 (6)
abstracting: (p0<=0)
states: 1,810,836 (6)
...
EG iterations: 3
.abstracting: (0<=p64)
states: 1,830,519 (6)
abstracting: (p64<=0)
states: 1,810,836 (6)
abstracting: (1<=p48)
states: 19,683 (4)
abstracting: (p48<=1)
states: 1,830,519 (6)
.
EG iterations: 1
-> the formula is TRUE

FORMULA SharedMemory-PT-000010-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.141sec

checking: AG [E [[EG [AX [[[p15<=0 & 0<=p15] | [p2<=1 & 1<=p2]]]] & [p35<=0 & 0<=p35]] U [EX [0<=0] & [EF [[p67<=1 & 1<=p67]] & [E [[[p50<=0 & 0<=p50] | [p4<=1 & 1<=p4]] U [p73<=0 & 0<=p73]] | A [[[p106<=0 & 0<=p106] | [p14<=1 & 1<=p14]] U [[p44<=0 & 0<=p44] | [p57<=1 & 1<=p57]]]]]]]]
normalized: ~ [E [true U ~ [E [[[p35<=0 & 0<=p35] & EG [~ [EX [~ [[[p2<=1 & 1<=p2] | [p15<=0 & 0<=p15]]]]]]] U [[[[~ [EG [~ [[[p57<=1 & 1<=p57] | [p44<=0 & 0<=p44]]]]] & ~ [E [~ [[[p57<=1 & 1<=p57] | [p44<=0 & 0<=p44]]] U [~ [[[p14<=1 & 1<=p14] | [p106<=0 & 0<=p106]]] & ~ [[[p57<=1 & 1<=p57] | [p44<=0 & 0<=p44]]]]]]] | E [[[p4<=1 & 1<=p4] | [p50<=0 & 0<=p50]] U [p73<=0 & 0<=p73]]] & E [true U [p67<=1 & 1<=p67]]] & EX [0<=0]]]]]]

abstracting: (0<=0)
states: 1,830,519 (6)
.abstracting: (1<=p67)
states: 19,683 (4)
abstracting: (p67<=1)
states: 1,830,519 (6)
abstracting: (0<=p73)
states: 1,830,519 (6)
abstracting: (p73<=0)
states: 1,810,836 (6)
abstracting: (0<=p50)
states: 1,830,519 (6)
abstracting: (p50<=0)
states: 1,810,836 (6)
abstracting: (1<=p4)
states: 19,683 (4)
abstracting: (p4<=1)
states: 1,830,519 (6)
abstracting: (0<=p44)
states: 1,830,519 (6)
abstracting: (p44<=0)
states: 1,810,836 (6)
abstracting: (1<=p57)
states: 19,683 (4)
abstracting: (p57<=1)
states: 1,830,519 (6)
abstracting: (0<=p106)
states: 1,830,519 (6)
abstracting: (p106<=0)
states: 1,279,395 (6)
abstracting: (1<=p14)
states: 19,683 (4)
abstracting: (p14<=1)
states: 1,830,519 (6)
abstracting: (0<=p44)
states: 1,830,519 (6)
abstracting: (p44<=0)
states: 1,810,836 (6)
abstracting: (1<=p57)
states: 19,683 (4)
abstracting: (p57<=1)
states: 1,830,519 (6)
abstracting: (0<=p44)
states: 1,830,519 (6)
abstracting: (p44<=0)
states: 1,810,836 (6)
abstracting: (1<=p57)
states: 19,683 (4)
abstracting: (p57<=1)
states: 1,830,519 (6)
...
EG iterations: 3
abstracting: (0<=p15)
states: 1,830,519 (6)
abstracting: (p15<=0)
states: 1,810,836 (6)
abstracting: (1<=p2)
states: 19,683 (4)
abstracting: (p2<=1)
states: 1,830,519 (6)
....
EG iterations: 3
abstracting: (0<=p35)
states: 1,830,519 (6)
abstracting: (p35<=0)
states: 1,810,836 (6)
-> the formula is TRUE

FORMULA SharedMemory-PT-000010-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.267sec

checking: EF [[AG [[AX [[[p43<=0 & 0<=p43] & [[p74<=0 & 0<=p74] | [p73<=1 & 1<=p73]]]] | [[p46<=0 & 0<=p46] | [p65<=1 & 1<=p65]]]] & [[AF [[p77<=0 & 0<=p77]] & [[p61<=0 & 0<=p61] | [[p126<=1 & 1<=p126] | [p101<=1 & 1<=p101]]]] | [EF [[p119<=0 & 0<=p119]] & [[p116<=0 & 0<=p116] | [p25<=0 & 0<=p25]]]]]]
normalized: E [true U [[[[[p25<=0 & 0<=p25] | [p116<=0 & 0<=p116]] & E [true U [p119<=0 & 0<=p119]]] | [[[[p101<=1 & 1<=p101] | [p126<=1 & 1<=p126]] | [p61<=0 & 0<=p61]] & ~ [EG [~ [[p77<=0 & 0<=p77]]]]]] & ~ [E [true U ~ [[[[p65<=1 & 1<=p65] | [p46<=0 & 0<=p46]] | ~ [EX [~ [[[[p73<=1 & 1<=p73] | [p74<=0 & 0<=p74]] & [p43<=0 & 0<=p43]]]]]]]]]]]

abstracting: (0<=p43)
states: 1,830,519 (6)
abstracting: (p43<=0)
states: 1,810,836 (6)
abstracting: (0<=p74)
states: 1,830,519 (6)
abstracting: (p74<=0)
states: 1,810,836 (6)
abstracting: (1<=p73)
states: 19,683 (4)
abstracting: (p73<=1)
states: 1,830,519 (6)
.abstracting: (0<=p46)
states: 1,830,519 (6)
abstracting: (p46<=0)
states: 1,810,836 (6)
abstracting: (1<=p65)
states: 19,683 (4)
abstracting: (p65<=1)
states: 1,830,519 (6)
abstracting: (0<=p77)
states: 1,830,519 (6)
abstracting: (p77<=0)
states: 1,810,836 (6)
...
EG iterations: 3
abstracting: (0<=p61)
states: 1,830,519 (6)
abstracting: (p61<=0)
states: 1,810,836 (6)
abstracting: (1<=p126)
states: 551,124 (5)
abstracting: (p126<=1)
states: 1,830,519 (6)
abstracting: (1<=p101)
states: 551,124 (5)
abstracting: (p101<=1)
states: 1,830,519 (6)
abstracting: (0<=p119)
states: 1,830,519 (6)
abstracting: (p119<=0)
states: 1,279,395 (6)
abstracting: (0<=p116)
states: 1,830,519 (6)
abstracting: (p116<=0)
states: 1,279,395 (6)
abstracting: (0<=p25)
states: 1,830,519 (6)
abstracting: (p25<=0)
states: 1,810,836 (6)
-> the formula is TRUE

FORMULA SharedMemory-PT-000010-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.231sec

totally nodes used: 179798 (1.8e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1286508 6596308 7882816
used/not used/entry size/cache size: 6433887 60674977 16 1024MB
basic ops cache: hits/miss/sum: 112226 222551 334777
used/not used/entry size/cache size: 345126 16432090 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: 3880 17882 21762
used/not used/entry size/cache size: 17872 8370736 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 66937093
1 164102
2 7317
3 346
4 6
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 7.901sec


BK_STOP 1679365012110

--------------------
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 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.000sec


iterations count:10176 (48), effective:110 (0)

initing FirstDep: 0m 0.000sec


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

iterations count:9018 (42), effective:85 (0)

iterations count:788 (3), effective:10 (0)

iterations count:10299 (49), effective:101 (0)

iterations count:10120 (48), effective:98 (0)

iterations count:10110 (48), effective:98 (0)

iterations count:9698 (46), effective:91 (0)

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

iterations count:10189 (48), effective:103 (0)

iterations count:9584 (45), effective:93 (0)

iterations count:9583 (45), effective:93 (0)

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

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

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

iterations count:1825 (8), effective:10 (0)

iterations count:210 (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="SharedMemory-PT-000010"
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 SharedMemory-PT-000010, 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 r362-smll-167891813300665"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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