Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r408-oct2-167903726900087.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ShieldIIPs-PT-040B, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r408-oct2-167903726900087
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.3K Feb 25 16:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 16:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 16:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 16:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 16:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 16:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 16:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 675K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1679766628918

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldIIPs-PT-040B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-25 17:50:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-25 17:50:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-25 17:50:33] [INFO ] Load time of PNML (sax parser for PT used): 265 ms
[2023-03-25 17:50:33] [INFO ] Transformed 2403 places.
[2023-03-25 17:50:33] [INFO ] Transformed 2363 transitions.
[2023-03-25 17:50:33] [INFO ] Found NUPN structural information;
[2023-03-25 17:50:33] [INFO ] Parsed PT model containing 2403 places and 2363 transitions and 7126 arcs in 653 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 2403/2403 places, 2363/2363 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 2403 transition count 2162
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 2202 transition count 2162
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 402 place count 2202 transition count 1961
Deduced a syphon composed of 201 places in 28 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 804 place count 2001 transition count 1961
Performed 960 Post agglomeration using F-continuation condition.Transition count delta: 960
Deduced a syphon composed of 960 places in 6 ms
Reduce places removed 960 places and 0 transitions.
Iterating global reduction 2 with 1920 rules applied. Total rules applied 2724 place count 1041 transition count 1001
Renaming transitions due to excessive name length > 1024 char.
Applied a total of 2724 rules in 465 ms. Remains 1041 /2403 variables (removed 1362) and now considering 1001/2363 (removed 1362) transitions.
// Phase 1: matrix 1001 rows 1041 cols
[2023-03-25 17:50:33] [INFO ] Computed 361 place invariants in 36 ms
[2023-03-25 17:50:36] [INFO ] Implicit Places using invariants in 3085 ms returned [1026]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 3130 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 1040/2403 places, 1001/2363 transitions.
Applied a total of 0 rules in 16 ms. Remains 1040 /1040 variables (removed 0) and now considering 1001/1001 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 3625 ms. Remains : 1040/2403 places, 1001/2363 transitions.
Discarding 240 transitions out of 1001. Remains 761
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 655 ms. (steps per millisecond=15 ) properties (out of 760) seen :723
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 37) seen :0
Running SMT prover for 37 properties.
// Phase 1: matrix 1001 rows 1040 cols
[2023-03-25 17:50:38] [INFO ] Computed 360 place invariants in 5 ms
[2023-03-25 17:50:39] [INFO ] [Real]Absence check using 360 positive place invariants in 431 ms returned sat
[2023-03-25 17:50:45] [INFO ] After 7609ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:37
[2023-03-25 17:50:47] [INFO ] [Nat]Absence check using 360 positive place invariants in 115 ms returned sat
[2023-03-25 17:50:53] [INFO ] After 5117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :37
[2023-03-25 17:50:54] [INFO ] Deduced a trap composed of 11 places in 555 ms of which 11 ms to minimize.
[2023-03-25 17:50:54] [INFO ] Deduced a trap composed of 11 places in 200 ms of which 1 ms to minimize.
[2023-03-25 17:50:55] [INFO ] Deduced a trap composed of 17 places in 362 ms of which 2 ms to minimize.
[2023-03-25 17:50:55] [INFO ] Deduced a trap composed of 26 places in 151 ms of which 2 ms to minimize.
[2023-03-25 17:50:55] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 0 ms to minimize.
[2023-03-25 17:50:55] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 1 ms to minimize.
[2023-03-25 17:50:56] [INFO ] Deduced a trap composed of 17 places in 614 ms of which 14 ms to minimize.
[2023-03-25 17:50:56] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 1 ms to minimize.
[2023-03-25 17:50:56] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2834 ms
[2023-03-25 17:50:56] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2023-03-25 17:50:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2023-03-25 17:50:57] [INFO ] Deduced a trap composed of 4 places in 319 ms of which 0 ms to minimize.
[2023-03-25 17:50:57] [INFO ] Deduced a trap composed of 4 places in 372 ms of which 1 ms to minimize.
[2023-03-25 17:50:58] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 1 ms to minimize.
[2023-03-25 17:50:58] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 1 ms to minimize.
[2023-03-25 17:50:58] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 0 ms to minimize.
[2023-03-25 17:50:58] [INFO ] Deduced a trap composed of 4 places in 542 ms of which 1 ms to minimize.
[2023-03-25 17:51:00] [INFO ] Deduced a trap composed of 4 places in 1136 ms of which 1 ms to minimize.
[2023-03-25 17:51:00] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 0 ms to minimize.
[2023-03-25 17:51:00] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 1 ms to minimize.
[2023-03-25 17:51:00] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 0 ms to minimize.
[2023-03-25 17:51:01] [INFO ] Deduced a trap composed of 17 places in 160 ms of which 1 ms to minimize.
[2023-03-25 17:51:01] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2023-03-25 17:51:01] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 4238 ms
[2023-03-25 17:51:02] [INFO ] Deduced a trap composed of 17 places in 151 ms of which 23 ms to minimize.
[2023-03-25 17:51:02] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 1 ms to minimize.
[2023-03-25 17:51:02] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 1 ms to minimize.
[2023-03-25 17:51:03] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 0 ms to minimize.
[2023-03-25 17:51:03] [INFO ] Deduced a trap composed of 22 places in 159 ms of which 1 ms to minimize.
[2023-03-25 17:51:03] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2023-03-25 17:51:03] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1267 ms
[2023-03-25 17:51:03] [INFO ] Deduced a trap composed of 4 places in 275 ms of which 12 ms to minimize.
[2023-03-25 17:51:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 415 ms
[2023-03-25 17:51:04] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2023-03-25 17:51:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2023-03-25 17:51:04] [INFO ] Deduced a trap composed of 4 places in 256 ms of which 28 ms to minimize.
[2023-03-25 17:51:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 376 ms
[2023-03-25 17:51:05] [INFO ] Deduced a trap composed of 4 places in 335 ms of which 0 ms to minimize.
[2023-03-25 17:51:05] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2023-03-25 17:51:05] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2023-03-25 17:51:06] [INFO ] Deduced a trap composed of 11 places in 193 ms of which 8 ms to minimize.
[2023-03-25 17:51:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1011 ms
[2023-03-25 17:51:06] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2023-03-25 17:51:06] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 1 ms to minimize.
[2023-03-25 17:51:07] [INFO ] Deduced a trap composed of 18 places in 332 ms of which 5 ms to minimize.
[2023-03-25 17:51:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 791 ms
[2023-03-25 17:51:07] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 15 ms to minimize.
[2023-03-25 17:51:07] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 1 ms to minimize.
[2023-03-25 17:51:08] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 13 ms to minimize.
[2023-03-25 17:51:08] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2023-03-25 17:51:08] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 1 ms to minimize.
[2023-03-25 17:51:08] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 23 ms to minimize.
[2023-03-25 17:51:08] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2023-03-25 17:51:08] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 0 ms to minimize.
[2023-03-25 17:51:08] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1403 ms
[2023-03-25 17:51:09] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2023-03-25 17:51:09] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2023-03-25 17:51:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 269 ms
[2023-03-25 17:51:09] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 1 ms to minimize.
[2023-03-25 17:51:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2023-03-25 17:51:09] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 0 ms to minimize.
[2023-03-25 17:51:10] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 0 ms to minimize.
[2023-03-25 17:51:10] [INFO ] Deduced a trap composed of 11 places in 338 ms of which 1 ms to minimize.
[2023-03-25 17:51:10] [INFO ] Deduced a trap composed of 12 places in 224 ms of which 0 ms to minimize.
[2023-03-25 17:51:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1096 ms
[2023-03-25 17:51:10] [INFO ] After 22145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :37
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-25 17:51:10] [INFO ] After 25031ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :37
Parikh walk visited 18 properties in 30317 ms.
Support contains 53 out of 1040 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1040/1040 places, 1001/1001 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 1000 transition count 961
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 1000 transition count 961
Partial Free-agglomeration rule applied 245 times.
Drop transitions removed 245 transitions
Iterating global reduction 0 with 245 rules applied. Total rules applied 325 place count 1000 transition count 961
Applied a total of 325 rules in 157 ms. Remains 1000 /1040 variables (removed 40) and now considering 961/1001 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 1000/1040 places, 961/1001 transitions.
Finished random walk after 12727 steps, including 4 resets, run visited all 19 properties in 307 ms. (steps per millisecond=41 )
Able to resolve query QuasiLiveness after proving 761 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 69012 ms.
ITS solved all properties within timeout

BK_STOP 1679766701800

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -timeout 180 -rebuildPNML

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="ShieldIIPs-PT-040B"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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-5348"
echo " Executing tool marciexred"
echo " Input is ShieldIIPs-PT-040B, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r408-oct2-167903726900087"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-040B.tgz
mv ShieldIIPs-PT-040B execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "QuasiLiveness.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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;