fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r174-csrt-158987853100375
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for NoC3x3-PT-3B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15742.010 3600000.00 77071.00 91.30 TTTTTTTTTTTTTTTT normal

Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r174-csrt-158987853100375.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is NoC3x3-PT-3B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987853100375
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 3.9K Apr 8 15:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 8 15:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 7 18:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 7 18:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Apr 14 12:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 6 20:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 6 20:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 6 03:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Apr 6 03:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 6 20:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 6 20:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 581K 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 NoC3x3-PT-3B-ReachabilityFireability-00
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-01
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-02
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-03
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-04
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-05
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-06
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-07
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-08
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-09
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-10
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-11
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-12
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-13
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-14
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591142828235

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 00:07: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, -timeout, 3600, -rebuildPNML]
[2020-06-03 00:07:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 00:07:11] [INFO ] Load time of PNML (sax parser for PT used): 263 ms
[2020-06-03 00:07:11] [INFO ] Transformed 2117 places.
[2020-06-03 00:07:11] [INFO ] Transformed 2435 transitions.
[2020-06-03 00:07:11] [INFO ] Found NUPN structural information;
[2020-06-03 00:07:11] [INFO ] Parsed PT model containing 2117 places and 2435 transitions in 360 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 116 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 17 resets, run finished after 152 ms. (steps per millisecond=65 ) properties seen :[1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0]
FORMULA NoC3x3-PT-3B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 1 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 2435 rows 2117 cols
[2020-06-03 00:07:11] [INFO ] Computed 66 place invariants in 92 ms
[2020-06-03 00:07:13] [INFO ] [Real]Absence check using 66 positive place invariants in 300 ms returned sat
[2020-06-03 00:07:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:07:16] [INFO ] [Real]Absence check using state equation in 3794 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 00:07:18] [INFO ] [Real]Absence check using 66 positive place invariants in 195 ms returned sat
[2020-06-03 00:07:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:07:21] [INFO ] [Real]Absence check using state equation in 3908 ms returned (error "Failed to check-sat")
[2020-06-03 00:07:22] [INFO ] [Real]Absence check using 66 positive place invariants in 166 ms returned sat
[2020-06-03 00:07:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:07:26] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 00:07:26] [INFO ] [Real]Absence check using state equation in 4317 ms returned (error "Failed to check-sat")
[2020-06-03 00:07:27] [INFO ] [Real]Absence check using 66 positive place invariants in 294 ms returned sat
[2020-06-03 00:07:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:07:31] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 00:07:31] [INFO ] [Real]Absence check using state equation in 4372 ms returned (error "Failed to check-sat")
[2020-06-03 00:07:33] [INFO ] [Real]Absence check using 66 positive place invariants in 345 ms returned sat
[2020-06-03 00:07:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:07:37] [INFO ] [Real]Absence check using state equation in 3805 ms returned (error "Failed to check-sat")
[2020-06-03 00:07:38] [INFO ] [Real]Absence check using 66 positive place invariants in 471 ms returned sat
[2020-06-03 00:07:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:07:42] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 00:07:42] [INFO ] [Real]Absence check using state equation in 3983 ms returned (error "Failed to check-sat")
[2020-06-03 00:07:43] [INFO ] [Real]Absence check using 66 positive place invariants in 434 ms returned sat
[2020-06-03 00:07:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:07:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 00:07:47] [INFO ] [Real]Absence check using state equation in 3712 ms returned (error "Failed to check-sat")
[2020-06-03 00:07:48] [INFO ] [Real]Absence check using 66 positive place invariants in 227 ms returned sat
[2020-06-03 00:07:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:07:52] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 00:07:52] [INFO ] [Real]Absence check using state equation in 3967 ms returned (error "Failed to check-sat")
Support contains 39 out of 2117 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2117/2117 places, 2435/2435 transitions.
Graph (trivial) has 1670 edges and 2117 vertex of which 72 / 2117 are part of one of the 9 SCC in 60 ms
Free SCC test removed 63 places
Drop transitions removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Performed 433 Post agglomeration using F-continuation condition.Transition count delta: 433
Iterating post reduction 0 with 510 rules applied. Total rules applied 511 place count 2049 transition count 1930
Reduce places removed 433 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 439 rules applied. Total rules applied 950 place count 1616 transition count 1924
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 953 place count 1613 transition count 1924
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 953 place count 1613 transition count 1901
Deduced a syphon composed of 23 places in 4 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 999 place count 1590 transition count 1901
Symmetric choice reduction at 3 with 360 rule applications. Total rules 1359 place count 1590 transition count 1901
Deduced a syphon composed of 360 places in 14 ms
Reduce places removed 360 places and 360 transitions.
Iterating global reduction 3 with 720 rules applied. Total rules applied 2079 place count 1230 transition count 1541
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 2079 place count 1230 transition count 1502
Deduced a syphon composed of 39 places in 25 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 2157 place count 1191 transition count 1502
Symmetric choice reduction at 3 with 112 rule applications. Total rules 2269 place count 1191 transition count 1502
Deduced a syphon composed of 112 places in 25 ms
Reduce places removed 112 places and 112 transitions.
Iterating global reduction 3 with 224 rules applied. Total rules applied 2493 place count 1079 transition count 1390
Symmetric choice reduction at 3 with 128 rule applications. Total rules 2621 place count 1079 transition count 1390
Deduced a syphon composed of 128 places in 16 ms
Reduce places removed 128 places and 141 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 2877 place count 951 transition count 1249
Symmetric choice reduction at 3 with 48 rule applications. Total rules 2925 place count 951 transition count 1249
Deduced a syphon composed of 48 places in 3 ms
Reduce places removed 48 places and 91 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 3021 place count 903 transition count 1158
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 17 rules applied. Total rules applied 3038 place count 901 transition count 1143
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 3040 place count 899 transition count 1143
Symmetric choice reduction at 5 with 33 rule applications. Total rules 3073 place count 899 transition count 1143
Deduced a syphon composed of 33 places in 3 ms
Reduce places removed 33 places and 33 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 3139 place count 866 transition count 1110
Discarding 3 places :
Implicit places reduction removed 3 places
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 5 with 6 rules applied. Total rules applied 3145 place count 863 transition count 1107
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 3148 place count 860 transition count 1107
Symmetric choice reduction at 7 with 22 rule applications. Total rules 3170 place count 860 transition count 1107
Deduced a syphon composed of 22 places in 17 ms
Reduce places removed 22 places and 44 transitions.
Iterating global reduction 7 with 44 rules applied. Total rules applied 3214 place count 838 transition count 1063
Symmetric choice reduction at 7 with 22 rule applications. Total rules 3236 place count 838 transition count 1063
Deduced a syphon composed of 22 places in 6 ms
Reduce places removed 22 places and 22 transitions.
Iterating global reduction 7 with 44 rules applied. Total rules applied 3280 place count 816 transition count 1041
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 7 with 30 rules applied. Total rules applied 3310 place count 812 transition count 1015
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 3314 place count 808 transition count 1015
Performed 286 Post agglomeration using F-continuation condition.Transition count delta: 286
Deduced a syphon composed of 286 places in 0 ms
Reduce places removed 286 places and 0 transitions.
Iterating global reduction 9 with 572 rules applied. Total rules applied 3886 place count 522 transition count 729
Symmetric choice reduction at 9 with 15 rule applications. Total rules 3901 place count 522 transition count 729
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 15 transitions.
Iterating global reduction 9 with 30 rules applied. Total rules applied 3931 place count 507 transition count 714
Symmetric choice reduction at 9 with 9 rule applications. Total rules 3940 place count 507 transition count 714
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 18 transitions.
Iterating global reduction 9 with 18 rules applied. Total rules applied 3958 place count 498 transition count 696
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 3960 place count 498 transition count 694
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -127
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 10 with 54 rules applied. Total rules applied 4014 place count 471 transition count 821
Free-agglomeration rule applied 25 times.
Iterating global reduction 10 with 25 rules applied. Total rules applied 4039 place count 471 transition count 796
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 30 rules applied. Total rules applied 4069 place count 446 transition count 791
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 11 with 4 rules applied. Total rules applied 4073 place count 446 transition count 787
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 4077 place count 442 transition count 787
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 12 with 5 rules applied. Total rules applied 4082 place count 442 transition count 787
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 12 with 4 rules applied. Total rules applied 4086 place count 442 transition count 787
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 4087 place count 442 transition count 786
Applied a total of 4087 rules in 1632 ms. Remains 442 /2117 variables (removed 1675) and now considering 786/2435 (removed 1649) transitions.
Finished structural reductions, in 1 iterations. Remains : 442/2117 places, 786/2435 transitions.
Incomplete random walk after 1000000 steps, including 12290 resets, run finished after 4035 ms. (steps per millisecond=247 ) properties seen :[1, 1, 1, 0, 1, 0, 1, 1]
FORMULA NoC3x3-PT-3B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 704 resets, run finished after 1419 ms. (steps per millisecond=704 ) properties seen :[1, 0]
FORMULA NoC3x3-PT-3B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Finished Best-First random walk after 114802 steps, including 96 resets, run visited all 1 properties in 146 ms. (steps per millisecond=786 )
FORMULA NoC3x3-PT-3B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.

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

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="NoC3x3-PT-3B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itslola"
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 itslola"
echo " Input is NoC3x3-PT-3B, 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 r174-csrt-158987853100375"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-3B.tgz
mv NoC3x3-PT-3B 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 ;