fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r182-oct2-158987914100591
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for BusinessProcesses-PT-18

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15740.930 3600000.00 83273.00 142.20 FTFTFTFTTTTTTFTF normal

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-158987914100591.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-18, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987914100591
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 352K
-rw-r--r-- 1 mcc users 3.0K Mar 26 02:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 26 02:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 22:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 22:46 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.3K Apr 8 14:44 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:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 25 17:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 25 17:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 14:38 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 177K 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-18-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591166561554

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 06:42:43] [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 06:42:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 06:42:44] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2020-06-03 06:42:44] [INFO ] Transformed 717 places.
[2020-06-03 06:42:44] [INFO ] Transformed 642 transitions.
[2020-06-03 06:42:44] [INFO ] Found NUPN structural information;
[2020-06-03 06:42:44] [INFO ] Parsed PT model containing 717 places and 642 transitions in 277 ms.
Deduced a syphon composed of 15 places in 29 ms
Reduce places removed 15 places and 15 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 95 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 54 resets, run finished after 86 ms. (steps per millisecond=116 ) properties seen :[1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0]
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 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 6 resets, run finished after 37 ms. (steps per millisecond=270 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 39 ms. (steps per millisecond=256 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 627 rows 702 cols
[2020-06-03 06:42:44] [INFO ] Computed 114 place invariants in 44 ms
[2020-06-03 06:42:45] [INFO ] [Real]Absence check using 73 positive place invariants in 201 ms returned sat
[2020-06-03 06:42:45] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 64 ms returned sat
[2020-06-03 06:42:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:42:47] [INFO ] [Real]Absence check using state equation in 1695 ms returned sat
[2020-06-03 06:42:48] [INFO ] Deduced a trap composed of 33 places in 696 ms
[2020-06-03 06:42:49] [INFO ] Deduced a trap composed of 17 places in 921 ms
[2020-06-03 06:42:50] [INFO ] Deduced a trap composed of 20 places in 1147 ms
[2020-06-03 06:42:50] [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 s5 s6 s7 s8 s9 s35 s36 s37 s38 s39 s252 s324 s326 s523 s524) 0)") while checking expression at index 0
[2020-06-03 06:42:50] [INFO ] [Real]Absence check using 73 positive place invariants in 100 ms returned sat
[2020-06-03 06:42:50] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 35 ms returned unsat
[2020-06-03 06:42:51] [INFO ] [Real]Absence check using 73 positive place invariants in 382 ms returned sat
[2020-06-03 06:42:51] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 101 ms returned unsat
[2020-06-03 06:42:51] [INFO ] [Real]Absence check using 73 positive place invariants in 259 ms returned sat
[2020-06-03 06:42:51] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 31 ms returned sat
[2020-06-03 06:42:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:42:54] [INFO ] [Real]Absence check using state equation in 3069 ms returned sat
[2020-06-03 06:42:59] [INFO ] Deduced a trap composed of 11 places in 4599 ms
[2020-06-03 06:42:59] [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 s42 s43 s44 s278 s281 s335 s527 s528) 0)") while checking expression at index 3
[2020-06-03 06:42:59] [INFO ] [Real]Absence check using 73 positive place invariants in 113 ms returned sat
[2020-06-03 06:42:59] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 44 ms returned sat
[2020-06-03 06:42:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:43:00] [INFO ] [Real]Absence check using state equation in 1070 ms returned sat
[2020-06-03 06:43:01] [INFO ] Deduced a trap composed of 14 places in 284 ms
[2020-06-03 06:43:02] [INFO ] Deduced a trap composed of 22 places in 1221 ms
[2020-06-03 06:43:02] [INFO ] Deduced a trap composed of 24 places in 514 ms
[2020-06-03 06:43:03] [INFO ] Deduced a trap composed of 8 places in 499 ms
[2020-06-03 06:43:03] [INFO ] Deduced a trap composed of 34 places in 436 ms
[2020-06-03 06:43:04] [INFO ] Deduced a trap composed of 30 places in 471 ms
[2020-06-03 06:43:04] [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 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s186 s189 s190 s191 s416 s417 s418 s422 s598 s599) 0)") while checking expression at index 4
[2020-06-03 06:43:04] [INFO ] [Real]Absence check using 73 positive place invariants in 115 ms returned sat
[2020-06-03 06:43:04] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 43 ms returned sat
[2020-06-03 06:43:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:43:06] [INFO ] [Real]Absence check using state equation in 1595 ms returned sat
[2020-06-03 06:43:07] [INFO ] Deduced a trap composed of 18 places in 1492 ms
[2020-06-03 06:43:08] [INFO ] Deduced a trap composed of 8 places in 714 ms
[2020-06-03 06:43:09] [INFO ] Deduced a trap composed of 122 places in 707 ms
[2020-06-03 06:43:13] [INFO ] Deduced a trap composed of 122 places in 4227 ms
[2020-06-03 06:43:13] [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 s40 s41 s53 s54 s71 s72 s73 s77 s78 s79 s111 s112 s113 s117 s118 s119 s177 s178 s179 s197 s198 s200 s201 s204 s242 s243 s244 s246 s247 s250 s251 s324 s326 s334 s335 s336 s343 s344 s345 s348 s361 s362 s363 s372 s377 s382 s387 s402 s411 s412 s413 s416 s418 s426 s428 s432 s441 s442 s443 s457 s461 s462 s463 s466 s468 s476 s477 s478 s482 s492 s505 s506 s507 s508 s509 s510 s513 s514 s515 s516 s517 s518 s519 s520 s521 s522 s531 s532 s541 s542 s543 s544 s557 s558 s559 s560 s563 s564 s596 s597 s608 s609 s610 s611 s612 s619 s620 s621 s626 s627 s628 s629 s632 s633 s663 s664 s665 s666 s669 s670 s673) 0)") while checking expression at index 5
[2020-06-03 06:43:14] [INFO ] [Real]Absence check using 73 positive place invariants in 282 ms returned sat
[2020-06-03 06:43:14] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 152 ms returned sat
[2020-06-03 06:43:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:43:18] [INFO ] [Real]Absence check using state equation in 3682 ms returned unsat
[2020-06-03 06:43:18] [INFO ] [Real]Absence check using 73 positive place invariants in 104 ms returned unsat
[2020-06-03 06:43:18] [INFO ] [Real]Absence check using 73 positive place invariants in 140 ms returned sat
[2020-06-03 06:43:18] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 22 ms returned sat
[2020-06-03 06:43:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:43:19] [INFO ] [Real]Absence check using state equation in 1005 ms returned sat
[2020-06-03 06:43:20] [INFO ] Deduced a trap composed of 14 places in 715 ms
[2020-06-03 06:43:20] [INFO ] Deduced a trap composed of 28 places in 254 ms
[2020-06-03 06:43:20] [INFO ] Deduced a trap composed of 11 places in 190 ms
[2020-06-03 06:43:23] [INFO ] Deduced a trap composed of 14 places in 2669 ms
[2020-06-03 06:43:23] [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 s5 s6 s7 s265 s491 s492 s493 s669 s670) 0)") while checking expression at index 8
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 22 out of 702 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 702/702 places, 627/627 transitions.
Graph (trivial) has 388 edges and 702 vertex of which 8 / 702 are part of one of the 1 SCC in 32 ms
Free SCC test removed 7 places
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 1408 edges and 695 vertex of which 686 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.8 ms
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Performed 156 Post agglomeration using F-continuation condition.Transition count delta: 156
Iterating post reduction 0 with 166 rules applied. Total rules applied 168 place count 686 transition count 460
Reduce places removed 156 places and 0 transitions.
Iterating post reduction 1 with 156 rules applied. Total rules applied 324 place count 530 transition count 460
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 324 place count 530 transition count 363
Deduced a syphon composed of 97 places in 2 ms
Ensure Unique test removed 19 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 213 rules applied. Total rules applied 537 place count 414 transition count 363
Symmetric choice reduction at 2 with 88 rule applications. Total rules 625 place count 414 transition count 363
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 88 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 801 place count 326 transition count 275
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 801 place count 326 transition count 268
Deduced a syphon composed of 7 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 817 place count 317 transition count 268
Symmetric choice reduction at 2 with 1 rule applications. Total rules 818 place count 317 transition count 268
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 820 place count 316 transition count 267
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 0 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 1024 place count 214 transition count 165
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 1026 place count 213 transition count 168
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1027 place count 213 transition count 167
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1028 place count 212 transition count 167
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 1032 place count 212 transition count 167
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1033 place count 211 transition count 166
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1034 place count 210 transition count 166
Applied a total of 1034 rules in 303 ms. Remains 210 /702 variables (removed 492) and now considering 166/627 (removed 461) transitions.
Finished structural reductions, in 1 iterations. Remains : 210/702 places, 166/627 transitions.
Incomplete random walk after 1000000 steps, including 34391 resets, run finished after 2767 ms. (steps per millisecond=361 ) properties seen :[1, 1, 1, 0, 1]
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 14610 resets, run finished after 1182 ms. (steps per millisecond=846 ) properties seen :[0]
// Phase 1: matrix 166 rows 210 cols
[2020-06-03 06:43:27] [INFO ] Computed 84 place invariants in 2 ms
[2020-06-03 06:43:28] [INFO ] [Real]Absence check using 64 positive place invariants in 39 ms returned sat
[2020-06-03 06:43:28] [INFO ] [Real]Absence check using 64 positive and 20 generalized place invariants in 14 ms returned sat
[2020-06-03 06:43:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:43:28] [INFO ] [Real]Absence check using state equation in 880 ms returned sat
[2020-06-03 06:43:28] [INFO ] State equation strengthened by 4 read => feed constraints.
[2020-06-03 06:43:28] [INFO ] [Real]Added 4 Read/Feed constraints in 3 ms returned sat
[2020-06-03 06:43:30] [INFO ] Deduced a trap composed of 3 places in 1273 ms
[2020-06-03 06:43:30] [INFO ] Deduced a trap composed of 5 places in 122 ms
[2020-06-03 06:43:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 1420 ms
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
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-18"
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 BusinessProcesses-PT-18, 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 r182-oct2-158987914100591"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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