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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 5.3K Feb 25 22:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Feb 25 22:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 22:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 22:48 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 3.6K Feb 25 16:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 22:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 22:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 25 22:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 25 22:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 11 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 95K 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 RwMutex-PT-r0010w0050-CTLCardinality-00
FORMULA_NAME RwMutex-PT-r0010w0050-CTLCardinality-01
FORMULA_NAME RwMutex-PT-r0010w0050-CTLCardinality-02
FORMULA_NAME RwMutex-PT-r0010w0050-CTLCardinality-03
FORMULA_NAME RwMutex-PT-r0010w0050-CTLCardinality-04
FORMULA_NAME RwMutex-PT-r0010w0050-CTLCardinality-05
FORMULA_NAME RwMutex-PT-r0010w0050-CTLCardinality-06
FORMULA_NAME RwMutex-PT-r0010w0050-CTLCardinality-07
FORMULA_NAME RwMutex-PT-r0010w0050-CTLCardinality-08
FORMULA_NAME RwMutex-PT-r0010w0050-CTLCardinality-09
FORMULA_NAME RwMutex-PT-r0010w0050-CTLCardinality-10
FORMULA_NAME RwMutex-PT-r0010w0050-CTLCardinality-11
FORMULA_NAME RwMutex-PT-r0010w0050-CTLCardinality-12
FORMULA_NAME RwMutex-PT-r0010w0050-CTLCardinality-13
FORMULA_NAME RwMutex-PT-r0010w0050-CTLCardinality-14
FORMULA_NAME RwMutex-PT-r0010w0050-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678992061333

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=RwMutex-PT-r0010w0050
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-16 18:41:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-16 18:41:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 18:41:05] [INFO ] Load time of PNML (sax parser for PT used): 147 ms
[2023-03-16 18:41:05] [INFO ] Transformed 130 places.
[2023-03-16 18:41:05] [INFO ] Transformed 120 transitions.
[2023-03-16 18:41:05] [INFO ] Found NUPN structural information;
[2023-03-16 18:41:05] [INFO ] Parsed PT model containing 130 places and 120 transitions and 1260 arcs in 317 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 24 ms.
Initial state reduction rules removed 3 formulas.
FORMULA RwMutex-PT-r0010w0050-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0050-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0050-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0050-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0050-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 120/120 transitions.
Applied a total of 0 rules in 41 ms. Remains 130 /130 variables (removed 0) and now considering 120/120 (removed 0) transitions.
// Phase 1: matrix 120 rows 130 cols
[2023-03-16 18:41:05] [INFO ] Computed 70 place invariants in 33 ms
[2023-03-16 18:41:06] [INFO ] Implicit Places using invariants in 709 ms returned [12, 23, 34, 36, 39, 41, 42, 43, 44, 45, 46, 47, 51, 53, 54, 56, 58, 59, 61, 62, 63, 64, 65, 66, 69, 70, 71, 73, 79, 80, 81, 83, 84, 85, 86, 97, 119]
Discarding 37 places :
Implicit Place search using SMT only with invariants took 800 ms to find 37 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 93/130 places, 120/120 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 73 transition count 100
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 73 transition count 100
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 60 place count 73 transition count 80
Applied a total of 60 rules in 31 ms. Remains 73 /93 variables (removed 20) and now considering 80/120 (removed 40) transitions.
// Phase 1: matrix 80 rows 73 cols
[2023-03-16 18:41:06] [INFO ] Computed 33 place invariants in 4 ms
[2023-03-16 18:41:06] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-16 18:41:06] [INFO ] Invariant cache hit.
[2023-03-16 18:41:06] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 73/130 places, 80/120 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1138 ms. Remains : 73/130 places, 80/120 transitions.
Support contains 41 out of 73 places after structural reductions.
[2023-03-16 18:41:07] [INFO ] Flatten gal took : 68 ms
[2023-03-16 18:41:07] [INFO ] Flatten gal took : 31 ms
[2023-03-16 18:41:07] [INFO ] Input system was already deterministic with 80 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 993 ms. (steps per millisecond=10 ) properties (out of 28) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 18:41:08] [INFO ] Invariant cache hit.
[2023-03-16 18:41:08] [INFO ] [Real]Absence check using 33 positive place invariants in 26 ms returned sat
[2023-03-16 18:41:08] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
[2023-03-16 18:41:08] [INFO ] Flatten gal took : 19 ms
[2023-03-16 18:41:08] [INFO ] Flatten gal took : 19 ms
[2023-03-16 18:41:08] [INFO ] Input system was already deterministic with 80 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 80/80 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 64 transition count 71
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 64 transition count 71
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 27 place count 64 transition count 62
Applied a total of 27 rules in 7 ms. Remains 64 /73 variables (removed 9) and now considering 62/80 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 64/73 places, 62/80 transitions.
[2023-03-16 18:41:08] [INFO ] Flatten gal took : 12 ms
[2023-03-16 18:41:08] [INFO ] Flatten gal took : 12 ms
[2023-03-16 18:41:08] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 80/80 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 64 transition count 71
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 64 transition count 71
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 27 place count 64 transition count 62
Applied a total of 27 rules in 9 ms. Remains 64 /73 variables (removed 9) and now considering 62/80 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 64/73 places, 62/80 transitions.
[2023-03-16 18:41:08] [INFO ] Flatten gal took : 12 ms
[2023-03-16 18:41:08] [INFO ] Flatten gal took : 13 ms
[2023-03-16 18:41:08] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 80/80 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 66 transition count 73
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 66 transition count 73
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 21 place count 66 transition count 66
Applied a total of 21 rules in 6 ms. Remains 66 /73 variables (removed 7) and now considering 66/80 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 66/73 places, 66/80 transitions.
[2023-03-16 18:41:08] [INFO ] Flatten gal took : 13 ms
[2023-03-16 18:41:08] [INFO ] Flatten gal took : 13 ms
[2023-03-16 18:41:09] [INFO ] Input system was already deterministic with 66 transitions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 80/80 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 64 transition count 71
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 64 transition count 71
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 27 place count 64 transition count 62
Applied a total of 27 rules in 7 ms. Remains 64 /73 variables (removed 9) and now considering 62/80 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 64/73 places, 62/80 transitions.
[2023-03-16 18:41:09] [INFO ] Flatten gal took : 10 ms
[2023-03-16 18:41:09] [INFO ] Flatten gal took : 11 ms
[2023-03-16 18:41:09] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 80/80 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 69 transition count 76
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 69 transition count 76
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 12 place count 69 transition count 72
Applied a total of 12 rules in 4 ms. Remains 69 /73 variables (removed 4) and now considering 72/80 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 69/73 places, 72/80 transitions.
[2023-03-16 18:41:09] [INFO ] Flatten gal took : 12 ms
[2023-03-16 18:41:09] [INFO ] Flatten gal took : 13 ms
[2023-03-16 18:41:09] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 80/80 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 64 transition count 71
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 64 transition count 71
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 27 place count 64 transition count 62
Applied a total of 27 rules in 7 ms. Remains 64 /73 variables (removed 9) and now considering 62/80 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 64/73 places, 62/80 transitions.
[2023-03-16 18:41:09] [INFO ] Flatten gal took : 11 ms
[2023-03-16 18:41:09] [INFO ] Flatten gal took : 10 ms
[2023-03-16 18:41:09] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 73/73 places, 80/80 transitions.
Graph (trivial) has 14 edges and 73 vertex of which 14 / 73 are part of one of the 7 SCC in 4 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 66 transition count 41
Reduce places removed 54 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 115 place count 12 transition count 13
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 116 place count 12 transition count 12
Applied a total of 116 rules in 18 ms. Remains 12 /73 variables (removed 61) and now considering 12/80 (removed 68) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 12/73 places, 12/80 transitions.
[2023-03-16 18:41:09] [INFO ] Flatten gal took : 2 ms
[2023-03-16 18:41:09] [INFO ] Flatten gal took : 1 ms
[2023-03-16 18:41:09] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 80/80 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 64 transition count 71
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 64 transition count 71
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 27 place count 64 transition count 62
Applied a total of 27 rules in 6 ms. Remains 64 /73 variables (removed 9) and now considering 62/80 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 64/73 places, 62/80 transitions.
[2023-03-16 18:41:09] [INFO ] Flatten gal took : 19 ms
[2023-03-16 18:41:09] [INFO ] Flatten gal took : 9 ms
[2023-03-16 18:41:09] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 80/80 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 66 transition count 73
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 66 transition count 73
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 21 place count 66 transition count 66
Applied a total of 21 rules in 4 ms. Remains 66 /73 variables (removed 7) and now considering 66/80 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 66/73 places, 66/80 transitions.
[2023-03-16 18:41:09] [INFO ] Flatten gal took : 8 ms
[2023-03-16 18:41:09] [INFO ] Flatten gal took : 9 ms
[2023-03-16 18:41:09] [INFO ] Input system was already deterministic with 66 transitions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 80/80 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 64 transition count 71
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 64 transition count 71
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 27 place count 64 transition count 62
Applied a total of 27 rules in 3 ms. Remains 64 /73 variables (removed 9) and now considering 62/80 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 64/73 places, 62/80 transitions.
[2023-03-16 18:41:09] [INFO ] Flatten gal took : 7 ms
[2023-03-16 18:41:09] [INFO ] Flatten gal took : 7 ms
[2023-03-16 18:41:09] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 73/73 places, 80/80 transitions.
Graph (trivial) has 12 edges and 73 vertex of which 12 / 73 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 67 transition count 71
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 61 transition count 71
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 19 place count 52 transition count 62
Iterating global reduction 2 with 9 rules applied. Total rules applied 28 place count 52 transition count 62
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 37 place count 52 transition count 53
Applied a total of 37 rules in 15 ms. Remains 52 /73 variables (removed 21) and now considering 53/80 (removed 27) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 52/73 places, 53/80 transitions.
[2023-03-16 18:41:09] [INFO ] Flatten gal took : 6 ms
[2023-03-16 18:41:09] [INFO ] Flatten gal took : 6 ms
[2023-03-16 18:41:09] [INFO ] Input system was already deterministic with 53 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
FORMULA RwMutex-PT-r0010w0050-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2023-03-16 18:41:09] [INFO ] Flatten gal took : 10 ms
[2023-03-16 18:41:09] [INFO ] Flatten gal took : 10 ms
[2023-03-16 18:41:09] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-16 18:41:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 73 places, 80 transitions and 746 arcs took 2 ms.
Total runtime 4156 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: 73 NrTr: 80 NrArc: 746)

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

