fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r066-tajo-158922814600615
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for DiscoveryGPU-PT-07b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15741.700 13151.00 24669.00 164.00 TFFFTTTFTFTTFTFF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r066-tajo-158922814600615.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DiscoveryGPU-PT-07b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922814600615
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 232K
-rw-r--r-- 1 mcc users 3.8K Mar 31 06:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 31 06:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 29 23:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 29 23:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 8 14:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 14:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 28 14:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 27 07:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 27 07:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 54K Mar 24 05:37 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 DiscoveryGPU-PT-07b-ReachabilityFireability-00
FORMULA_NAME DiscoveryGPU-PT-07b-ReachabilityFireability-01
FORMULA_NAME DiscoveryGPU-PT-07b-ReachabilityFireability-02
FORMULA_NAME DiscoveryGPU-PT-07b-ReachabilityFireability-03
FORMULA_NAME DiscoveryGPU-PT-07b-ReachabilityFireability-04
FORMULA_NAME DiscoveryGPU-PT-07b-ReachabilityFireability-05
FORMULA_NAME DiscoveryGPU-PT-07b-ReachabilityFireability-06
FORMULA_NAME DiscoveryGPU-PT-07b-ReachabilityFireability-07
FORMULA_NAME DiscoveryGPU-PT-07b-ReachabilityFireability-08
FORMULA_NAME DiscoveryGPU-PT-07b-ReachabilityFireability-09
FORMULA_NAME DiscoveryGPU-PT-07b-ReachabilityFireability-10
FORMULA_NAME DiscoveryGPU-PT-07b-ReachabilityFireability-11
FORMULA_NAME DiscoveryGPU-PT-07b-ReachabilityFireability-12
FORMULA_NAME DiscoveryGPU-PT-07b-ReachabilityFireability-13
FORMULA_NAME DiscoveryGPU-PT-07b-ReachabilityFireability-14
FORMULA_NAME DiscoveryGPU-PT-07b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1590129667769

