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-167905978500126.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-030B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978500126
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 5.6K Feb 26 18:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 26 18:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 18:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 18:27 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.4K Feb 25 17:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 18:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 26 18:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 18:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 18:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:02 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 370K 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-030B-ReachabilityCardinality-00
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityCardinality-01
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityCardinality-02
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityCardinality-03
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityCardinality-04
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityCardinality-05
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityCardinality-06
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityCardinality-07
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityCardinality-08
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityCardinality-09
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityCardinality-10
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityCardinality-11
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityCardinality-12
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityCardinality-13
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityCardinality-14
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679342125272

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-030B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 19:55:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 19:55:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 19:55:27] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2023-03-20 19:55:27] [INFO ] Transformed 1203 places.
[2023-03-20 19:55:27] [INFO ] Transformed 1353 transitions.
[2023-03-20 19:55:27] [INFO ] Found NUPN structural information;
[2023-03-20 19:55:27] [INFO ] Parsed PT model containing 1203 places and 1353 transitions and 4320 arcs in 167 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 7 resets, run finished after 324 ms. (steps per millisecond=30 ) properties (out of 15) seen :12
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
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 :0
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 :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1353 rows 1203 cols
[2023-03-20 19:55:27] [INFO ] Computed 121 place invariants in 26 ms
[2023-03-20 19:55:27] [INFO ] After 364ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 19:55:28] [INFO ] [Nat]Absence check using 121 positive place invariants in 39 ms returned sat
[2023-03-20 19:55:29] [INFO ] After 815ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 19:55:29] [INFO ] Deduced a trap composed of 18 places in 438 ms of which 12 ms to minimize.
[2023-03-20 19:55:30] [INFO ] Deduced a trap composed of 31 places in 331 ms of which 2 ms to minimize.
[2023-03-20 19:55:30] [INFO ] Deduced a trap composed of 31 places in 312 ms of which 1 ms to minimize.
[2023-03-20 19:55:31] [INFO ] Deduced a trap composed of 28 places in 573 ms of which 1 ms to minimize.
[2023-03-20 19:55:31] [INFO ] Deduced a trap composed of 31 places in 401 ms of which 1 ms to minimize.
[2023-03-20 19:55:31] [INFO ] Deduced a trap composed of 30 places in 288 ms of which 1 ms to minimize.
[2023-03-20 19:55:32] [INFO ] Deduced a trap composed of 30 places in 273 ms of which 1 ms to minimize.
[2023-03-20 19:55:32] [INFO ] Deduced a trap composed of 29 places in 301 ms of which 1 ms to minimize.
[2023-03-20 19:55:32] [INFO ] Deduced a trap composed of 31 places in 299 ms of which 1 ms to minimize.
[2023-03-20 19:55:33] [INFO ] Deduced a trap composed of 25 places in 308 ms of which 1 ms to minimize.
[2023-03-20 19:55:33] [INFO ] Deduced a trap composed of 30 places in 292 ms of which 1 ms to minimize.
[2023-03-20 19:55:33] [INFO ] Deduced a trap composed of 41 places in 289 ms of which 1 ms to minimize.
[2023-03-20 19:55:34] [INFO ] Deduced a trap composed of 68 places in 293 ms of which 0 ms to minimize.
[2023-03-20 19:55:34] [INFO ] Deduced a trap composed of 32 places in 315 ms of which 1 ms to minimize.
[2023-03-20 19:55:34] [INFO ] Deduced a trap composed of 33 places in 312 ms of which 1 ms to minimize.
[2023-03-20 19:55:35] [INFO ] Deduced a trap composed of 39 places in 305 ms of which 1 ms to minimize.
[2023-03-20 19:55:35] [INFO ] Deduced a trap composed of 30 places in 315 ms of which 1 ms to minimize.
[2023-03-20 19:55:35] [INFO ] Deduced a trap composed of 29 places in 284 ms of which 1 ms to minimize.
[2023-03-20 19:55:36] [INFO ] Deduced a trap composed of 46 places in 274 ms of which 1 ms to minimize.
[2023-03-20 19:55:36] [INFO ] Deduced a trap composed of 31 places in 216 ms of which 1 ms to minimize.
[2023-03-20 19:55:36] [INFO ] Deduced a trap composed of 54 places in 246 ms of which 1 ms to minimize.
[2023-03-20 19:55:37] [INFO ] Deduced a trap composed of 36 places in 178 ms of which 4 ms to minimize.
[2023-03-20 19:55:37] [INFO ] Deduced a trap composed of 35 places in 207 ms of which 0 ms to minimize.
[2023-03-20 19:55:37] [INFO ] Deduced a trap composed of 51 places in 194 ms of which 0 ms to minimize.
[2023-03-20 19:55:37] [INFO ] Deduced a trap composed of 35 places in 203 ms of which 0 ms to minimize.
[2023-03-20 19:55:38] [INFO ] Deduced a trap composed of 49 places in 178 ms of which 0 ms to minimize.
[2023-03-20 19:55:38] [INFO ] Deduced a trap composed of 38 places in 166 ms of which 1 ms to minimize.
[2023-03-20 19:55:38] [INFO ] Deduced a trap composed of 42 places in 164 ms of which 0 ms to minimize.
[2023-03-20 19:55:38] [INFO ] Deduced a trap composed of 39 places in 174 ms of which 1 ms to minimize.
[2023-03-20 19:55:38] [INFO ] Deduced a trap composed of 43 places in 181 ms of which 0 ms to minimize.
[2023-03-20 19:55:39] [INFO ] Deduced a trap composed of 41 places in 197 ms of which 1 ms to minimize.
[2023-03-20 19:55:39] [INFO ] Deduced a trap composed of 53 places in 146 ms of which 0 ms to minimize.
[2023-03-20 19:55:39] [INFO ] Deduced a trap composed of 42 places in 148 ms of which 0 ms to minimize.
[2023-03-20 19:55:39] [INFO ] Deduced a trap composed of 40 places in 159 ms of which 3 ms to minimize.
[2023-03-20 19:55:39] [INFO ] Deduced a trap composed of 53 places in 176 ms of which 1 ms to minimize.
[2023-03-20 19:55:40] [INFO ] Deduced a trap composed of 46 places in 170 ms of which 0 ms to minimize.
[2023-03-20 19:55:40] [INFO ] Deduced a trap composed of 39 places in 156 ms of which 1 ms to minimize.
[2023-03-20 19:55:40] [INFO ] Deduced a trap composed of 68 places in 163 ms of which 1 ms to minimize.
[2023-03-20 19:55:40] [INFO ] Deduced a trap composed of 49 places in 165 ms of which 0 ms to minimize.
[2023-03-20 19:55:41] [INFO ] Deduced a trap composed of 48 places in 187 ms of which 1 ms to minimize.
[2023-03-20 19:55:41] [INFO ] Deduced a trap composed of 46 places in 183 ms of which 1 ms to minimize.
[2023-03-20 19:55:41] [INFO ] Deduced a trap composed of 55 places in 156 ms of which 0 ms to minimize.
[2023-03-20 19:55:41] [INFO ] Deduced a trap composed of 47 places in 172 ms of which 3 ms to minimize.
[2023-03-20 19:55:41] [INFO ] Deduced a trap composed of 45 places in 169 ms of which 1 ms to minimize.
[2023-03-20 19:55:42] [INFO ] Deduced a trap composed of 44 places in 170 ms of which 1 ms to minimize.
[2023-03-20 19:55:42] [INFO ] Deduced a trap composed of 48 places in 109 ms of which 1 ms to minimize.
[2023-03-20 19:55:42] [INFO ] Deduced a trap composed of 43 places in 112 ms of which 1 ms to minimize.
[2023-03-20 19:55:42] [INFO ] Deduced a trap composed of 47 places in 133 ms of which 1 ms to minimize.
[2023-03-20 19:55:42] [INFO ] Deduced a trap composed of 50 places in 112 ms of which 1 ms to minimize.
[2023-03-20 19:55:42] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 0 ms to minimize.
[2023-03-20 19:55:43] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 2 ms to minimize.
[2023-03-20 19:55:43] [INFO ] Trap strengthening (SAT) tested/added 52/51 trap constraints in 14007 ms
[2023-03-20 19:55:43] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 1 ms to minimize.
[2023-03-20 19:55:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2023-03-20 19:55:43] [INFO ] Deduced a trap composed of 49 places in 101 ms of which 1 ms to minimize.
[2023-03-20 19:55:43] [INFO ] Deduced a trap composed of 56 places in 131 ms of which 1 ms to minimize.
[2023-03-20 19:55:43] [INFO ] Deduced a trap composed of 48 places in 119 ms of which 1 ms to minimize.
[2023-03-20 19:55:44] [INFO ] Deduced a trap composed of 45 places in 127 ms of which 2 ms to minimize.
[2023-03-20 19:55:44] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 1 ms to minimize.
[2023-03-20 19:55:44] [INFO ] Deduced a trap composed of 54 places in 116 ms of which 1 ms to minimize.
[2023-03-20 19:55:44] [INFO ] Deduced a trap composed of 54 places in 149 ms of which 1 ms to minimize.
[2023-03-20 19:55:44] [INFO ] Deduced a trap composed of 55 places in 116 ms of which 0 ms to minimize.
[2023-03-20 19:55:44] [INFO ] Deduced a trap composed of 59 places in 139 ms of which 0 ms to minimize.
[2023-03-20 19:55:45] [INFO ] Deduced a trap composed of 57 places in 140 ms of which 0 ms to minimize.
[2023-03-20 19:55:45] [INFO ] Deduced a trap composed of 56 places in 114 ms of which 0 ms to minimize.
[2023-03-20 19:55:45] [INFO ] Deduced a trap composed of 57 places in 125 ms of which 1 ms to minimize.
[2023-03-20 19:55:45] [INFO ] Deduced a trap composed of 56 places in 129 ms of which 0 ms to minimize.
[2023-03-20 19:55:45] [INFO ] Deduced a trap composed of 55 places in 103 ms of which 3 ms to minimize.
[2023-03-20 19:55:45] [INFO ] Deduced a trap composed of 59 places in 125 ms of which 1 ms to minimize.
[2023-03-20 19:55:46] [INFO ] Deduced a trap composed of 57 places in 128 ms of which 2 ms to minimize.
[2023-03-20 19:55:46] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2758 ms
[2023-03-20 19:55:46] [INFO ] After 17886ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 105 ms.
[2023-03-20 19:55:46] [INFO ] After 18322ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 65 ms.
Support contains 7 out of 1203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1203/1203 places, 1353/1353 transitions.
Drop transitions removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 117 rules applied. Total rules applied 117 place count 1203 transition count 1236
Reduce places removed 117 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 119 rules applied. Total rules applied 236 place count 1086 transition count 1234
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 238 place count 1084 transition count 1234
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 150 Pre rules applied. Total rules applied 238 place count 1084 transition count 1084
Deduced a syphon composed of 150 places in 3 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 3 with 300 rules applied. Total rules applied 538 place count 934 transition count 1084
Discarding 205 places :
Symmetric choice reduction at 3 with 205 rule applications. Total rules 743 place count 729 transition count 879
Iterating global reduction 3 with 205 rules applied. Total rules applied 948 place count 729 transition count 879
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 86 Pre rules applied. Total rules applied 948 place count 729 transition count 793
Deduced a syphon composed of 86 places in 2 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 1120 place count 643 transition count 793
Performed 212 Post agglomeration using F-continuation condition.Transition count delta: 212
Deduced a syphon composed of 212 places in 1 ms
Reduce places removed 212 places and 0 transitions.
Iterating global reduction 3 with 424 rules applied. Total rules applied 1544 place count 431 transition count 581
Partial Free-agglomeration rule applied 61 times.
Drop transitions removed 61 transitions
Iterating global reduction 3 with 61 rules applied. Total rules applied 1605 place count 431 transition count 581
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1606 place count 430 transition count 580
Applied a total of 1606 rules in 298 ms. Remains 430 /1203 variables (removed 773) and now considering 580/1353 (removed 773) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 300 ms. Remains : 430/1203 places, 580/1353 transitions.
Incomplete random walk after 10000 steps, including 27 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :1
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Finished Best-First random walk after 2471 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=411 )
FORMULA ShieldRVs-PT-030B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 19905 ms.
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=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: ShieldRVs_PT_030B
(NrP: 1203 NrTr: 1353 NrArc: 4320)

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

net check time: 0m 0.000sec

init dd package: 0m 3.364sec


before gc: list nodes free: 695316

after gc: idd nodes used:45090907, unused:18909093; list nodes free:83870130

RS generation: 27m28.036sec


-> last computed set: #nodes 45089706 (4.5e+07) #states 1,289,520,874,255,604,453,019,930 (24)


CANNOT_COMPUTE


BK_STOP 1679343829320

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

idd.cc:820: DD Exception: No free nodes

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-030B"
export BK_EXAMINATION="ReachabilityCardinality"
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-030B, examination is ReachabilityCardinality"
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-167905978500126"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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