net check time: 0m 0.000sec

init dd package: 0m 3.558sec


RS generation: 0m 0.065sec


-> reachability set: #nodes 9052 (9.1e+03) #states 1,054 (3)



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

checking: EX [0<=0]
normalized: EX [0<=0]

abstracting: (0<=0)
states: 1,054 (3)
.-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0050-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.053sec

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

abstracting: (0<=0)
states: 1,054 (3)
...-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0050-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA RwMutex-PT-r0010w0050-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.034sec

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

abstracting: (0<=0)
states: 1,054 (3)
.-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0050-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EX [EG [[p29<=0 & 0<=p29]]]
normalized: EX [EG [[p29<=0 & 0<=p29]]]

abstracting: (0<=p29)
states: 1,054 (3)
abstracting: (p29<=0)
states: 1
..
EG iterations: 2
.-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0050-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EG [[p31<=1 & 1<=p31]]
normalized: EG [[p31<=1 & 1<=p31]]

abstracting: (1<=p31)
states: 1,053 (3)
abstracting: (p31<=1)
states: 1,054 (3)
.
EG iterations: 1
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0050-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EX [AG [~ [E [[p36<=1 & 1<=p36] U [p30<=0 & 0<=p30]]]]]
normalized: EX [~ [E [true U E [[p36<=1 & 1<=p36] U [p30<=0 & 0<=p30]]]]]

