fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r010-oct2-167813599000430
Last Updated
May 14, 2023

About the Execution of Marcie+red for AutoFlight-PT-04b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6733.044 3600000.00 3672828.00 163.50 TFTFFFFFTFFFTFTT normal

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.r010-oct2-167813599000430.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 AutoFlight-PT-04b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813599000430
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 6.0K Feb 25 18:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 25 18:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 18:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 18:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 18:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Feb 25 18:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 18:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 25 18:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 91K Mar 5 18:22 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 AutoFlight-PT-04b-ReachabilityCardinality-00
FORMULA_NAME AutoFlight-PT-04b-ReachabilityCardinality-01
FORMULA_NAME AutoFlight-PT-04b-ReachabilityCardinality-02
FORMULA_NAME AutoFlight-PT-04b-ReachabilityCardinality-03
FORMULA_NAME AutoFlight-PT-04b-ReachabilityCardinality-04
FORMULA_NAME AutoFlight-PT-04b-ReachabilityCardinality-05
FORMULA_NAME AutoFlight-PT-04b-ReachabilityCardinality-06
FORMULA_NAME AutoFlight-PT-04b-ReachabilityCardinality-07
FORMULA_NAME AutoFlight-PT-04b-ReachabilityCardinality-08
FORMULA_NAME AutoFlight-PT-04b-ReachabilityCardinality-09
FORMULA_NAME AutoFlight-PT-04b-ReachabilityCardinality-10
FORMULA_NAME AutoFlight-PT-04b-ReachabilityCardinality-11
FORMULA_NAME AutoFlight-PT-04b-ReachabilityCardinality-12
FORMULA_NAME AutoFlight-PT-04b-ReachabilityCardinality-13
FORMULA_NAME AutoFlight-PT-04b-ReachabilityCardinality-14
FORMULA_NAME AutoFlight-PT-04b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678688761859

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=AutoFlight-PT-04b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 06:26:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 06:26:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 06:26:05] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2023-03-13 06:26:05] [INFO ] Transformed 390 places.
[2023-03-13 06:26:05] [INFO ] Transformed 388 transitions.
[2023-03-13 06:26:05] [INFO ] Found NUPN structural information;
[2023-03-13 06:26:05] [INFO ] Parsed PT model containing 390 places and 388 transitions and 906 arcs in 159 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
FORMULA AutoFlight-PT-04b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-04b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-04b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 49 resets, run finished after 537 ms. (steps per millisecond=18 ) properties (out of 13) seen :6
FORMULA AutoFlight-PT-04b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :1
FORMULA AutoFlight-PT-04b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 388 rows 390 cols
[2023-03-13 06:26:06] [INFO ] Computed 28 place invariants in 10 ms
[2023-03-13 06:26:06] [INFO ] After 469ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-13 06:26:06] [INFO ] [Nat]Absence check using 27 positive place invariants in 64 ms returned sat
[2023-03-13 06:26:06] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 26 ms returned sat
[2023-03-13 06:26:07] [INFO ] After 406ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-13 06:26:08] [INFO ] Deduced a trap composed of 45 places in 613 ms of which 19 ms to minimize.
[2023-03-13 06:26:08] [INFO ] Deduced a trap composed of 43 places in 181 ms of which 1 ms to minimize.
[2023-03-13 06:26:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 885 ms
[2023-03-13 06:26:08] [INFO ] Deduced a trap composed of 51 places in 194 ms of which 21 ms to minimize.
[2023-03-13 06:26:08] [INFO ] Deduced a trap composed of 41 places in 169 ms of which 15 ms to minimize.
[2023-03-13 06:26:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 420 ms
[2023-03-13 06:26:08] [INFO ] Deduced a trap composed of 18 places in 154 ms of which 1 ms to minimize.
[2023-03-13 06:26:09] [INFO ] Deduced a trap composed of 73 places in 138 ms of which 40 ms to minimize.
[2023-03-13 06:26:09] [INFO ] Deduced a trap composed of 51 places in 226 ms of which 14 ms to minimize.
[2023-03-13 06:26:09] [INFO ] Deduced a trap composed of 78 places in 338 ms of which 1 ms to minimize.
[2023-03-13 06:26:09] [INFO ] Deduced a trap composed of 60 places in 257 ms of which 1 ms to minimize.
[2023-03-13 06:26:10] [INFO ] Deduced a trap composed of 67 places in 118 ms of which 1 ms to minimize.
[2023-03-13 06:26:10] [INFO ] Deduced a trap composed of 61 places in 525 ms of which 1 ms to minimize.
[2023-03-13 06:26:10] [INFO ] Deduced a trap composed of 45 places in 157 ms of which 1 ms to minimize.
[2023-03-13 06:26:11] [INFO ] Deduced a trap composed of 44 places in 436 ms of which 1 ms to minimize.
[2023-03-13 06:26:11] [INFO ] Deduced a trap composed of 58 places in 166 ms of which 1 ms to minimize.
[2023-03-13 06:26:11] [INFO ] Deduced a trap composed of 58 places in 261 ms of which 1 ms to minimize.
[2023-03-13 06:26:12] [INFO ] Deduced a trap composed of 52 places in 202 ms of which 0 ms to minimize.
[2023-03-13 06:26:12] [INFO ] Deduced a trap composed of 47 places in 256 ms of which 1 ms to minimize.
[2023-03-13 06:26:12] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3594 ms
[2023-03-13 06:26:12] [INFO ] Deduced a trap composed of 53 places in 116 ms of which 0 ms to minimize.
[2023-03-13 06:26:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2023-03-13 06:26:12] [INFO ] Deduced a trap composed of 25 places in 316 ms of which 1 ms to minimize.
[2023-03-13 06:26:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 378 ms
[2023-03-13 06:26:13] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 0 ms to minimize.
[2023-03-13 06:26:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
[2023-03-13 06:26:13] [INFO ] After 6220ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 268 ms.
[2023-03-13 06:26:13] [INFO ] After 6842ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
FORMULA AutoFlight-PT-04b-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA AutoFlight-PT-04b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA AutoFlight-PT-04b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 38 ms.
Support contains 43 out of 390 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 390/390 places, 388/388 transitions.
Drop transitions removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 104 place count 390 transition count 284
Reduce places removed 104 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 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 1 with 120 rules applied. Total rules applied 224 place count 286 transition count 268
Reduce places removed 3 places and 0 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 2 with 20 rules applied. Total rules applied 244 place count 283 transition count 251
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 19 rules applied. Total rules applied 263 place count 266 transition count 249
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 43 Pre rules applied. Total rules applied 263 place count 266 transition count 206
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 349 place count 223 transition count 206
Discarding 28 places :
Symmetric choice reduction at 4 with 28 rule applications. Total rules 377 place count 195 transition count 178
Iterating global reduction 4 with 28 rules applied. Total rules applied 405 place count 195 transition count 178
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 406 place count 195 transition count 177
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 406 place count 195 transition count 170
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 420 place count 188 transition count 170
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 5 with 72 rules applied. Total rules applied 492 place count 152 transition count 134
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 496 place count 150 transition count 135
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 498 place count 150 transition count 133
Free-agglomeration rule applied 10 times.
Iterating global reduction 5 with 10 rules applied. Total rules applied 508 place count 150 transition count 123
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 518 place count 140 transition count 123
Applied a total of 518 rules in 80 ms. Remains 140 /390 variables (removed 250) and now considering 123/388 (removed 265) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 140/390 places, 123/388 transitions.
Incomplete random walk after 10000 steps, including 180 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 3) seen :1
FORMULA AutoFlight-PT-04b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 123 rows 140 cols
[2023-03-13 06:26:13] [INFO ] Computed 28 place invariants in 1 ms
[2023-03-13 06:26:13] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 06:26:13] [INFO ] [Nat]Absence check using 26 positive place invariants in 17 ms returned sat
[2023-03-13 06:26:13] [INFO ] [Nat]Absence check using 26 positive and 2 generalized place invariants in 14 ms returned sat
[2023-03-13 06:26:14] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 06:26:14] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-13 06:26:14] [INFO ] After 29ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 06:26:14] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 1 ms to minimize.
[2023-03-13 06:26:14] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 1 ms to minimize.
[2023-03-13 06:26:14] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
[2023-03-13 06:26:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 304 ms
[2023-03-13 06:26:14] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 1 ms to minimize.
[2023-03-13 06:26:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2023-03-13 06:26:14] [INFO ] After 487ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-13 06:26:14] [INFO ] After 691ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA AutoFlight-PT-04b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Finished Parikh walk after 36 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=36 )
FORMULA AutoFlight-PT-04b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 1 ms.
All properties solved without resorting to model-checking.
Total runtime 9507 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: AutoFlight_PT_04b
(NrP: 390 NrTr: 388 NrArc: 906)

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

net check time: 0m 0.000sec

init dd package: 0m 2.893sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 9419796 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16105056 kB

BK_TIME_CONFINEMENT_REACHED

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

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="AutoFlight-PT-04b"
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 AutoFlight-PT-04b, 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 r010-oct2-167813599000430"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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