Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 3.4K Mar 30 21:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 30 21:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 29 11:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 29 11:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 8 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 28 07:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 28 07:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 27 01:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 27 01:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 28 14:49 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 2.1M 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 DLCround-PT-13b-ReachabilityFireability-00
FORMULA_NAME DLCround-PT-13b-ReachabilityFireability-01
FORMULA_NAME DLCround-PT-13b-ReachabilityFireability-02
FORMULA_NAME DLCround-PT-13b-ReachabilityFireability-03
FORMULA_NAME DLCround-PT-13b-ReachabilityFireability-04
FORMULA_NAME DLCround-PT-13b-ReachabilityFireability-05
FORMULA_NAME DLCround-PT-13b-ReachabilityFireability-06
FORMULA_NAME DLCround-PT-13b-ReachabilityFireability-07
FORMULA_NAME DLCround-PT-13b-ReachabilityFireability-08
FORMULA_NAME DLCround-PT-13b-ReachabilityFireability-09
FORMULA_NAME DLCround-PT-13b-ReachabilityFireability-10
FORMULA_NAME DLCround-PT-13b-ReachabilityFireability-11
FORMULA_NAME DLCround-PT-13b-ReachabilityFireability-12
FORMULA_NAME DLCround-PT-13b-ReachabilityFireability-13
FORMULA_NAME DLCround-PT-13b-ReachabilityFireability-14
FORMULA_NAME DLCround-PT-13b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591263453488

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 09:37:36] [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-04 09:37:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 09:37:37] [INFO ] Load time of PNML (sax parser for PT used): 615 ms
[2020-06-04 09:37:37] [INFO ] Transformed 5343 places.
[2020-06-04 09:37:37] [INFO ] Transformed 8727 transitions.
[2020-06-04 09:37:37] [INFO ] Found NUPN structural information;
[2020-06-04 09:37:37] [INFO ] Parsed PT model containing 5343 places and 8727 transitions in 980 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 658 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 261 ms. (steps per millisecond=38 ) properties seen :[0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1]
FORMULA DLCround-PT-13b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 55 ms. (steps per millisecond=181 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 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 0 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 67 ms. (steps per millisecond=149 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 48 ms. (steps per millisecond=208 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 36 ms. (steps per millisecond=277 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 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 0 resets, run finished after 61 ms. (steps per millisecond=163 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 68 ms. (steps per millisecond=147 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 8727 rows 5343 cols
[2020-06-04 09:37:39] [INFO ] Computed 312 place invariants in 239 ms
[2020-06-04 09:37:43] [INFO ] [Real]Absence check using 312 positive place invariants in 2307 ms returned sat
[2020-06-04 09:37:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 09:37:44] [INFO ] [Real]Absence check using state equation in 1508 ms returned (error "Solver has unexpectedly terminated")
[2020-06-04 09:37:47] [INFO ] [Real]Absence check using 312 positive place invariants in 2177 ms returned sat
[2020-06-04 09:37:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 09:37:49] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 09:37:49] [INFO ] [Real]Absence check using state equation in 1890 ms returned (error "Failed to check-sat")
[2020-06-04 09:37:53] [INFO ] [Real]Absence check using 312 positive place invariants in 2316 ms returned sat
[2020-06-04 09:37:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 09:37:54] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 09:37:54] [INFO ] [Real]Absence check using state equation in 1619 ms returned (error "Failed to check-sat")
[2020-06-04 09:37:58] [INFO ] [Real]Absence check using 312 positive place invariants in 2417 ms returned sat
[2020-06-04 09:37:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 09:37:59] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 09:37:59] [INFO ] [Real]Absence check using state equation in 1666 ms returned (error "Failed to check-sat")
[2020-06-04 09:38:03] [INFO ] [Real]Absence check using 312 positive place invariants in 2457 ms returned sat
[2020-06-04 09:38:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 09:38:04] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 09:38:04] [INFO ] [Real]Absence check using state equation in 1530 ms returned (error "Failed to check-sat")
[2020-06-04 09:38:08] [INFO ] [Real]Absence check using 312 positive place invariants in 2253 ms returned sat
[2020-06-04 09:38:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 09:38:09] [INFO ] [Real]Absence check using state equation in 1750 ms returned (error "Failed to check-sat")
[2020-06-04 09:38:12] [INFO ] [Real]Absence check using 312 positive place invariants in 2303 ms returned sat
[2020-06-04 09:38:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 09:38:14] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 09:38:14] [INFO ] [Real]Absence check using state equation in 1836 ms returned (error "Failed to check-sat")
[2020-06-04 09:38:18] [INFO ] [Real]Absence check using 312 positive place invariants in 2270 ms returned sat
[2020-06-04 09:38:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 09:38:19] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 09:38:19] [INFO ] [Real]Absence check using state equation in 1688 ms returned (error "Failed to check-sat")
[2020-06-04 09:38:23] [INFO ] [Real]Absence check using 312 positive place invariants in 2307 ms returned sat
[2020-06-04 09:38:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 09:38:24] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 09:38:24] [INFO ] [Real]Absence check using state equation in 1725 ms returned (error "Failed to check-sat")
Support contains 57 out of 5343 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5343/5343 places, 8727/8727 transitions.
Graph (trivial) has 4785 edges and 5343 vertex of which 789 / 5343 are part of one of the 61 SCC in 88 ms
Free SCC test removed 728 places
Drop transitions removed 816 transitions
Reduce isomorphic transitions removed 816 transitions.
Performed 1900 Post agglomeration using F-continuation condition.Transition count delta: 1900
Iterating post reduction 0 with 2716 rules applied. Total rules applied 2717 place count 4615 transition count 6011
Reduce places removed 1900 places and 0 transitions.
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Iterating post reduction 1 with 1991 rules applied. Total rules applied 4708 place count 2715 transition count 5920
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 48 rules applied. Total rules applied 4756 place count 2675 transition count 5912
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 4760 place count 2671 transition count 5912
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 20 Pre rules applied. Total rules applied 4760 place count 2671 transition count 5892
Deduced a syphon composed of 20 places in 141 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 4800 place count 2651 transition count 5892
Symmetric choice reduction at 4 with 739 rule applications. Total rules 5539 place count 2651 transition count 5892
Deduced a syphon composed of 739 places in 144 ms
Reduce places removed 739 places and 739 transitions.
Iterating global reduction 4 with 1478 rules applied. Total rules applied 7017 place count 1912 transition count 5153
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 7019 place count 1912 transition count 5151
Performed 327 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 327 Pre rules applied. Total rules applied 7019 place count 1912 transition count 4824
Deduced a syphon composed of 327 places in 197 ms
Reduce places removed 327 places and 0 transitions.
Iterating global reduction 5 with 654 rules applied. Total rules applied 7673 place count 1585 transition count 4824
Symmetric choice reduction at 5 with 84 rule applications. Total rules 7757 place count 1585 transition count 4824
Deduced a syphon composed of 84 places in 120 ms
Reduce places removed 84 places and 1397 transitions.
Iterating global reduction 5 with 168 rules applied. Total rules applied 7925 place count 1501 transition count 3427
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 5 with 23 rules applied. Total rules applied 7948 place count 1501 transition count 3404
Performed 392 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 392 places in 5 ms
Reduce places removed 392 places and 0 transitions.
Iterating global reduction 6 with 784 rules applied. Total rules applied 8732 place count 1109 transition count 2998
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 8742 place count 1109 transition count 2988
Renaming transitions due to excessive name length > 1024 char.
Symmetric choice reduction at 7 with 1 rule applications. Total rules 8743 place count 1109 transition count 2988
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 17 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 8745 place count 1108 transition count 2971
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -172
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 7 with 36 rules applied. Total rules applied 8781 place count 1090 transition count 3143
Drop transitions removed 17 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 8801 place count 1090 transition count 3123
Free-agglomeration rule applied 596 times with reduction of 242 identical transitions.
Iterating global reduction 8 with 596 rules applied. Total rules applied 9397 place count 1090 transition count 2285
Reduce places removed 596 places and 0 transitions.
Drop transitions removed 657 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 677 transitions.
Discarding 12 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Graph (complete) has 1932 edges and 494 vertex of which 482 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.11 ms
Iterating post reduction 8 with 1274 rules applied. Total rules applied 10671 place count 482 transition count 1584
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 9 with 36 rules applied. Total rules applied 10707 place count 482 transition count 1548
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 10709 place count 481 transition count 1547
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 10711 place count 481 transition count 1545
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 10 with 34 rules applied. Total rules applied 10745 place count 479 transition count 1513
Free-agglomeration rule (complex) applied 29 times.
Iterating global reduction 11 with 29 rules applied. Total rules applied 10774 place count 479 transition count 1961
Reduce places removed 29 places and 0 transitions.
Drop transitions removed 468 transitions
Reduce isomorphic transitions removed 468 transitions.
Iterating post reduction 11 with 497 rules applied. Total rules applied 11271 place count 450 transition count 1493
Symmetric choice reduction at 12 with 2 rule applications. Total rules 11273 place count 450 transition count 1493
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 11277 place count 448 transition count 1491
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 12 with 34 rules applied. Total rules applied 11311 place count 448 transition count 1457
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 11315 place count 446 transition count 1455
Drop transitions removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Discarding 6 places :
Also discarding 0 output transitions
Graph (complete) has 1691 edges and 446 vertex of which 440 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Iterating post reduction 13 with 35 rules applied. Total rules applied 11350 place count 440 transition count 1421
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 14 with 4 rules applied. Total rules applied 11354 place count 440 transition count 1421
Drop transitions removed 72 transitions
Redundant transition composition rules discarded 72 transitions
Iterating global reduction 14 with 72 rules applied. Total rules applied 11426 place count 440 transition count 1349
Symmetric choice reduction at 14 with 1 rule applications. Total rules 11427 place count 440 transition count 1349
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 11429 place count 439 transition count 1348
Symmetric choice reduction at 14 with 1 rule applications. Total rules 11430 place count 439 transition count 1348
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 17 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 11432 place count 438 transition count 1331
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 11434 place count 437 transition count 1344
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 14 with 1 rules applied. Total rules applied 11435 place count 437 transition count 1377
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 14 with 18 rules applied. Total rules applied 11453 place count 436 transition count 1360
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 15 with 17 rules applied. Total rules applied 11470 place count 436 transition count 1343
Applied a total of 11470 rules in 5064 ms. Remains 436 /5343 variables (removed 4907) and now considering 1343/8727 (removed 7384) transitions.
Finished structural reductions, in 1 iterations. Remains : 436/5343 places, 1343/8727 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 15335 ms. (steps per millisecond=65 ) properties seen :[1, 1, 1, 1, 0, 0, 1, 1, 1]
FORMULA DLCround-PT-13b-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 680154 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=136 ) properties seen :[1, 0]
FORMULA DLCround-PT-13b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Finished Best-First random walk after 415 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=103 )
FORMULA DLCround-PT-13b-ReachabilityFireability-07 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="DLCround-PT-13b"
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 DLCround-PT-13b, 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 r180-ebro-158987900500623"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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