Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r182-oct2-158987914000486.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 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 BusinessProcesses-PT-05, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987914000486
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 260K
-rw-r--r-- 1 mcc users 3.5K Mar 26 02:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 26 02:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 22:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 22:43 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:43 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:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 14:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 14:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 25 17:55 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 85K 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 BusinessProcesses-PT-05-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591157956477

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 04:19:18] [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-03 04:19:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 04:19:18] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2020-06-03 04:19:18] [INFO ] Transformed 368 places.
[2020-06-03 04:19:18] [INFO ] Transformed 319 transitions.
[2020-06-03 04:19:18] [INFO ] Found NUPN structural information;
[2020-06-03 04:19:18] [INFO ] Parsed PT model containing 368 places and 319 transitions in 161 ms.
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 1 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 64 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 95 resets, run finished after 40 ms. (steps per millisecond=250 ) properties seen :[0, 1, 0, 1, 0, 0, 1, 1]
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 38 ms. (steps per millisecond=263 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 318 rows 367 cols
[2020-06-03 04:19:19] [INFO ] Computed 57 place invariants in 11 ms
[2020-06-03 04:19:19] [INFO ] [Real]Absence check using 41 positive place invariants in 43 ms returned sat
[2020-06-03 04:19:19] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 10 ms returned sat
[2020-06-03 04:19:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:19:19] [INFO ] [Real]Absence check using state equation in 287 ms returned sat
[2020-06-03 04:19:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:19:19] [INFO ] [Nat]Absence check using 41 positive place invariants in 59 ms returned sat
[2020-06-03 04:19:19] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 6 ms returned sat
[2020-06-03 04:19:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:19:19] [INFO ] [Nat]Absence check using state equation in 298 ms returned sat
[2020-06-03 04:19:20] [INFO ] Deduced a trap composed of 14 places in 180 ms
[2020-06-03 04:19:20] [INFO ] Deduced a trap composed of 13 places in 170 ms
[2020-06-03 04:19:20] [INFO ] Deduced a trap composed of 19 places in 305 ms
[2020-06-03 04:19:20] [INFO ] Deduced a trap composed of 9 places in 155 ms
[2020-06-03 04:19:21] [INFO ] Deduced a trap composed of 8 places in 199 ms
[2020-06-03 04:19:21] [INFO ] Deduced a trap composed of 19 places in 196 ms
[2020-06-03 04:19:21] [INFO ] Deduced a trap composed of 19 places in 265 ms
[2020-06-03 04:19:21] [INFO ] Deduced a trap composed of 18 places in 190 ms
[2020-06-03 04:19:22] [INFO ] Deduced a trap composed of 21 places in 180 ms
[2020-06-03 04:19:22] [INFO ] Deduced a trap composed of 16 places in 104 ms
[2020-06-03 04:19:22] [INFO ] Deduced a trap composed of 88 places in 164 ms
[2020-06-03 04:19:22] [INFO ] Deduced a trap composed of 30 places in 155 ms
[2020-06-03 04:19:22] [INFO ] Deduced a trap composed of 25 places in 149 ms
[2020-06-03 04:19:22] [INFO ] Deduced a trap composed of 94 places in 126 ms
[2020-06-03 04:19:23] [INFO ] Deduced a trap composed of 91 places in 184 ms
[2020-06-03 04:19:23] [INFO ] Deduced a trap composed of 92 places in 140 ms
[2020-06-03 04:19:23] [INFO ] Deduced a trap composed of 22 places in 301 ms
[2020-06-03 04:19:23] [INFO ] Deduced a trap composed of 91 places in 210 ms
[2020-06-03 04:19:24] [INFO ] Deduced a trap composed of 89 places in 228 ms
[2020-06-03 04:19:24] [INFO ] Deduced a trap composed of 17 places in 134 ms
[2020-06-03 04:19:24] [INFO ] Deduced a trap composed of 94 places in 161 ms
[2020-06-03 04:19:24] [INFO ] Deduced a trap composed of 89 places in 84 ms
[2020-06-03 04:19:25] [INFO ] Deduced a trap composed of 89 places in 641 ms
[2020-06-03 04:19:25] [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: Stream closed (> (+ s0 s1 s2 s3 s4 s22 s23 s24 s30 s31 s37 s38 s47 s48 s51 s52 s73 s74 s75 s95 s96 s106 s107 s108 s121 s124 s125 s126 s163 s168 s173 s178 s183 s188 s198 s208 s213 s218 s223 s227 s228 s229 s237 s238 s239 s242 s243 s244 s248 s253 s267 s268 s269 s270 s271 s272 s273 s274 s275 s276 s277 s278 s287 s288 s291 s298 s299 s307 s308 s309 s310 s311 s312 s313 s314 s319 s320 s321 s336 s337 s340 s341 s354 s355 s356 s357 s358 s359 s366) 0)") while checking expression at index 0
[2020-06-03 04:19:25] [INFO ] [Real]Absence check using 41 positive place invariants in 25 ms returned unsat
[2020-06-03 04:19:25] [INFO ] [Real]Absence check using 41 positive place invariants in 20 ms returned sat
[2020-06-03 04:19:25] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 18 ms returned sat
[2020-06-03 04:19:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:19:25] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2020-06-03 04:19:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:19:25] [INFO ] [Nat]Absence check using 41 positive place invariants in 247 ms returned sat
[2020-06-03 04:19:25] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 5 ms returned sat
[2020-06-03 04:19:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:19:26] [INFO ] [Nat]Absence check using state equation in 360 ms returned sat
[2020-06-03 04:19:26] [INFO ] Deduced a trap composed of 10 places in 219 ms
[2020-06-03 04:19:26] [INFO ] Deduced a trap composed of 9 places in 93 ms
[2020-06-03 04:19:26] [INFO ] Deduced a trap composed of 25 places in 162 ms
[2020-06-03 04:19:27] [INFO ] Deduced a trap composed of 17 places in 231 ms
[2020-06-03 04:19:27] [INFO ] Deduced a trap composed of 84 places in 637 ms
[2020-06-03 04:19:27] [INFO ] Deduced a trap composed of 24 places in 74 ms
[2020-06-03 04:19:27] [INFO ] Deduced a trap composed of 18 places in 81 ms
[2020-06-03 04:19:28] [INFO ] Deduced a trap composed of 34 places in 170 ms
[2020-06-03 04:19:28] [INFO ] Deduced a trap composed of 30 places in 123 ms
[2020-06-03 04:19:28] [INFO ] Deduced a trap composed of 39 places in 111 ms
[2020-06-03 04:19:28] [INFO ] Deduced a trap composed of 13 places in 135 ms
[2020-06-03 04:19:28] [INFO ] Deduced a trap composed of 20 places in 64 ms
[2020-06-03 04:19:28] [INFO ] Deduced a trap composed of 30 places in 61 ms
[2020-06-03 04:19:28] [INFO ] Deduced a trap composed of 40 places in 64 ms
[2020-06-03 04:19:28] [INFO ] Deduced a trap composed of 33 places in 57 ms
[2020-06-03 04:19:28] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2537 ms
[2020-06-03 04:19:28] [INFO ] Computed and/alt/rep : 317/1114/317 causal constraints in 17 ms.
[2020-06-03 04:19:29] [INFO ] Added : 193 causal constraints over 39 iterations in 1092 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 15 ms.
[2020-06-03 04:19:30] [INFO ] [Real]Absence check using 41 positive place invariants in 24 ms returned sat
[2020-06-03 04:19:30] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 69 ms returned sat
[2020-06-03 04:19:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:19:30] [INFO ] [Real]Absence check using state equation in 527 ms returned sat
[2020-06-03 04:19:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:19:30] [INFO ] [Nat]Absence check using 41 positive place invariants in 31 ms returned sat
[2020-06-03 04:19:30] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 5 ms returned sat
[2020-06-03 04:19:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:19:31] [INFO ] [Nat]Absence check using state equation in 269 ms returned sat
[2020-06-03 04:19:31] [INFO ] Deduced a trap composed of 12 places in 131 ms
[2020-06-03 04:19:31] [INFO ] Deduced a trap composed of 16 places in 166 ms
[2020-06-03 04:19:31] [INFO ] Deduced a trap composed of 22 places in 49 ms
[2020-06-03 04:19:31] [INFO ] Deduced a trap composed of 10 places in 41 ms
[2020-06-03 04:19:31] [INFO ] Deduced a trap composed of 15 places in 64 ms
[2020-06-03 04:19:31] [INFO ] Deduced a trap composed of 11 places in 51 ms
[2020-06-03 04:19:31] [INFO ] Deduced a trap composed of 25 places in 60 ms
[2020-06-03 04:19:31] [INFO ] Deduced a trap composed of 18 places in 49 ms
[2020-06-03 04:19:31] [INFO ] Deduced a trap composed of 20 places in 45 ms
[2020-06-03 04:19:32] [INFO ] Deduced a trap composed of 20 places in 157 ms
[2020-06-03 04:19:32] [INFO ] Deduced a trap composed of 25 places in 41 ms
[2020-06-03 04:19:32] [INFO ] Deduced a trap composed of 23 places in 42 ms
[2020-06-03 04:19:32] [INFO ] Deduced a trap composed of 31 places in 78 ms
[2020-06-03 04:19:32] [INFO ] Deduced a trap composed of 23 places in 85 ms
[2020-06-03 04:19:32] [INFO ] Deduced a trap composed of 23 places in 37 ms
[2020-06-03 04:19:32] [INFO ] Deduced a trap composed of 27 places in 45 ms
[2020-06-03 04:19:32] [INFO ] Deduced a trap composed of 18 places in 46 ms
[2020-06-03 04:19:32] [INFO ] Deduced a trap composed of 26 places in 71 ms
[2020-06-03 04:19:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 18 trap constraints in 1485 ms
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 17800 steps, including 109 resets, run finished after 63 ms. (steps per millisecond=282 ) properties seen :[0, 1] could not realise parikh vector
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 367 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 367/367 places, 318/318 transitions.
Graph (trivial) has 232 edges and 367 vertex of which 8 / 367 are part of one of the 1 SCC in 29 ms
Free SCC test removed 7 places
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 700 edges and 360 vertex of which 357 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.8 ms
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Iterating post reduction 0 with 100 rules applied. Total rules applied 102 place count 357 transition count 217
Reduce places removed 89 places and 0 transitions.
Iterating post reduction 1 with 89 rules applied. Total rules applied 191 place count 268 transition count 217
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 191 place count 268 transition count 169
Deduced a syphon composed of 48 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 2 with 109 rules applied. Total rules applied 300 place count 207 transition count 169
Symmetric choice reduction at 2 with 58 rule applications. Total rules 358 place count 207 transition count 169
Deduced a syphon composed of 58 places in 13 ms
Reduce places removed 58 places and 58 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 474 place count 149 transition count 111
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 474 place count 149 transition count 105
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 489 place count 140 transition count 105
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 2 with 114 rules applied. Total rules applied 603 place count 83 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 604 place count 82 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 605 place count 81 transition count 47
Applied a total of 605 rules in 127 ms. Remains 81 /367 variables (removed 286) and now considering 47/318 (removed 271) transitions.
Finished structural reductions, in 1 iterations. Remains : 81/367 places, 47/318 transitions.
Finished random walk after 444 steps, including 16 resets, run visited all 1 properties in 3 ms. (steps per millisecond=148 )
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_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="BusinessProcesses-PT-05"
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 BusinessProcesses-PT-05, 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 r182-oct2-158987914000486"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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