[2020-05-22 06:41:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-22 06:41:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 06:41:10] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2020-05-22 06:41:10] [INFO ] Transformed 212 places.
[2020-05-22 06:41:10] [INFO ] Transformed 224 transitions.
[2020-05-22 06:41:10] [INFO ] Found NUPN structural information;
[2020-05-22 06:41:10] [INFO ] Parsed PT model containing 212 places and 224 transitions in 158 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 38 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 43 resets, run finished after 54 ms. (steps per millisecond=185 ) properties seen :[0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1]
FORMULA DiscoveryGPU-PT-07b-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-07b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-07b-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-07b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-07b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-07b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-07b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DiscoveryGPU-PT-07b-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[1, 0, 0, 0, 0, 0, 0, 0]
FORMULA DiscoveryGPU-PT-07b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[1, 0, 0, 0, 0, 0, 0]
FORMULA DiscoveryGPU-PT-07b-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 1, 0, 0, 0, 0]
FORMULA DiscoveryGPU-PT-07b-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 224 rows 212 cols
[2020-05-22 06:41:10] [INFO ] Computed 9 place invariants in 15 ms
[2020-05-22 06:41:11] [INFO ] [Real]Absence check using 9 positive place invariants in 81 ms returned unsat
[2020-05-22 06:41:11] [INFO ] [Real]Absence check using 9 positive place invariants in 36 ms returned sat
[2020-05-22 06:41:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 06:41:12] [INFO ] [Real]Absence check using state equation in 790 ms returned sat
[2020-05-22 06:41:12] [INFO ] Deduced a trap composed of 58 places in 210 ms
[2020-05-22 06:41:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 289 ms
[2020-05-22 06:41:12] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 06:41:13] [INFO ] [Nat]Absence check using 9 positive place invariants in 537 ms returned sat
[2020-05-22 06:41:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 06:41:13] [INFO ] [Nat]Absence check using state equation in 243 ms returned sat
[2020-05-22 06:41:13] [INFO ] Deduced a trap composed of 58 places in 192 ms
[2020-05-22 06:41:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 240 ms
[2020-05-22 06:41:13] [INFO ] Computed and/alt/rep : 223/533/223 causal constraints in 38 ms.
[2020-05-22 06:41:14] [INFO ] Added : 164 causal constraints over 33 iterations in 741 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2020-05-22 06:41:14] [INFO ] [Real]Absence check using 9 positive place invariants in 12 ms returned unsat
[2020-05-22 06:41:14] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2020-05-22 06:41:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 06:41:14] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2020-05-22 06:41:14] [INFO ] Computed and/alt/rep : 223/533/223 causal constraints in 10 ms.
[2020-05-22 06:41:14] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 06:41:19] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 06:41:19] [INFO ] [Nat]Absence check using 9 positive place invariants in 4970 ms returned (error "Failed to check-sat")
[2020-05-22 06:41:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 06:41:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 3
[2020-05-22 06:41:19] [INFO ] [Real]Absence check using 9 positive place invariants in 41 ms returned unsat
FORMULA DiscoveryGPU-PT-07b-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DiscoveryGPU-PT-07b-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DiscoveryGPU-PT-07b-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 21500 steps, including 110 resets, run finished after 85 ms. (steps per millisecond=252 ) properties seen :[1, 0] could not realise parikh vector
FORMULA DiscoveryGPU-PT-07b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 7 out of 212 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 212/212 places, 224/224 transitions.
Discarding 28 places :
Also discarding 14 output transitions
Drop transitions removed 14 transitions
Graph (complete) has 363 edges and 212 vertex of which 184 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.31 ms
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 184 transition count 159
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 96 place count 140 transition count 159
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 96 place count 140 transition count 145
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 124 place count 126 transition count 145
Symmetric choice reduction at 2 with 11 rule applications. Total rules 135 place count 126 transition count 145
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 11 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 157 place count 115 transition count 134
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 157 place count 115 transition count 133
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 159 place count 114 transition count 133
Discarding 7 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Graph (complete) has 218 edges and 114 vertex of which 107 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Iterating post reduction 2 with 1 rules applied. Total rules applied 160 place count 107 transition count 127
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 167 place count 107 transition count 120
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 167 place count 107 transition count 115
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 177 place count 102 transition count 115
Symmetric choice reduction at 4 with 4 rule applications. Total rules 181 place count 102 transition count 115
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 189 place count 98 transition count 111
Symmetric choice reduction at 4 with 3 rule applications. Total rules 192 place count 98 transition count 111
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 198 place count 95 transition count 108
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 4 with 66 rules applied. Total rules applied 264 place count 62 transition count 75
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 277 place count 62 transition count 62
Symmetric choice reduction at 5 with 3 rule applications. Total rules 280 place count 62 transition count 62
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 286 place count 59 transition count 59
Symmetric choice reduction at 5 with 3 rule applications. Total rules 289 place count 59 transition count 59
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 295 place count 56 transition count 56
Symmetric choice reduction at 5 with 3 rule applications. Total rules 298 place count 56 transition count 56
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 304 place count 53 transition count 53
Symmetric choice reduction at 5 with 3 rule applications. Total rules 307 place count 53 transition count 53
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 313 place count 50 transition count 50
Symmetric choice reduction at 5 with 3 rule applications. Total rules 316 place count 50 transition count 50
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 322 place count 47 transition count 47
Symmetric choice reduction at 5 with 3 rule applications. Total rules 325 place count 47 transition count 47
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 331 place count 44 transition count 44
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 332 place count 44 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 333 place count 43 transition count 43
Reduce places removed 1 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 5 with 12 rules applied. Total rules applied 345 place count 42 transition count 32
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 356 place count 31 transition count 32
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 7 Pre rules applied. Total rules applied 356 place count 31 transition count 25
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 370 place count 24 transition count 25
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 371 place count 24 transition count 25
Symmetric choice reduction at 7 with 1 rule applications. Total rules 372 place count 24 transition count 25
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 374 place count 23 transition count 24
Applied a total of 374 rules in 147 ms. Remains 23 /212 variables (removed 189) and now considering 24/224 (removed 200) transitions.
Finished structural reductions, in 1 iterations. Remains : 23/212 places, 24/224 transitions.
Finished random walk after 544500 steps, including 10079 resets, run visited all 1 properties in 450 ms. (steps per millisecond=1210 )
FORMULA DiscoveryGPU-PT-07b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1590129680920

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="DiscoveryGPU-PT-07b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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-4028"
echo " Executing tool itstools"
echo " Input is DiscoveryGPU-PT-07b, 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 r066-tajo-158922814600615"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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