Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r426-tajo-167905978300009.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ShieldRVs-PT-001B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978300009
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 7.9K Feb 26 18:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 26 18:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 18:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 18:22 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.7K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 18:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 26 18:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 18:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 111K Feb 26 18:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 13K 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 ShieldRVs-PT-001B-CTLCardinality-00
FORMULA_NAME ShieldRVs-PT-001B-CTLCardinality-01
FORMULA_NAME ShieldRVs-PT-001B-CTLCardinality-02
FORMULA_NAME ShieldRVs-PT-001B-CTLCardinality-03
FORMULA_NAME ShieldRVs-PT-001B-CTLCardinality-04
FORMULA_NAME ShieldRVs-PT-001B-CTLCardinality-05
FORMULA_NAME ShieldRVs-PT-001B-CTLCardinality-06
FORMULA_NAME ShieldRVs-PT-001B-CTLCardinality-07
FORMULA_NAME ShieldRVs-PT-001B-CTLCardinality-08
FORMULA_NAME ShieldRVs-PT-001B-CTLCardinality-09
FORMULA_NAME ShieldRVs-PT-001B-CTLCardinality-10
FORMULA_NAME ShieldRVs-PT-001B-CTLCardinality-11
FORMULA_NAME ShieldRVs-PT-001B-CTLCardinality-12
FORMULA_NAME ShieldRVs-PT-001B-CTLCardinality-13
FORMULA_NAME ShieldRVs-PT-001B-CTLCardinality-14
FORMULA_NAME ShieldRVs-PT-001B-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679338351148

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=ShieldRVs-PT-001B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 18:52:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 18:52:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 18:52:33] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2023-03-20 18:52:33] [INFO ] Transformed 43 places.
[2023-03-20 18:52:33] [INFO ] Transformed 48 transitions.
[2023-03-20 18:52:33] [INFO ] Found NUPN structural information;
[2023-03-20 18:52:33] [INFO ] Parsed PT model containing 43 places and 48 transitions and 144 arcs in 131 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Support contains 41 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 48/48 transitions.
Applied a total of 0 rules in 19 ms. Remains 43 /43 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 43 cols
[2023-03-20 18:52:33] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-20 18:52:33] [INFO ] Implicit Places using invariants in 219 ms returned []
[2023-03-20 18:52:33] [INFO ] Invariant cache hit.
[2023-03-20 18:52:33] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
[2023-03-20 18:52:33] [INFO ] Invariant cache hit.
[2023-03-20 18:52:33] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 434 ms. Remains : 43/43 places, 48/48 transitions.
Support contains 41 out of 43 places after structural reductions.
[2023-03-20 18:52:33] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-20 18:52:33] [INFO ] Flatten gal took : 26 ms
[2023-03-20 18:52:33] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-20 18:52:33] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ShieldRVs-PT-001B-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-001B-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-001B-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-001B-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-20 18:52:33] [INFO ] Flatten gal took : 7 ms
[2023-03-20 18:52:33] [INFO ] Input system was already deterministic with 48 transitions.
Support contains 31 out of 43 places (down from 41) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 42) seen :41
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 18:52:34] [INFO ] Invariant cache hit.
[2023-03-20 18:52:34] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-20 18:52:34] [INFO ] After 41ms 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 0 ms.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
[2023-03-20 18:52:34] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 6 ms
FORMULA ShieldRVs-PT-001B-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 4 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 48 transitions.
Computed a total of 12 stabilizing places and 12 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 43/43 places, 48/48 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 43 transition count 46
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 41 transition count 44
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 39 transition count 44
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 8 place count 39 transition count 39
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 18 place count 34 transition count 39
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 24 place count 28 transition count 33
Iterating global reduction 3 with 6 rules applied. Total rules applied 30 place count 28 transition count 33
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 30 place count 28 transition count 32
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 27 transition count 32
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 3 with 10 rules applied. Total rules applied 42 place count 22 transition count 27
Applied a total of 42 rules in 15 ms. Remains 22 /43 variables (removed 21) and now considering 27/48 (removed 21) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 22/43 places, 27/48 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 27 transitions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 48/48 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 37 transition count 42
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 37 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 36 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 36 transition count 41
Applied a total of 14 rules in 2 ms. Remains 36 /43 variables (removed 7) and now considering 41/48 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 36/43 places, 41/48 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 4 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 48/48 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 38 transition count 43
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 38 transition count 43
Applied a total of 10 rules in 2 ms. Remains 38 /43 variables (removed 5) and now considering 43/48 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 38/43 places, 43/48 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 9 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 48/48 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 37 transition count 42
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 37 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 36 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 36 transition count 41
Applied a total of 14 rules in 1 ms. Remains 36 /43 variables (removed 7) and now considering 41/48 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 36/43 places, 41/48 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 48/48 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 39 transition count 44
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 39 transition count 44
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 38 transition count 43
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 38 transition count 43
Applied a total of 10 rules in 2 ms. Remains 38 /43 variables (removed 5) and now considering 43/48 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 38/43 places, 43/48 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 48/48 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 38 transition count 43
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 38 transition count 43
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 37 transition count 42
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 37 transition count 42
Applied a total of 12 rules in 2 ms. Remains 37 /43 variables (removed 6) and now considering 42/48 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 37/43 places, 42/48 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 48/48 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 36 transition count 41
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 36 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 35 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 35 transition count 40
Applied a total of 16 rules in 2 ms. Remains 35 /43 variables (removed 8) and now considering 40/48 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 35/43 places, 40/48 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 48/48 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 36 transition count 41
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 36 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 35 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 35 transition count 40
Applied a total of 16 rules in 2 ms. Remains 35 /43 variables (removed 8) and now considering 40/48 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 35/43 places, 40/48 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 48/48 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 41 transition count 46
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 41 transition count 46
Applied a total of 4 rules in 1 ms. Remains 41 /43 variables (removed 2) and now considering 46/48 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 41/43 places, 46/48 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 46 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 43/43 places, 48/48 transitions.
Reduce places removed 1 places and 1 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 3 place count 42 transition count 44
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 39 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 38 transition count 43
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 8 place count 38 transition count 40
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 14 place count 35 transition count 40
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 20 place count 29 transition count 34
Iterating global reduction 3 with 6 rules applied. Total rules applied 26 place count 29 transition count 34
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 26 place count 29 transition count 33
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 28 place count 28 transition count 33
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 40 place count 22 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 41 place count 21 transition count 26
Applied a total of 41 rules in 6 ms. Remains 21 /43 variables (removed 22) and now considering 26/48 (removed 22) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 21/43 places, 26/48 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 26 transitions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 48/48 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 36 transition count 41
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 36 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 35 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 35 transition count 40
Applied a total of 16 rules in 2 ms. Remains 35 /43 variables (removed 8) and now considering 40/48 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 35/43 places, 40/48 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 40 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:34] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-20 18:52:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 43 places, 48 transitions and 144 arcs took 0 ms.
Total runtime 1411 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: 43 NrTr: 48 NrArc: 144)

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

