About the Execution of Marcie+red for AutoFlight-PT-06b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
6601.644 | 3600000.00 | 3650177.00 | 122.70 | TTTTTTTFTTFFTFFT | 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-167813599100462.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-06b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813599100462
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 6.2K Feb 25 18:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 18:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 18:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 18:08 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.3K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 18:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 18:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 18:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 25 18:09 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 134K 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-06b-ReachabilityCardinality-00
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-01
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-02
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-03
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-04
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-05
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-06
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-07
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-08
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-09
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-10
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-11
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-12
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-13
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-14
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1678691268192
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-06b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 07:07:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 07:07:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 07:07:50] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2023-03-13 07:07:50] [INFO ] Transformed 574 places.
[2023-03-13 07:07:50] [INFO ] Transformed 572 transitions.
[2023-03-13 07:07:50] [INFO ] Found NUPN structural information;
[2023-03-13 07:07:50] [INFO ] Parsed PT model containing 574 places and 572 transitions and 1334 arcs in 170 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 34 resets, run finished after 402 ms. (steps per millisecond=24 ) properties (out of 11) seen :4
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :1
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :1
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 572 rows 574 cols
[2023-03-13 07:07:51] [INFO ] Computed 40 place invariants in 18 ms
[2023-03-13 07:07:51] [INFO ] After 490ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 07:07:52] [INFO ] [Nat]Absence check using 39 positive place invariants in 24 ms returned sat
[2023-03-13 07:07:52] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 6 ms returned sat
[2023-03-13 07:07:52] [INFO ] After 421ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-13 07:07:52] [INFO ] Deduced a trap composed of 67 places in 195 ms of which 7 ms to minimize.
[2023-03-13 07:07:52] [INFO ] Deduced a trap composed of 48 places in 189 ms of which 1 ms to minimize.
[2023-03-13 07:07:53] [INFO ] Deduced a trap composed of 26 places in 152 ms of which 1 ms to minimize.
[2023-03-13 07:07:53] [INFO ] Deduced a trap composed of 48 places in 154 ms of which 1 ms to minimize.
[2023-03-13 07:07:53] [INFO ] Deduced a trap composed of 65 places in 153 ms of which 0 ms to minimize.
[2023-03-13 07:07:53] [INFO ] Deduced a trap composed of 57 places in 165 ms of which 1 ms to minimize.
[2023-03-13 07:07:53] [INFO ] Deduced a trap composed of 21 places in 172 ms of which 14 ms to minimize.
[2023-03-13 07:07:54] [INFO ] Deduced a trap composed of 52 places in 148 ms of which 1 ms to minimize.
[2023-03-13 07:07:54] [INFO ] Deduced a trap composed of 52 places in 172 ms of which 0 ms to minimize.
[2023-03-13 07:07:54] [INFO ] Deduced a trap composed of 31 places in 416 ms of which 1 ms to minimize.
[2023-03-13 07:07:54] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2310 ms
[2023-03-13 07:07:55] [INFO ] Deduced a trap composed of 41 places in 267 ms of which 1 ms to minimize.
[2023-03-13 07:07:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 329 ms
[2023-03-13 07:07:55] [INFO ] Deduced a trap composed of 53 places in 209 ms of which 1 ms to minimize.
[2023-03-13 07:07:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 270 ms
[2023-03-13 07:07:55] [INFO ] Deduced a trap composed of 84 places in 254 ms of which 1 ms to minimize.
[2023-03-13 07:07:56] [INFO ] Deduced a trap composed of 58 places in 191 ms of which 1 ms to minimize.
[2023-03-13 07:07:56] [INFO ] Deduced a trap composed of 48 places in 267 ms of which 1 ms to minimize.
[2023-03-13 07:07:56] [INFO ] Deduced a trap composed of 54 places in 173 ms of which 0 ms to minimize.
[2023-03-13 07:07:56] [INFO ] Deduced a trap composed of 59 places in 176 ms of which 1 ms to minimize.
[2023-03-13 07:07:57] [INFO ] Deduced a trap composed of 72 places in 212 ms of which 0 ms to minimize.
[2023-03-13 07:07:57] [INFO ] Deduced a trap composed of 74 places in 183 ms of which 0 ms to minimize.
[2023-03-13 07:07:57] [INFO ] Deduced a trap composed of 96 places in 175 ms of which 2 ms to minimize.
[2023-03-13 07:07:57] [INFO ] Deduced a trap composed of 93 places in 141 ms of which 1 ms to minimize.
[2023-03-13 07:07:57] [INFO ] Deduced a trap composed of 90 places in 149 ms of which 1 ms to minimize.
[2023-03-13 07:07:57] [INFO ] Deduced a trap composed of 67 places in 138 ms of which 0 ms to minimize.
[2023-03-13 07:07:58] [INFO ] Deduced a trap composed of 90 places in 230 ms of which 0 ms to minimize.
[2023-03-13 07:07:58] [INFO ] Deduced a trap composed of 93 places in 230 ms of which 1 ms to minimize.
[2023-03-13 07:07:58] [INFO ] Deduced a trap composed of 58 places in 156 ms of which 0 ms to minimize.
[2023-03-13 07:07:58] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3133 ms
[2023-03-13 07:07:58] [INFO ] After 6724ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 292 ms.
[2023-03-13 07:07:59] [INFO ] After 7274ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 92 ms.
Support contains 8 out of 574 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 574/574 places, 572/572 transitions.
Drop transitions removed 214 transitions
Trivial Post-agglo rules discarded 214 transitions
Performed 214 trivial Post agglomeration. Transition count delta: 214
Iterating post reduction 0 with 214 rules applied. Total rules applied 214 place count 574 transition count 358
Reduce places removed 214 places and 0 transitions.
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 253 rules applied. Total rules applied 467 place count 360 transition count 319
Reduce places removed 12 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 16 rules applied. Total rules applied 483 place count 348 transition count 315
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 488 place count 344 transition count 314
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 78 Pre rules applied. Total rules applied 488 place count 344 transition count 236
Deduced a syphon composed of 78 places in 1 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 4 with 156 rules applied. Total rules applied 644 place count 266 transition count 236
Discarding 53 places :
Symmetric choice reduction at 4 with 53 rule applications. Total rules 697 place count 213 transition count 183
Iterating global reduction 4 with 53 rules applied. Total rules applied 750 place count 213 transition count 183
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 750 place count 213 transition count 167
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 782 place count 197 transition count 167
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 872 place count 152 transition count 122
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 874 place count 152 transition count 120
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 876 place count 151 transition count 119
Free-agglomeration rule applied 22 times.
Iterating global reduction 4 with 22 rules applied. Total rules applied 898 place count 151 transition count 97
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 920 place count 129 transition count 97
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 921 place count 128 transition count 96
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 5 with 21 rules applied. Total rules applied 942 place count 116 transition count 87
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 10 rules applied. Total rules applied 952 place count 107 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 953 place count 106 transition count 86
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 13 Pre rules applied. Total rules applied 953 place count 106 transition count 73
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 8 with 26 rules applied. Total rules applied 979 place count 93 transition count 73
Applied a total of 979 rules in 102 ms. Remains 93 /574 variables (removed 481) and now considering 73/572 (removed 499) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 93/574 places, 73/572 transitions.
Finished random walk after 1048 steps, including 26 resets, run visited all 2 properties in 7 ms. (steps per millisecond=149 )
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 8929 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_06b
(NrP: 574 NrTr: 572 NrArc: 1334)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.023sec
net check time: 0m 0.000sec
init dd package: 0m 2.875sec
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 9547344 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16101924 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:
++ 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
++ 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.001sec
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-06b"
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-06b, 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-167813599100462"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-06b.tgz
mv AutoFlight-PT-06b 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 '
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 ;