abstracting: (0<=p30)
states: 1,054 (3)
abstracting: (p30<=0)
states: 1
abstracting: (1<=p36)
states: 1,053 (3)
abstracting: (p36<=1)
states: 1,054 (3)
.-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0050-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.023sec

checking: A [EG [AF [AX [[[0<=p15 & p15<=0] | [p71<=1 & 1<=p71]]]]] U [A [~ [[p40<=1 & 1<=p40]] U EF [[p42<=1 & 1<=p42]]] & [p63<=1 & 1<=p63]]]
normalized: [~ [EG [~ [[[p63<=1 & 1<=p63] & [~ [EG [~ [E [true U [p42<=1 & 1<=p42]]]]] & ~ [E [~ [E [true U [p42<=1 & 1<=p42]]] U [[p40<=1 & 1<=p40] & ~ [E [true U [p42<=1 & 1<=p42]]]]]]]]]]] & ~ [E [~ [[[p63<=1 & 1<=p63] & [~ [EG [~ [E [true U [p42<=1 & 1<=p42]]]]] & ~ [E [~ [E [true U [p42<=1 & 1<=p42]]] U [[p40<=1 & 1<=p40] & ~ [E [true U [p42<=1 & 1<=p42]]]]]]]]] U [~ [EG [~ [EG [EX [~ [[[p71<=1 & 1<=p71] | [0<=p15 & p15<=0]]]]]]]] & ~ [[[p63<=1 & 1<=p63] & [~ [EG [~ [E [true U [p42<=1 & 1<=p42]]]]] & ~ [E [~ [E [true U [p42<=1 & 1<=p42]]] U [[p40<=1 & 1<=p40] & ~ [E [true U [p42<=1 & 1<=p42]]]]]]]]]]]]]