net check time: 0m 0.000sec

init dd package: 0m 3.436sec


RS generation: 0m 0.019sec


-> reachability set: #nodes 907 (9.1e+02) #states 3,596 (3)



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

checking: AF [EX [0<=0]]
normalized: ~ [EG [~ [EX [0<=0]]]]

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

FORMULA ShieldRVs-PT-001B-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: EX [AG [AF [[p0<=0 & 0<=p0]]]]
normalized: EX [~ [E [true U EG [~ [[p0<=0 & 0<=p0]]]]]]

abstracting: (0<=p0)
states: 3,596 (3)
abstracting: (p0<=0)
states: 3,595 (3)
..
EG iterations: 2
.-> the formula is TRUE

FORMULA ShieldRVs-PT-001B-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AX [EF [AG [[[p39<=1 & 1<=p39] | [[p11<=0 & 0<=p11] | [p2<=1 & 1<=p2]]]]]]
normalized: ~ [EX [~ [E [true U ~ [E [true U ~ [[[[p2<=1 & 1<=p2] | [p11<=0 & 0<=p11]] | [p39<=1 & 1<=p39]]]]]]]]]

abstracting: (1<=p39)
states: 299
abstracting: (p39<=1)
states: 3,596 (3)
abstracting: (0<=p11)
states: 3,596 (3)
abstracting: (p11<=0)
states: 3,261 (3)
abstracting: (1<=p2)
states: 1,057 (3)
abstracting: (p2<=1)
states: 3,596 (3)
.-> the formula is TRUE

