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.r394-oct2-167903717500111.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ShieldIIPs-PT-020B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717500111
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 720K
-rw-r--r-- 1 mcc users 7.3K Feb 25 16:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 16:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 16:36 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.9K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Feb 25 16:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 16:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 16:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 25 16:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 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 332K 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 ShieldIIPs-PT-020B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679490449690

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-020B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 13:07:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 13:07:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 13:07:32] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2023-03-22 13:07:32] [INFO ] Transformed 1203 places.
[2023-03-22 13:07:32] [INFO ] Transformed 1183 transitions.
[2023-03-22 13:07:32] [INFO ] Found NUPN structural information;
[2023-03-22 13:07:32] [INFO ] Parsed PT model containing 1203 places and 1183 transitions and 3566 arcs in 211 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 3 resets, run finished after 340 ms. (steps per millisecond=29 ) properties (out of 16) seen :13
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1183 rows 1203 cols
[2023-03-22 13:07:32] [INFO ] Computed 181 place invariants in 20 ms
[2023-03-22 13:07:33] [INFO ] [Real]Absence check using 181 positive place invariants in 127 ms returned sat
[2023-03-22 13:07:33] [INFO ] After 715ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 13:07:34] [INFO ] [Nat]Absence check using 181 positive place invariants in 50 ms returned sat
[2023-03-22 13:07:34] [INFO ] After 785ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 13:07:35] [INFO ] Deduced a trap composed of 21 places in 543 ms of which 5 ms to minimize.
[2023-03-22 13:07:35] [INFO ] Deduced a trap composed of 31 places in 350 ms of which 2 ms to minimize.
[2023-03-22 13:07:36] [INFO ] Deduced a trap composed of 14 places in 263 ms of which 1 ms to minimize.
[2023-03-22 13:07:36] [INFO ] Deduced a trap composed of 20 places in 266 ms of which 1 ms to minimize.
[2023-03-22 13:07:36] [INFO ] Deduced a trap composed of 39 places in 369 ms of which 1 ms to minimize.
[2023-03-22 13:07:37] [INFO ] Deduced a trap composed of 34 places in 263 ms of which 1 ms to minimize.
[2023-03-22 13:07:37] [INFO ] Deduced a trap composed of 30 places in 299 ms of which 1 ms to minimize.
[2023-03-22 13:07:38] [INFO ] Deduced a trap composed of 28 places in 350 ms of which 0 ms to minimize.
[2023-03-22 13:07:38] [INFO ] Deduced a trap composed of 31 places in 332 ms of which 1 ms to minimize.
[2023-03-22 13:07:38] [INFO ] Deduced a trap composed of 23 places in 283 ms of which 0 ms to minimize.
[2023-03-22 13:07:39] [INFO ] Deduced a trap composed of 19 places in 448 ms of which 1 ms to minimize.
[2023-03-22 13:07:39] [INFO ] Deduced a trap composed of 36 places in 242 ms of which 1 ms to minimize.
[2023-03-22 13:07:40] [INFO ] Deduced a trap composed of 30 places in 393 ms of which 1 ms to minimize.
[2023-03-22 13:07:40] [INFO ] Deduced a trap composed of 27 places in 240 ms of which 0 ms to minimize.
[2023-03-22 13:07:40] [INFO ] Deduced a trap composed of 32 places in 237 ms of which 0 ms to minimize.
[2023-03-22 13:07:40] [INFO ] Deduced a trap composed of 48 places in 222 ms of which 1 ms to minimize.
[2023-03-22 13:07:41] [INFO ] Deduced a trap composed of 43 places in 243 ms of which 1 ms to minimize.
[2023-03-22 13:07:41] [INFO ] Deduced a trap composed of 42 places in 413 ms of which 1 ms to minimize.
[2023-03-22 13:07:42] [INFO ] Deduced a trap composed of 49 places in 214 ms of which 0 ms to minimize.
[2023-03-22 13:07:42] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 7236 ms
[2023-03-22 13:07:42] [INFO ] Deduced a trap composed of 19 places in 278 ms of which 1 ms to minimize.
[2023-03-22 13:07:43] [INFO ] Deduced a trap composed of 28 places in 243 ms of which 1 ms to minimize.
[2023-03-22 13:07:43] [INFO ] Deduced a trap composed of 23 places in 241 ms of which 13 ms to minimize.
[2023-03-22 13:07:43] [INFO ] Deduced a trap composed of 20 places in 391 ms of which 1 ms to minimize.
[2023-03-22 13:07:44] [INFO ] Deduced a trap composed of 22 places in 345 ms of which 1 ms to minimize.
[2023-03-22 13:07:44] [INFO ] Deduced a trap composed of 40 places in 243 ms of which 0 ms to minimize.
[2023-03-22 13:07:44] [INFO ] Deduced a trap composed of 32 places in 236 ms of which 0 ms to minimize.
[2023-03-22 13:07:45] [INFO ] Deduced a trap composed of 34 places in 239 ms of which 1 ms to minimize.
[2023-03-22 13:07:45] [INFO ] Deduced a trap composed of 32 places in 346 ms of which 1 ms to minimize.
[2023-03-22 13:07:45] [INFO ] Deduced a trap composed of 43 places in 293 ms of which 1 ms to minimize.
[2023-03-22 13:07:46] [INFO ] Deduced a trap composed of 31 places in 262 ms of which 1 ms to minimize.
[2023-03-22 13:07:46] [INFO ] Deduced a trap composed of 44 places in 283 ms of which 1 ms to minimize.
[2023-03-22 13:07:46] [INFO ] Deduced a trap composed of 47 places in 285 ms of which 0 ms to minimize.
[2023-03-22 13:07:47] [INFO ] Deduced a trap composed of 37 places in 281 ms of which 4 ms to minimize.
[2023-03-22 13:07:47] [INFO ] Deduced a trap composed of 40 places in 248 ms of which 8 ms to minimize.
[2023-03-22 13:07:48] [INFO ] Deduced a trap composed of 45 places in 332 ms of which 0 ms to minimize.
[2023-03-22 13:07:48] [INFO ] Deduced a trap composed of 47 places in 280 ms of which 0 ms to minimize.
[2023-03-22 13:07:48] [INFO ] Deduced a trap composed of 47 places in 199 ms of which 1 ms to minimize.
[2023-03-22 13:07:49] [INFO ] Deduced a trap composed of 44 places in 301 ms of which 1 ms to minimize.
[2023-03-22 13:07:49] [INFO ] Deduced a trap composed of 39 places in 326 ms of which 1 ms to minimize.
[2023-03-22 13:07:49] [INFO ] Deduced a trap composed of 61 places in 309 ms of which 1 ms to minimize.
[2023-03-22 13:07:50] [INFO ] Deduced a trap composed of 53 places in 224 ms of which 0 ms to minimize.
[2023-03-22 13:07:50] [INFO ] Deduced a trap composed of 47 places in 250 ms of which 0 ms to minimize.
[2023-03-22 13:07:50] [INFO ] Deduced a trap composed of 56 places in 271 ms of which 0 ms to minimize.
[2023-03-22 13:07:51] [INFO ] Deduced a trap composed of 58 places in 213 ms of which 1 ms to minimize.
[2023-03-22 13:07:51] [INFO ] Deduced a trap composed of 68 places in 212 ms of which 0 ms to minimize.
[2023-03-22 13:07:51] [INFO ] Deduced a trap composed of 60 places in 274 ms of which 1 ms to minimize.
[2023-03-22 13:07:51] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 9469 ms
[2023-03-22 13:07:52] [INFO ] Deduced a trap composed of 30 places in 312 ms of which 1 ms to minimize.
[2023-03-22 13:07:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 461 ms
[2023-03-22 13:07:52] [INFO ] After 18366ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 374 ms.
[2023-03-22 13:07:52] [INFO ] After 19154ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 185 ms.
Support contains 48 out of 1203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1203/1203 places, 1183/1183 transitions.
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 1203 transition count 1093
Reduce places removed 90 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 91 rules applied. Total rules applied 181 place count 1113 transition count 1092
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 182 place count 1112 transition count 1092
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 182 place count 1112 transition count 992
Deduced a syphon composed of 100 places in 4 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 382 place count 1012 transition count 992
Discarding 132 places :
Symmetric choice reduction at 3 with 132 rule applications. Total rules 514 place count 880 transition count 860
Iterating global reduction 3 with 132 rules applied. Total rules applied 646 place count 880 transition count 860
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 646 place count 880 transition count 809
Deduced a syphon composed of 51 places in 3 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 748 place count 829 transition count 809
Performed 282 Post agglomeration using F-continuation condition.Transition count delta: 282
Deduced a syphon composed of 282 places in 1 ms
Reduce places removed 282 places and 0 transitions.
Iterating global reduction 3 with 564 rules applied. Total rules applied 1312 place count 547 transition count 527
Partial Free-agglomeration rule applied 123 times.
Drop transitions removed 123 transitions
Iterating global reduction 3 with 123 rules applied. Total rules applied 1435 place count 547 transition count 527
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1436 place count 546 transition count 526
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1437 place count 545 transition count 526
Applied a total of 1437 rules in 441 ms. Remains 545 /1203 variables (removed 658) and now considering 526/1183 (removed 657) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 443 ms. Remains : 545/1203 places, 526/1183 transitions.
Finished random walk after 2229 steps, including 1 resets, run visited all 3 properties in 44 ms. (steps per millisecond=50 )
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 21359 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=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: ShieldIIPs_PT_020B
(NrP: 1203 NrTr: 1183 NrArc: 3566)

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

net check time: 0m 0.013sec

init dd package: 0m 2.881sec


before gc: list nodes free: 1472621

after gc: idd nodes used:48760843, unused:15239157; list nodes free:70764296

RS generation: 14m13.386sec


-> last computed set: #nodes 48759642 (4.9e+07) #states 10,761,701,052,631,578,947,368,421 (25)


CANNOT_COMPUTE


BK_STOP 1679491357759

--------------------
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 ReachabilityFireability -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.004sec

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="ShieldIIPs-PT-020B"
export BK_EXAMINATION="ReachabilityFireability"
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 ShieldIIPs-PT-020B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r394-oct2-167903717500111"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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