abstracting: (1<=p42)
states: 512
abstracting: (p42<=1)
states: 1,054 (3)
abstracting: (1<=p40)
states: 1,053 (3)
abstracting: (p40<=1)
states: 1,054 (3)
abstracting: (1<=p42)
states: 512
abstracting: (p42<=1)
states: 1,054 (3)
abstracting: (1<=p42)
states: 512
abstracting: (p42<=1)
states: 1,054 (3)
.
EG iterations: 1
abstracting: (1<=p63)
states: 1
abstracting: (p63<=1)
states: 1,054 (3)
abstracting: (p15<=0)
states: 1,053 (3)
abstracting: (0<=p15)
states: 1,054 (3)
abstracting: (1<=p71)
states: 1
abstracting: (p71<=1)
states: 1,054 (3)
...
EG iterations: 2

EG iterations: 0
abstracting: (1<=p42)
states: 512
abstracting: (p42<=1)
states: 1,054 (3)
abstracting: (1<=p40)
states: 1,053 (3)
abstracting: (p40<=1)
states: 1,054 (3)
abstracting: (1<=p42)
states: 512
abstracting: (p42<=1)
states: 1,054 (3)
abstracting: (1<=p42)
states: 512
abstracting: (p42<=1)
states: 1,054 (3)
.
EG iterations: 1
abstracting: (1<=p63)
states: 1
abstracting: (p63<=1)
states: 1,054 (3)
abstracting: (1<=p42)
states: 512
abstracting: (p42<=1)
states: 1,054 (3)
abstracting: (1<=p40)
states: 1,053 (3)
abstracting: (p40<=1)
states: 1,054 (3)
abstracting: (1<=p42)
states: 512
abstracting: (p42<=1)
states: 1,054 (3)
abstracting: (1<=p42)
states: 512
abstracting: (p42<=1)
states: 1,054 (3)
.
EG iterations: 1
abstracting: (1<=p63)
states: 1
abstracting: (p63<=1)
states: 1,054 (3)
.
EG iterations: 1
-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0050-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.038sec