FORMULA ShieldRVs-PT-001B-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.048sec

checking: [A [~ [AG [[p7<=1 & 1<=p7]]] U [p4<=1 & 1<=p4]] & AF [AG [[[p8<=0 & 0<=p8] | [p41<=1 & 1<=p41]]]]]
normalized: [~ [EG [E [true U ~ [[[p41<=1 & 1<=p41] | [p8<=0 & 0<=p8]]]]]] & [~ [EG [~ [[p4<=1 & 1<=p4]]]] & ~ [E [~ [[p4<=1 & 1<=p4]] U [~ [E [true U ~ [[p7<=1 & 1<=p7]]]] & ~ [[p4<=1 & 1<=p4]]]]]]]

abstracting: (1<=p4)
states: 1
abstracting: (p4<=1)
states: 3,596 (3)
abstracting: (1<=p7)
states: 31
abstracting: (p7<=1)
states: 3,596 (3)
abstracting: (1<=p4)
states: 1
abstracting: (p4<=1)
states: 3,596 (3)
abstracting: (1<=p4)
states: 1
abstracting: (p4<=1)
states: 3,596 (3)
..
EG iterations: 2
abstracting: (0<=p8)
states: 3,596 (3)
abstracting: (p8<=0)
states: 3,513 (3)
abstracting: (1<=p41)
states: 361
abstracting: (p41<=1)
states: 3,596 (3)
............................
EG iterations: 28
-> the formula is TRUE

FORMULA ShieldRVs-PT-001B-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.020sec

checking: AX [[E [~ [[p12<=1 & 1<=p12]] U ~ [AF [~ [[p17<=1 & 1<=p17]]]]] & [[p27<=0 & 0<=p27] | [p2<=1 & 1<=p2]]]]
normalized: ~ [EX [~ [[[[p2<=1 & 1<=p2] | [p27<=0 & 0<=p27]] & E [~ [[p12<=1 & 1<=p12]] U EG [[p17<=1 & 1<=p17]]]]]]]

abstracting: (1<=p17)
states: 83
abstracting: (p17<=1)
states: 3,596 (3)
.......................
EG iterations: 23
abstracting: (1<=p12)
states: 314
abstracting: (p12<=1)
states: 3,596 (3)
abstracting: (0<=p27)
states: 3,596 (3)
abstracting: (p27<=0)
states: 3,162 (3)
abstracting: (1<=p2)
states: 1,057 (3)
abstracting: (p2<=1)
states: 3,596 (3)
.-> the formula is FALSE

FORMULA ShieldRVs-PT-001B-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

checking: ~ [E [[[EX [AX [[p26<=0 & 0<=p26]]] & EX [0<=0]] | ~ [[AG [[p27<=1 & 1<=p27]] & ~ [[p18<=1 & 1<=p18]]]]] U AF [AG [[[p29<=0 & 0<=p29] | [p0<=1 & 1<=p0]]]]]]
normalized: ~ [E [[~ [[~ [[p18<=1 & 1<=p18]] & ~ [E [true U ~ [[p27<=1 & 1<=p27]]]]]] | [EX [0<=0] & EX [~ [EX [~ [[p26<=0 & 0<=p26]]]]]]] U ~ [EG [E [true U ~ [[[p0<=1 & 1<=p0] | [p29<=0 & 0<=p29]]]]]]]]

