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

About the Execution of LTSMin+red for DES-PT-05b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
425.308 19204.00 55595.00 319.70 TTTFTTTFTTFFTFFF 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.r105-tall-167814481200407.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is DES-PT-05b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814481200407
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 5.6K Feb 26 15:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 26 15:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 15:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 15:43 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.5K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 15:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 26 15:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 15:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 15:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 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 73K 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 DES-PT-05b-ReachabilityFireability-00
FORMULA_NAME DES-PT-05b-ReachabilityFireability-01
FORMULA_NAME DES-PT-05b-ReachabilityFireability-02
FORMULA_NAME DES-PT-05b-ReachabilityFireability-03
FORMULA_NAME DES-PT-05b-ReachabilityFireability-04
FORMULA_NAME DES-PT-05b-ReachabilityFireability-05
FORMULA_NAME DES-PT-05b-ReachabilityFireability-06
FORMULA_NAME DES-PT-05b-ReachabilityFireability-07
FORMULA_NAME DES-PT-05b-ReachabilityFireability-08
FORMULA_NAME DES-PT-05b-ReachabilityFireability-09
FORMULA_NAME DES-PT-05b-ReachabilityFireability-10
FORMULA_NAME DES-PT-05b-ReachabilityFireability-11
FORMULA_NAME DES-PT-05b-ReachabilityFireability-12
FORMULA_NAME DES-PT-05b-ReachabilityFireability-13
FORMULA_NAME DES-PT-05b-ReachabilityFireability-14
FORMULA_NAME DES-PT-05b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678292347968

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=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-05b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 16:19:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 16:19:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 16:19:09] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2023-03-08 16:19:09] [INFO ] Transformed 300 places.
[2023-03-08 16:19:09] [INFO ] Transformed 251 transitions.
[2023-03-08 16:19:09] [INFO ] Found NUPN structural information;
[2023-03-08 16:19:09] [INFO ] Parsed PT model containing 300 places and 251 transitions and 747 arcs in 124 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 90 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 16) seen :14
FORMULA DES-PT-05b-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05b-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05b-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05b-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05b-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05b-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :1
FORMULA DES-PT-05b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 251 rows 300 cols
[2023-03-08 16:19:09] [INFO ] Computed 65 place invariants in 24 ms
[2023-03-08 16:19:10] [INFO ] After 227ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 16:19:10] [INFO ] [Nat]Absence check using 40 positive place invariants in 14 ms returned sat
[2023-03-08 16:19:10] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-08 16:19:10] [INFO ] After 231ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 16:19:10] [INFO ] After 367ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 197 ms.
[2023-03-08 16:19:10] [INFO ] After 694ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 38 out of 300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 251/251 transitions.
Graph (complete) has 561 edges and 300 vertex of which 290 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 290 transition count 238
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 282 transition count 236
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 22 place count 280 transition count 236
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 22 place count 280 transition count 228
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 38 place count 272 transition count 228
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 57 place count 253 transition count 209
Iterating global reduction 3 with 19 rules applied. Total rules applied 76 place count 253 transition count 209
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 89 place count 240 transition count 196
Iterating global reduction 3 with 13 rules applied. Total rules applied 102 place count 240 transition count 196
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 12 rules applied. Total rules applied 114 place count 240 transition count 184
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 115 place count 239 transition count 184
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 115 place count 239 transition count 183
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 117 place count 238 transition count 183
Performed 53 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 5 with 106 rules applied. Total rules applied 223 place count 185 transition count 129
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 226 place count 185 transition count 126
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 229 place count 182 transition count 126
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 235 place count 182 transition count 126
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 236 place count 181 transition count 125
Applied a total of 236 rules in 144 ms. Remains 181 /300 variables (removed 119) and now considering 125/251 (removed 126) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 181/300 places, 125/251 transitions.
Incomplete random walk after 10000 steps, including 163 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1708199 steps, run timeout after 3001 ms. (steps per millisecond=569 ) properties seen :{}
Probabilistic random walk after 1708199 steps, saw 241445 distinct states, run finished after 3002 ms. (steps per millisecond=569 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 125 rows 181 cols
[2023-03-08 16:19:14] [INFO ] Computed 60 place invariants in 9 ms
[2023-03-08 16:19:14] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 16:19:14] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 16:19:14] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 33 ms returned sat
[2023-03-08 16:19:14] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 16:19:14] [INFO ] After 218ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 75 ms.
[2023-03-08 16:19:14] [INFO ] After 388ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 38 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 125/125 transitions.
Applied a total of 0 rules in 7 ms. Remains 181 /181 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 181/181 places, 125/125 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 125/125 transitions.
Applied a total of 0 rules in 5 ms. Remains 181 /181 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-08 16:19:14] [INFO ] Invariant cache hit.
[2023-03-08 16:19:14] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-08 16:19:14] [INFO ] Invariant cache hit.
[2023-03-08 16:19:14] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2023-03-08 16:19:14] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 16:19:14] [INFO ] Invariant cache hit.
[2023-03-08 16:19:15] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 398 ms. Remains : 181/181 places, 125/125 transitions.
Applied a total of 0 rules in 6 ms. Remains 181 /181 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-08 16:19:15] [INFO ] Invariant cache hit.
[2023-03-08 16:19:15] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 16:19:15] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 16:19:15] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 22 ms returned sat
[2023-03-08 16:19:15] [INFO ] After 120ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 16:19:15] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2023-03-08 16:19:15] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 2 ms to minimize.
[2023-03-08 16:19:15] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2023-03-08 16:19:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 177 ms
[2023-03-08 16:19:15] [INFO ] After 362ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 75 ms.
[2023-03-08 16:19:15] [INFO ] After 520ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-08 16:19:15] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2023-03-08 16:19:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 181 places, 125 transitions and 495 arcs took 3 ms.
[2023-03-08 16:19:15] [INFO ] Flatten gal took : 43 ms
Total runtime 6371 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/498/inv_0_ --inv-par
FORMULA DES-PT-05b-ReachabilityFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678292367172

--------------------
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
mcc2023
rfs formula name DES-PT-05b-ReachabilityFireability-07
rfs formula type EF
rfs formula formula --invariant=/tmp/498/inv_0_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 181 places, 125 transitions and 495 arcs
pnml2lts-sym: Petri net DES_PT_05b analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 125->121 groups
pnml2lts-sym: Regrouping took 0.020 real 0.020 user 0.000 sys
pnml2lts-sym: state vector length is 181; there are 121 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: Exploration took 733750 group checks and 0 next state calls
pnml2lts-sym: reachability took 9.710 real 38.810 user 0.000 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.020 real 0.080 user 0.000 sys
pnml2lts-sym: state space has 396102875161148 states, 62707 nodes
pnml2lts-sym: group_next: 1280 nodes total
pnml2lts-sym: group_explored: 1592 nodes, 25758 short vectors total
pnml2lts-sym: max token count: 1

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="DES-PT-05b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is DES-PT-05b, 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 r105-tall-167814481200407"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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