checking: AX [[AF [[[[p47<=0 & 0<=p47] & [p20<=1 & 1<=p20]] | [~ [E [[p37<=1 & 1<=p37] U [p47<=1 & 1<=p47]]] | A [~ [[[p39<=0 & 0<=p39] | [p27<=1 & 1<=p27]]] U EX [0<=0]]]]] | ~ [E [~ [AF [[p6<=1 & 1<=p6]]] U [AX [[p1<=1 & 1<=p1]] | [[p67<=0 & 0<=p67] | [p18<=1 & 1<=p18]]]]]]]
normalized: ~ [EX [~ [[~ [E [EG [~ [[p6<=1 & 1<=p6]]] U [[[p18<=1 & 1<=p18] | [p67<=0 & 0<=p67]] | ~ [EX [~ [[p1<=1 & 1<=p1]]]]]]] | ~ [EG [~ [[[[~ [EG [~ [EX [0<=0]]]] & ~ [E [~ [EX [0<=0]] U [[[p27<=1 & 1<=p27] | [p39<=0 & 0<=p39]] & ~ [EX [0<=0]]]]]] | ~ [E [[p37<=1 & 1<=p37] U [p47<=1 & 1<=p47]]]] | [[p20<=1 & 1<=p20] & [p47<=0 & 0<=p47]]]]]]]]]]

abstracting: (0<=p47)
states: 1,054 (3)
abstracting: (p47<=0)
states: 542
abstracting: (1<=p20)
states: 1,053 (3)
abstracting: (p20<=1)
states: 1,054 (3)
abstracting: (1<=p47)
states: 512
abstracting: (p47<=1)
states: 1,054 (3)
abstracting: (1<=p37)
states: 1,053 (3)
abstracting: (p37<=1)
states: 1,054 (3)
abstracting: (0<=0)
states: 1,054 (3)
.abstracting: (0<=p39)
states: 1,054 (3)
abstracting: (p39<=0)
states: 1
abstracting: (1<=p27)
states: 1,053 (3)
abstracting: (p27<=1)
states: 1,054 (3)
abstracting: (0<=0)
states: 1,054 (3)
.abstracting: (0<=0)
states: 1,054 (3)
..
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p1)
states: 542
abstracting: (p1<=1)
states: 1,054 (3)
.abstracting: (0<=p67)
states: 1,054 (3)
abstracting: (p67<=0)
states: 1,053 (3)
abstracting: (1<=p18)
states: 1
abstracting: (p18<=1)
states: 1,054 (3)
abstracting: (1<=p6)
states: 1
abstracting: (p6<=1)
states: 1,054 (3)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0050-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.035sec