abstracting: (0<=p29)
states: 3,596 (3)
abstracting: (p29<=0)
states: 3,129 (3)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 3,596 (3)
.
EG iterations: 1
abstracting: (0<=p26)
states: 3,596 (3)
abstracting: (p26<=0)
states: 3,186 (3)
..abstracting: (0<=0)
states: 3,596 (3)
.abstracting: (1<=p27)
states: 434
abstracting: (p27<=1)
states: 3,596 (3)
abstracting: (1<=p18)
states: 214
abstracting: (p18<=1)
states: 3,596 (3)
-> the formula is FALSE

FORMULA ShieldRVs-PT-001B-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.015sec

checking: EF [[EG [EX [EG [[p29<=1 & 1<=p29]]]] | [AF [E [[p20<=0 & 0<=p20] U [[p21<=0 & 0<=p21] | [p40<=1 & 1<=p40]]]] & EG [[p37<=0 & 0<=p37]]]]]
normalized: E [true U [[~ [EG [~ [E [[p20<=0 & 0<=p20] U [[p40<=1 & 1<=p40] | [p21<=0 & 0<=p21]]]]]] & EG [[p37<=0 & 0<=p37]]] | EG [EX [EG [[p29<=1 & 1<=p29]]]]]]

abstracting: (1<=p29)
states: 467
abstracting: (p29<=1)
states: 3,596 (3)
....................
EG iterations: 20
..
EG iterations: 1
abstracting: (0<=p37)
states: 3,596 (3)
abstracting: (p37<=0)
states: 3,242 (3)
...................
EG iterations: 19
abstracting: (0<=p21)
states: 3,596 (3)
abstracting: (p21<=0)
states: 2,482 (3)
abstracting: (1<=p40)
states: 361
abstracting: (p40<=1)
states: 3,596 (3)
abstracting: (0<=p20)
states: 3,596 (3)
abstracting: (p20<=0)
states: 2,384 (3)
.
EG iterations: 1
-> the formula is TRUE

FORMULA ShieldRVs-PT-001B-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.054sec

checking: EG [A [[EF [AG [[[p37<=0 & 0<=p37] | [p22<=1 & 1<=p22]]]] & EF [[[p14<=0 & 0<=p14] | [[p41<=1 & 1<=p41] | ~ [[p21<=0 & 0<=p21]]]]]] U ~ [[p29<=0 & 0<=p29]]]]
normalized: EG [[~ [EG [[p29<=0 & 0<=p29]]] & ~ [E [[p29<=0 & 0<=p29] U [~ [[E [true U [[~ [[p21<=0 & 0<=p21]] | [p41<=1 & 1<=p41]] | [p14<=0 & 0<=p14]]] & E [true U ~ [E [true U ~ [[[p22<=1 & 1<=p22] | [p37<=0 & 0<=p37]]]]]]]] & [p29<=0 & 0<=p29]]]]]]

abstracting: (0<=p29)
states: 3,596 (3)
abstracting: (p29<=0)
states: 3,129 (3)
abstracting: (0<=p37)
states: 3,596 (3)
abstracting: (p37<=0)
states: 3,242 (3)
abstracting: (1<=p22)
states: 36
abstracting: (p22<=1)
states: 3,596 (3)
abstracting: (0<=p14)
states: 3,596 (3)
abstracting: (p14<=0)
states: 3,243 (3)
abstracting: (1<=p41)
states: 361
abstracting: (p41<=1)
states: 3,596 (3)
abstracting: (0<=p21)
states: 3,596 (3)
abstracting: (p21<=0)
states: 2,482 (3)
abstracting: (0<=p29)
states: 3,596 (3)
abstracting: (p29<=0)
states: 3,129 (3)
abstracting: (0<=p29)
states: 3,596 (3)
abstracting: (p29<=0)
states: 3,129 (3)
........................................
EG iterations: 40
........................
EG iterations: 24
-> the formula is TRUE

