fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r170-smll-158987815800414
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for FlexibleBarrier-PT-22b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15742.660 3600000.00 75270.00 441.90 FTFFFFFFTFFTTTTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r170-smll-158987815800414.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 itslola
Input is FlexibleBarrier-PT-22b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-smll-158987815800414
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 3.8K Apr 4 20:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 4 20:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 4 09:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 4 09:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 8 14:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 3 21:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 3 21:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 3 13:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 3 13:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 4 01:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 4 01:37 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 1.8M 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 FlexibleBarrier-PT-22b-ReachabilityCardinality-00
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityCardinality-01
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityCardinality-02
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityCardinality-03
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityCardinality-04
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityCardinality-05
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityCardinality-06
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityCardinality-07
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityCardinality-08
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityCardinality-09
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityCardinality-10
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityCardinality-11
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityCardinality-12
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityCardinality-13
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityCardinality-14
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591426112313

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-06 06:48:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-06 06:48:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-06 06:48:35] [INFO ] Load time of PNML (sax parser for PT used): 615 ms
[2020-06-06 06:48:35] [INFO ] Transformed 6478 places.
[2020-06-06 06:48:35] [INFO ] Transformed 7469 transitions.
[2020-06-06 06:48:35] [INFO ] Found NUPN structural information;
[2020-06-06 06:48:35] [INFO ] Parsed PT model containing 6478 places and 7469 transitions in 734 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 159 ms.
Working with output stream class java.io.PrintStream
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 68 resets, run finished after 188 ms. (steps per millisecond=53 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0]
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 1, 0, 0, 0, 0, 0, 0, 0]
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 7469 rows 6478 cols
[2020-06-06 06:48:36] [INFO ] Computed 24 place invariants in 507 ms
[2020-06-06 06:48:39] [INFO ] [Real]Absence check using 24 positive place invariants in 623 ms returned sat
[2020-06-06 06:48:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 06:48:42] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 06:48:42] [INFO ] [Real]Absence check using state equation in 2751 ms returned (error "Failed to check-sat")
[2020-06-06 06:48:44] [INFO ] [Real]Absence check using 24 positive place invariants in 767 ms returned sat
[2020-06-06 06:48:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 06:48:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 06:48:47] [INFO ] [Real]Absence check using state equation in 2584 ms returned (error "Failed to check-sat")
[2020-06-06 06:48:49] [INFO ] [Real]Absence check using 24 positive place invariants in 779 ms returned sat
[2020-06-06 06:48:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 06:48:52] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 06:48:52] [INFO ] [Real]Absence check using state equation in 2959 ms returned (error "Failed to check-sat")
[2020-06-06 06:48:54] [INFO ] [Real]Absence check using 24 positive place invariants in 572 ms returned sat
[2020-06-06 06:48:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 06:48:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (= s141 (- t6268 t7407))") while checking expression at index 3
[2020-06-06 06:48:59] [INFO ] [Real]Absence check using 24 positive place invariants in 792 ms returned sat
[2020-06-06 06:48:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 06:49:02] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 06:49:02] [INFO ] [Real]Absence check using state equation in 2492 ms returned (error "Failed to check-sat")
[2020-06-06 06:49:04] [INFO ] [Real]Absence check using 24 positive place invariants in 567 ms returned sat
[2020-06-06 06:49:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 06:49:07] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 06:49:07] [INFO ] [Real]Absence check using state equation in 3010 ms returned (error "Failed to check-sat")
[2020-06-06 06:49:09] [INFO ] [Real]Absence check using 24 positive place invariants in 760 ms returned sat
[2020-06-06 06:49:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 06:49:12] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 06:49:12] [INFO ] [Real]Absence check using state equation in 2663 ms returned (error "Failed to check-sat")
[2020-06-06 06:49:14] [INFO ] [Real]Absence check using 24 positive place invariants in 884 ms returned sat
[2020-06-06 06:49:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 06:49:17] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 06:49:17] [INFO ] [Real]Absence check using state equation in 2491 ms returned (error "Failed to check-sat")
[2020-06-06 06:49:19] [INFO ] [Real]Absence check using 24 positive place invariants in 776 ms returned sat
[2020-06-06 06:49:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 06:49:22] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 06:49:22] [INFO ] [Real]Absence check using state equation in 2646 ms returned (error "Failed to check-sat")
Support contains 33 out of 6478 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 6478/6478 places, 7469/7469 transitions.
Graph (trivial) has 6362 edges and 6478 vertex of which 134 / 6478 are part of one of the 22 SCC in 50 ms
Free SCC test removed 112 places
Drop transitions removed 135 transitions
Reduce isomorphic transitions removed 135 transitions.
Performed 1556 Post agglomeration using F-continuation condition.Transition count delta: 1556
Iterating post reduction 0 with 1691 rules applied. Total rules applied 1692 place count 6366 transition count 5778
Reduce places removed 1556 places and 0 transitions.
Iterating post reduction 1 with 1556 rules applied. Total rules applied 3248 place count 4810 transition count 5778
Performed 452 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 452 Pre rules applied. Total rules applied 3248 place count 4810 transition count 5326
Deduced a syphon composed of 452 places in 7 ms
Reduce places removed 452 places and 0 transitions.
Iterating global reduction 2 with 904 rules applied. Total rules applied 4152 place count 4358 transition count 5326
Symmetric choice reduction at 2 with 2674 rule applications. Total rules 6826 place count 4358 transition count 5326
Deduced a syphon composed of 2674 places in 15 ms
Reduce places removed 2674 places and 2674 transitions.
Iterating global reduction 2 with 5348 rules applied. Total rules applied 12174 place count 1684 transition count 2652
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 12174 place count 1684 transition count 2634
Deduced a syphon composed of 18 places in 7 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 12210 place count 1666 transition count 2634
Symmetric choice reduction at 2 with 431 rule applications. Total rules 12641 place count 1666 transition count 2634
Deduced a syphon composed of 431 places in 8 ms
Reduce places removed 431 places and 431 transitions.
Iterating global reduction 2 with 862 rules applied. Total rules applied 13503 place count 1235 transition count 2203
Ensure Unique test removed 422 transitions
Reduce isomorphic transitions removed 422 transitions.
Iterating post reduction 2 with 422 rules applied. Total rules applied 13925 place count 1235 transition count 1781
Performed 115 Post agglomeration using F-continuation condition.Transition count delta: 115
Deduced a syphon composed of 115 places in 1 ms
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 230 rules applied. Total rules applied 14155 place count 1120 transition count 1666
Drop transitions removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 3 with 41 rules applied. Total rules applied 14196 place count 1120 transition count 1625
Symmetric choice reduction at 4 with 20 rule applications. Total rules 14216 place count 1120 transition count 1625
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 20 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 14256 place count 1100 transition count 1605
Free-agglomeration rule applied 937 times.
Iterating global reduction 4 with 937 rules applied. Total rules applied 15193 place count 1100 transition count 668
Reduce places removed 937 places and 0 transitions.
Drop transitions removed 432 transitions
Reduce isomorphic transitions removed 432 transitions.
Discarding 5 places :
Also discarding 0 output transitions
Graph (complete) has 451 edges and 163 vertex of which 158 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.6 ms
Iterating post reduction 4 with 1370 rules applied. Total rules applied 16563 place count 158 transition count 236
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 16570 place count 158 transition count 229
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 16571 place count 158 transition count 229
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 16572 place count 158 transition count 228
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 16573 place count 158 transition count 228
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 16574 place count 157 transition count 227
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 108 edges and 156 vertex of which 40 / 156 are part of one of the 20 SCC in 0 ms
Free SCC test removed 20 places
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 7 with 5 rules applied. Total rules applied 16579 place count 136 transition count 224
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 8 with 43 rules applied. Total rules applied 16622 place count 133 transition count 184
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 21 Pre rules applied. Total rules applied 16622 place count 133 transition count 163
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 9 with 42 rules applied. Total rules applied 16664 place count 112 transition count 163
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 9 with 21 rules applied. Total rules applied 16685 place count 112 transition count 142
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 10 with 42 rules applied. Total rules applied 16727 place count 91 transition count 121
Free-agglomeration rule applied 23 times.
Iterating global reduction 10 with 23 rules applied. Total rules applied 16750 place count 91 transition count 98
Reduce places removed 29 places and 0 transitions.
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 10 with 50 rules applied. Total rules applied 16800 place count 62 transition count 77
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 16801 place count 62 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 16802 place count 61 transition count 76
Applied a total of 16802 rules in 2975 ms. Remains 61 /6478 variables (removed 6417) and now considering 76/7469 (removed 7393) transitions.
Finished structural reductions, in 1 iterations. Remains : 61/6478 places, 76/7469 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2173 ms. (steps per millisecond=460 ) properties seen :[0, 1, 0, 1, 0, 1, 1, 1, 1]
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 10572 steps, including 0 resets, run visited all 3 properties in 12 ms. (steps per millisecond=881 )
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-00 FALSE 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="FlexibleBarrier-PT-22b"
export BK_EXAMINATION="ReachabilityCardinality"
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 FlexibleBarrier-PT-22b, 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 r170-smll-158987815800414"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-22b.tgz
mv FlexibleBarrier-PT-22b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;