checking: A [EG [[A [[[[[p23<=0 & 0<=p23] | [p28<=1 & 1<=p28]] & [[p34<=0 & 0<=p34] | [p22<=1 & 1<=p22]]] | AX [[[p60<=0 & 0<=p60] | [p48<=1 & 1<=p48]]]] U A [[[p26<=0 & 0<=p26] | [p35<=1 & 1<=p35]] U [p21<=1 & 1<=p21]]] | [~ [[[[p33<=1 & 1<=p33] & [p38<=1 & 1<=p38]] | [[p59<=0 & 0<=p59] | [p65<=1 & 1<=p65]]]] & [[p7<=0 & 0<=p7] | [p24<=1 & 1<=p24]]]]] U AX [[[[[AF [[[0<=p62 & p62<=0] | [p66<=1 & 1<=p66]]] & EF [[p16<=1 & 1<=p16]]] & AX [[[p25<=0 & 0<=p25] | [p63<=1 & 1<=p63]]]] | AX [1<=0]] | ~ [A [[p59<=1 & 1<=p59] U [p4<=1 & 1<=p4]]]]]]
normalized: [~ [EG [EX [~ [[~ [[~ [EG [~ [[p4<=1 & 1<=p4]]]] & ~ [E [~ [[p4<=1 & 1<=p4]] U [~ [[p59<=1 & 1<=p59]] & ~ [[p4<=1 & 1<=p4]]]]]]] | [~ [EX [~ [1<=0]]] | [~ [EX [~ [[[p63<=1 & 1<=p63] | [p25<=0 & 0<=p25]]]]] & [E [true U [p16<=1 & 1<=p16]] & ~ [EG [~ [[[p66<=1 & 1<=p66] | [0<=p62 & p62<=0]]]]]]]]]]]]] & ~ [E [EX [~ [[~ [[~ [EG [~ [[p4<=1 & 1<=p4]]]] & ~ [E [~ [[p4<=1 & 1<=p4]] U [~ [[p59<=1 & 1<=p59]] & ~ [[p4<=1 & 1<=p4]]]]]]] | [~ [EX [~ [1<=0]]] | [~ [EX [~ [[[p63<=1 & 1<=p63] | [p25<=0 & 0<=p25]]]]] & [E [true U [p16<=1 & 1<=p16]] & ~ [EG [~ [[[p66<=1 & 1<=p66] | [0<=p62 & p62<=0]]]]]]]]]]] U [~ [EG [[[[[p24<=1 & 1<=p24] | [p7<=0 & 0<=p7]] & ~ [[[[p65<=1 & 1<=p65] | [p59<=0 & 0<=p59]] | [[p38<=1 & 1<=p38] & [p33<=1 & 1<=p33]]]]] | [~ [EG [~ [[~ [EG [~ [[p21<=1 & 1<=p21]]]] & ~ [E [~ [[p21<=1 & 1<=p21]] U [~ [[[p35<=1 & 1<=p35] | [p26<=0 & 0<=p26]]] & ~ [[p21<=1 & 1<=p21]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[p21<=1 & 1<=p21]]]] & ~ [E [~ [[p21<=1 & 1<=p21]] U [~ [[[p35<=1 & 1<=p35] | [p26<=0 & 0<=p26]]] & ~ [[p21<=1 & 1<=p21]]]]]]] U [~ [[~ [EX [~ [[[p48<=1 & 1<=p48] | [p60<=0 & 0<=p60]]]]] | [[[p22<=1 & 1<=p22] | [p34<=0 & 0<=p34]] & [[p28<=1 & 1<=p28] | [p23<=0 & 0<=p23]]]]] & ~ [[~ [EG [~ [[p21<=1 & 1<=p21]]]] & ~ [E [~ [[p21<=1 & 1<=p21]] U [~ [[[p35<=1 & 1<=p35] | [p26<=0 & 0<=p26]]] & ~ [[p21<=1 & 1<=p21]]]]]]]]]]]]]] & EX [~ [[~ [[~ [EG [~ [[p4<=1 & 1<=p4]]]] & ~ [E [~ [[p4<=1 & 1<=p4]] U [~ [[p59<=1 & 1<=p59]] & ~ [[p4<=1 & 1<=p4]]]]]]] | [~ [EX [~ [1<=0]]] | [~ [EX [~ [[[p63<=1 & 1<=p63] | [p25<=0 & 0<=p25]]]]] & [E [true U [p16<=1 & 1<=p16]] & ~ [EG [~ [[[p66<=1 & 1<=p66] | [0<=p62 & p62<=0]]]]]]]]]]]]]]]

abstracting: (p62<=0)
states: 1,053 (3)
abstracting: (0<=p62)
states: 1,054 (3)
abstracting: (1<=p66)
states: 1
abstracting: (p66<=1)
states: 1,054 (3)
..
EG iterations: 2
abstracting: (1<=p16)
states: 1
abstracting: (p16<=1)
states: 1,054 (3)
abstracting: (0<=p25)
states: 1,054 (3)
abstracting: (p25<=0)
states: 1
abstracting: (1<=p63)
states: 1
abstracting: (p63<=1)
states: 1,054 (3)
.abstracting: (1<=0)
states: 0
.abstracting: (1<=p4)
states: 1
abstracting: (p4<=1)
states: 1,054 (3)
abstracting: (1<=p59)
states: 542
abstracting: (p59<=1)
states: 1,054 (3)
abstracting: (1<=p4)
states: 1
abstracting: (p4<=1)
states: 1,054 (3)
abstracting: (1<=p4)
states: 1
abstracting: (p4<=1)
states: 1,054 (3)
.
EG iterations: 1
.abstracting: (1<=p21)
states: 1,053 (3)
abstracting: (p21<=1)
states: 1,054 (3)
abstracting: (0<=p26)
states: 1,054 (3)
abstracting: (p26<=0)
states: 1
abstracting: (1<=p35)
states: 1,053 (3)
abstracting: (p35<=1)
states: 1,054 (3)
abstracting: (1<=p21)
states: 1,053 (3)
abstracting: (p21<=1)
states: 1,054 (3)
abstracting: (1<=p21)
states: 1,053 (3)
abstracting: (p21<=1)
states: 1,054 (3)
..
EG iterations: 2
abstracting: (0<=p23)
states: 1,054 (3)
abstracting: (p23<=0)
states: 1
abstracting: (1<=p28)
states: 1,053 (3)
abstracting: (p28<=1)
states: 1,054 (3)
abstracting: (0<=p34)
states: 1,054 (3)
abstracting: (p34<=0)
states: 512
abstracting: (1<=p22)
states: 1,053 (3)
abstracting: (p22<=1)
states: 1,054 (3)
abstracting: (0<=p60)
states: 1,054 (3)
abstracting: (p60<=0)
states: 542
abstracting: (1<=p48)
states: 512
abstracting: (p48<=1)
states: 1,054 (3)
.abstracting: (1<=p21)
states: 1,053 (3)
abstracting: (p21<=1)
states: 1,054 (3)
abstracting: (0<=p26)
states: 1,054 (3)
abstracting: (p26<=0)
states: 1
abstracting: (1<=p35)
states: 1,053 (3)
abstracting: (p35<=1)
states: 1,054 (3)
abstracting: (1<=p21)
states: 1,053 (3)
abstracting: (p21<=1)
states: 1,054 (3)
abstracting: (1<=p21)
states: 1,053 (3)
abstracting: (p21<=1)
states: 1,054 (3)
..
EG iterations: 2
abstracting: (1<=p21)
states: 1,053 (3)
abstracting: (p21<=1)
states: 1,054 (3)
abstracting: (0<=p26)
states: 1,054 (3)
abstracting: (p26<=0)
states: 1
abstracting: (1<=p35)
states: 1,053 (3)
abstracting: (p35<=1)
states: 1,054 (3)
abstracting: (1<=p21)
states: 1,053 (3)
abstracting: (p21<=1)
states: 1,054 (3)
abstracting: (1<=p21)
states: 1,053 (3)
abstracting: (p21<=1)
states: 1,054 (3)
..
EG iterations: 2
.
EG iterations: 1
abstracting: (1<=p33)
states: 1,053 (3)
abstracting: (p33<=1)
states: 1,054 (3)
abstracting: (1<=p38)
states: 1,053 (3)
abstracting: (p38<=1)
states: 1,054 (3)
abstracting: (0<=p59)
states: 1,054 (3)
abstracting: (p59<=0)
states: 512
abstracting: (1<=p65)
states: 1
abstracting: (p65<=1)
states: 1,054 (3)
abstracting: (0<=p7)
states: 1,054 (3)
abstracting: (p7<=0)
states: 1,053 (3)
abstracting: (1<=p24)
states: 1,053 (3)
abstracting: (p24<=1)
states: 1,054 (3)

EG iterations: 0
abstracting: (p62<=0)
states: 1,053 (3)
abstracting: (0<=p62)
states: 1,054 (3)
abstracting: (1<=p66)
states: 1
abstracting: (p66<=1)
states: 1,054 (3)
..
EG iterations: 2
abstracting: (1<=p16)
states: 1
abstracting: (p16<=1)
states: 1,054 (3)
abstracting: (0<=p25)
states: 1,054 (3)
abstracting: (p25<=0)
states: 1
abstracting: (1<=p63)
states: 1
abstracting: (p63<=1)
states: 1,054 (3)
.abstracting: (1<=0)
states: 0
.abstracting: (1<=p4)
states: 1
abstracting: (p4<=1)
states: 1,054 (3)
abstracting: (1<=p59)
states: 542
abstracting: (p59<=1)
states: 1,054 (3)
abstracting: (1<=p4)
states: 1
abstracting: (p4<=1)
states: 1,054 (3)
abstracting: (1<=p4)
states: 1
abstracting: (p4<=1)
states: 1,054 (3)
.
EG iterations: 1
.abstracting: (p62<=0)
states: 1,053 (3)
abstracting: (0<=p62)
states: 1,054 (3)
abstracting: (1<=p66)
states: 1
abstracting: (p66<=1)
states: 1,054 (3)
..
EG iterations: 2
abstracting: (1<=p16)
states: 1
abstracting: (p16<=1)
states: 1,054 (3)
abstracting: (0<=p25)
states: 1,054 (3)
abstracting: (p25<=0)
states: 1
abstracting: (1<=p63)
states: 1
abstracting: (p63<=1)
states: 1,054 (3)
.abstracting: (1<=0)
states: 0
.abstracting: (1<=p4)
states: 1
abstracting: (p4<=1)
states: 1,054 (3)
abstracting: (1<=p59)
states: 542
abstracting: (p59<=1)
states: 1,054 (3)
abstracting: (1<=p4)
states: 1
abstracting: (p4<=1)
states: 1,054 (3)
abstracting: (1<=p4)
states: 1
abstracting: (p4<=1)
states: 1,054 (3)
.
EG iterations: 1
...
EG iterations: 2
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0050-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.057sec

totally nodes used: 26789 (2.7e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 77118 522744 599862
used/not used/entry size/cache size: 537488 66571376 16 1024MB
basic ops cache: hits/miss/sum: 34814 142408 177222
used/not used/entry size/cache size: 182172 16595044 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: 3126 16302 19428
used/not used/entry size/cache size: 16302 8372306 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 67082255
1 26429
2 180
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.439sec


BK_STOP 1678992076493

--------------------
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:1603 (20), effective:40 (0)

initing FirstDep: 0m 0.000sec


iterations count:1559 (19), effective:39 (0)

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

iterations count:1601 (20), effective:31 (0)

iterations count:1601 (20), effective:31 (0)

iterations count:1601 (20), effective:31 (0)

iterations count:1601 (20), effective:31 (0)

iterations count:1601 (20), effective:31 (0)

iterations count:1601 (20), effective:31 (0)

iterations count:1601 (20), effective:31 (0)

iterations count:1601 (20), effective:31 (0)

iterations count:1601 (20), effective:31 (0)

iterations count:1541 (19), effective:30 (0)

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

iterations count:1624 (20), effective:40 (0)

iterations count:1578 (19), effective:30 (0)

iterations count:1624 (20), effective:40 (0)

iterations count:1578 (19), effective:30 (0)

iterations count:1624 (20), effective:40 (0)

iterations count:1578 (19), effective:30 (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="RwMutex-PT-r0010w0050"
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 RwMutex-PT-r0010w0050, 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-167891812300121"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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