FORMULA ShieldRVs-PT-001B-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.113sec

checking: E [~ [EF [[[p5<=0 & 0<=p5] | [p23<=1 & 1<=p23]]]] U [EX [E [~ [[p12<=1 & 1<=p12]] U [AX [[p42<=1 & 1<=p42]] | [[p13<=0 & 0<=p13] | [p9<=1 & 1<=p9]]]]] & EF [[EG [[[[p5<=0 & 0<=p5] | [p33<=1 & 1<=p33]] & [p0<=1 & 1<=p0]]] & EX [~ [[[p29<=0 & 0<=p29] | [p36<=1 & 1<=p36]]]]]]]]
normalized: E [~ [E [true U [[p23<=1 & 1<=p23] | [p5<=0 & 0<=p5]]]] U [E [true U [EX [~ [[[p36<=1 & 1<=p36] | [p29<=0 & 0<=p29]]]] & EG [[[p0<=1 & 1<=p0] & [[p33<=1 & 1<=p33] | [p5<=0 & 0<=p5]]]]]] & EX [E [~ [[p12<=1 & 1<=p12]] U [[[p9<=1 & 1<=p9] | [p13<=0 & 0<=p13]] | ~ [EX [~ [[p42<=1 & 1<=p42]]]]]]]]]

abstracting: (1<=p42)
states: 37
abstracting: (p42<=1)
states: 3,596 (3)
.abstracting: (0<=p13)
states: 3,596 (3)
abstracting: (p13<=0)
states: 3,282 (3)
abstracting: (1<=p9)
states: 495
abstracting: (p9<=1)
states: 3,596 (3)
abstracting: (1<=p12)
states: 314
abstracting: (p12<=1)
states: 3,596 (3)
.abstracting: (0<=p5)
states: 3,596 (3)
abstracting: (p5<=0)
states: 3,595 (3)
abstracting: (1<=p33)
states: 324
abstracting: (p33<=1)
states: 3,596 (3)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 3,596 (3)
..
EG iterations: 2
abstracting: (0<=p29)
states: 3,596 (3)
abstracting: (p29<=0)
states: 3,129 (3)
abstracting: (1<=p36)
states: 294
abstracting: (p36<=1)
states: 3,596 (3)
.abstracting: (0<=p5)
states: 3,596 (3)
abstracting: (p5<=0)
states: 3,595 (3)
abstracting: (1<=p23)
states: 431
abstracting: (p23<=1)
states: 3,596 (3)
-> the formula is FALSE

FORMULA ShieldRVs-PT-001B-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: E [~ [[EG [~ [AX [[p11<=0 & 0<=p11]]]] | [EF [[p26<=1 & 1<=p26]] | [~ [[p15<=1 & 1<=p15]] & A [[p20<=1 & 1<=p20] U [[p37<=0 & 0<=p37] | [p26<=1 & 1<=p26]]]]]]] U [~ [EG [AF [[[p3<=0 & 0<=p3] | [p2<=1 & 1<=p2]]]]] & [~ [E [~ [[[p35<=0 & 0<=p35] | [p14<=1 & 1<=p14]]] U ~ [[p20<=0 & 0<=p20]]]] | ~ [[~ [EX [0<=0]] | EX [[p3<=0 & 0<=p3]]]]]]]
normalized: E [~ [[[[[~ [EG [~ [[[p26<=1 & 1<=p26] | [p37<=0 & 0<=p37]]]]] & ~ [E [~ [[[p26<=1 & 1<=p26] | [p37<=0 & 0<=p37]]] U [~ [[p20<=1 & 1<=p20]] & ~ [[[p26<=1 & 1<=p26] | [p37<=0 & 0<=p37]]]]]]] & ~ [[p15<=1 & 1<=p15]]] | E [true U [p26<=1 & 1<=p26]]] | EG [EX [~ [[p11<=0 & 0<=p11]]]]]] U [[~ [[EX [[p3<=0 & 0<=p3]] | ~ [EX [0<=0]]]] | ~ [E [~ [[[p14<=1 & 1<=p14] | [p35<=0 & 0<=p35]]] U ~ [[p20<=0 & 0<=p20]]]]] & ~ [EG [~ [EG [~ [[[p2<=1 & 1<=p2] | [p3<=0 & 0<=p3]]]]]]]]]

abstracting: (0<=p3)
states: 3,596 (3)
abstracting: (p3<=0)
states: 2,321 (3)
abstracting: (1<=p2)
states: 1,057 (3)
abstracting: (p2<=1)
states: 3,596 (3)
........................
EG iterations: 24
..............................
EG iterations: 30
abstracting: (0<=p20)
states: 3,596 (3)
abstracting: (p20<=0)
states: 2,384 (3)
abstracting: (0<=p35)
states: 3,596 (3)
abstracting: (p35<=0)
states: 3,037 (3)
abstracting: (1<=p14)
states: 353
abstracting: (p14<=1)
states: 3,596 (3)
abstracting: (0<=0)
states: 3,596 (3)
.abstracting: (0<=p3)
states: 3,596 (3)
abstracting: (p3<=0)
states: 2,321 (3)
.abstracting: (0<=p11)
states: 3,596 (3)
abstracting: (p11<=0)
states: 3,261 (3)
.....................
EG iterations: 20
abstracting: (1<=p26)
states: 410
abstracting: (p26<=1)
states: 3,596 (3)
abstracting: (1<=p15)
states: 543
abstracting: (p15<=1)
states: 3,596 (3)
abstracting: (0<=p37)
states: 3,596 (3)
abstracting: (p37<=0)
states: 3,242 (3)
abstracting: (1<=p26)
states: 410
abstracting: (p26<=1)
states: 3,596 (3)
abstracting: (1<=p20)
states: 1,212 (3)
abstracting: (p20<=1)
states: 3,596 (3)
abstracting: (0<=p37)
states: 3,596 (3)
abstracting: (p37<=0)
states: 3,242 (3)
abstracting: (1<=p26)
states: 410
abstracting: (p26<=1)
states: 3,596 (3)
abstracting: (0<=p37)
states: 3,596 (3)
abstracting: (p37<=0)
states: 3,242 (3)
abstracting: (1<=p26)
states: 410
abstracting: (p26<=1)
states: 3,596 (3)
.................
EG iterations: 17
-> the formula is FALSE

FORMULA ShieldRVs-PT-001B-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.114sec

checking: AG [[AG [EF [[p6<=1 & 1<=p6]]] & [[AG [[p6<=0 & 0<=p6]] | ~ [E [[p15<=1 & 1<=p15] U [p23<=0 & 0<=p23]]]] | [AG [AF [[p14<=1 & 1<=p14]]] | [EF [[[p33<=0 & 0<=p33] | [p29<=1 & 1<=p29]]] | AX [[A [[p27<=0 & 0<=p27] U [[p12<=0 & 0<=p12] | [p0<=1 & 1<=p0]]] | [[p33<=0 & 0<=p33] | [p22<=1 & 1<=p22]]]]]]]]]
normalized: ~ [E [true U ~ [[[[[~ [EX [~ [[[[p22<=1 & 1<=p22] | [p33<=0 & 0<=p33]] | [~ [EG [~ [[[p0<=1 & 1<=p0] | [p12<=0 & 0<=p12]]]]] & ~ [E [~ [[[p0<=1 & 1<=p0] | [p12<=0 & 0<=p12]]] U [~ [[p27<=0 & 0<=p27]] & ~ [[[p0<=1 & 1<=p0] | [p12<=0 & 0<=p12]]]]]]]]]]] | E [true U [[p29<=1 & 1<=p29] | [p33<=0 & 0<=p33]]]] | ~ [E [true U EG [~ [[p14<=1 & 1<=p14]]]]]] | [~ [E [[p15<=1 & 1<=p15] U [p23<=0 & 0<=p23]]] | ~ [E [true U ~ [[p6<=0 & 0<=p6]]]]]] & ~ [E [true U ~ [E [true U [p6<=1 & 1<=p6]]]]]]]]]

abstracting: (1<=p6)
states: 4
abstracting: (p6<=1)
states: 3,596 (3)
abstracting: (0<=p6)
states: 3,596 (3)
abstracting: (p6<=0)
states: 3,592 (3)
abstracting: (0<=p23)
states: 3,596 (3)
abstracting: (p23<=0)
states: 3,165 (3)
abstracting: (1<=p15)
states: 543
abstracting: (p15<=1)
states: 3,596 (3)
abstracting: (1<=p14)
states: 353
abstracting: (p14<=1)
states: 3,596 (3)
................
EG iterations: 16
abstracting: (0<=p33)
states: 3,596 (3)
abstracting: (p33<=0)
states: 3,272 (3)
abstracting: (1<=p29)
states: 467
abstracting: (p29<=1)
states: 3,596 (3)
abstracting: (0<=p12)
states: 3,596 (3)
abstracting: (p12<=0)
states: 3,282 (3)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 3,596 (3)
abstracting: (0<=p27)
states: 3,596 (3)
abstracting: (p27<=0)
states: 3,162 (3)
abstracting: (0<=p12)
states: 3,596 (3)
abstracting: (p12<=0)
states: 3,282 (3)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 3,596 (3)
abstracting: (0<=p12)
states: 3,596 (3)
abstracting: (p12<=0)
states: 3,282 (3)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 3,596 (3)
....................
EG iterations: 20
abstracting: (0<=p33)
states: 3,596 (3)
abstracting: (p33<=0)
states: 3,272 (3)
abstracting: (1<=p22)
states: 36
abstracting: (p22<=1)
states: 3,596 (3)
.-> the formula is FALSE

FORMULA ShieldRVs-PT-001B-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.053sec

totally nodes used: 339009 (3.4e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 375190 1011716 1386906
used/not used/entry size/cache size: 1330872 65777992 16 1024MB
basic ops cache: hits/miss/sum: 93213 223663 316876
used/not used/entry size/cache size: 423276 16353940 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: 2504 6952 9456
used/not used/entry size/cache size: 6950 8381658 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 66788910
1 302821
2 15361
3 1632
4 131
5 8
6 1
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 6.065sec


BK_STOP 1679338360677

--------------------
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:2207 (45), effective:255 (5)

initing FirstDep: 0m 0.000sec


iterations count:1024 (21), effective:127 (2)

iterations count:1161 (24), effective:127 (2)

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

iterations count:67 (1), effective:6 (0)

iterations count:538 (11), effective:76 (1)

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

iterations count:1159 (24), effective:126 (2)

iterations count:271 (5), effective:22 (0)

iterations count:381 (7), effective:38 (0)

iterations count:874 (18), effective:111 (2)

iterations count:1159 (24), effective:126 (2)

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

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

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

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

iterations count:843 (17), effective:120 (2)

iterations count:95 (1), effective:6 (0)

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

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

iterations count:62 (1), effective:4 (0)

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

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

iterations count:207 (4), effective:21 (0)

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

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

iterations count:48 (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="ShieldRVs-PT-001B"
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 ShieldRVs-PT-001B, 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 r426-tajo-167905978300009"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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