Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r193-tajo-165281576800011.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-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 itstools
Input is RERS17pb113-PT-3, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r193-tajo-165281576800011
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 9.2K Apr 30 05:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 30 05:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 30 05:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 30 05:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 9 08:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 15M May 10 09:34 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 ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1653136394731

Running Version 202205111006
[2022-05-21 12:33:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2022-05-21 12:33:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 12:33:16] [INFO ] Load time of PNML (sax parser for PT used): 621 ms
[2022-05-21 12:33:16] [INFO ] Transformed 639 places.
[2022-05-21 12:33:16] [INFO ] Transformed 31353 transitions.
[2022-05-21 12:33:16] [INFO ] Parsed PT model containing 639 places and 31353 transitions in 836 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 4 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 19 ms.82707KB memory used
Starting structural reductions in DEADLOCKS mode, iteration 0 : 639/639 places, 31353/31353 transitions.
Computed a total of 13 stabilizing places and 1 stable transitions
Ensure Unique test removed 12 places
Computed a total of 1 stabilizing places and 1 stable transitions
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 627 transition count 31353
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 626 transition count 31352
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 13 rules in 954 ms. Remains 626 /639 variables (removed 13) and now considering 31352/31353 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 626/639 places, 31352/31353 transitions.
Interrupted Random walk after 1069146 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=35 )
[2022-05-21 12:33:48] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2022-05-21 12:33:48] [INFO ] Computed 13 place invariants in 93 ms
[2022-05-21 12:33:51] [INFO ] [Real]Absence check using 13 positive place invariants in 18 ms returned sat
[2022-05-21 12:33:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 12:34:06] [INFO ] [Real]Absence check using state equation in 14696 ms returned sat
[2022-05-21 12:34:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 12:34:10] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2022-05-21 12:34:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 12:34:26] [INFO ] [Nat]Absence check using state equation in 16330 ms returned sat
[2022-05-21 12:34:26] [INFO ] State equation strengthened by 268 read => feed constraints.
[2022-05-21 12:34:30] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-21 12:34:31] [INFO ] [Nat]Added 268 Read/Feed constraints in 4770 ms returned sat
[2022-05-21 12:34:34] [INFO ] Deduced a trap composed of 48 places in 2154 ms of which 3 ms to minimize.
[2022-05-21 12:34:36] [INFO ] Deduced a trap composed of 24 places in 1642 ms of which 1 ms to minimize.
[2022-05-21 12:34:38] [INFO ] Deduced a trap composed of 40 places in 1572 ms of which 1 ms to minimize.
[2022-05-21 12:34:40] [INFO ] Deduced a trap composed of 48 places in 1313 ms of which 1 ms to minimize.
[2022-05-21 12:34:41] [INFO ] Deduced a trap composed of 64 places in 1398 ms of which 1 ms to minimize.
[2022-05-21 12:34:44] [INFO ] Deduced a trap composed of 64 places in 1607 ms of which 0 ms to minimize.
[2022-05-21 12:34:46] [INFO ] Deduced a trap composed of 40 places in 1436 ms of which 1 ms to minimize.
[2022-05-21 12:34:47] [INFO ] Deduced a trap composed of 64 places in 1135 ms of which 0 ms to minimize.
[2022-05-21 12:34:50] [INFO ] Deduced a trap composed of 48 places in 1392 ms of which 0 ms to minimize.
[2022-05-21 12:34:52] [INFO ] Deduced a trap composed of 48 places in 1535 ms of which 1 ms to minimize.
[2022-05-21 12:34:54] [INFO ] Deduced a trap composed of 65 places in 1343 ms of which 1 ms to minimize.
[2022-05-21 12:34:56] [INFO ] Deduced a trap composed of 40 places in 1206 ms of which 1 ms to minimize.
[2022-05-21 12:34:58] [INFO ] Deduced a trap composed of 64 places in 1402 ms of which 1 ms to minimize.
[2022-05-21 12:35:00] [INFO ] Deduced a trap composed of 40 places in 1288 ms of which 1 ms to minimize.
[2022-05-21 12:35:02] [INFO ] Deduced a trap composed of 64 places in 1444 ms of which 1 ms to minimize.
[2022-05-21 12:35:04] [INFO ] Deduced a trap composed of 40 places in 1000 ms of which 1 ms to minimize.
[2022-05-21 12:35:06] [INFO ] Deduced a trap composed of 40 places in 919 ms of which 1 ms to minimize.
[2022-05-21 12:35:09] [INFO ] Deduced a trap composed of 48 places in 842 ms of which 0 ms to minimize.
[2022-05-21 12:35:12] [INFO ] Deduced a trap composed of 64 places in 951 ms of which 1 ms to minimize.
[2022-05-21 12:35:13] [INFO ] Deduced a trap composed of 64 places in 592 ms of which 0 ms to minimize.
[2022-05-21 12:35:14] [INFO ] Deduced a trap composed of 48 places in 744 ms of which 0 ms to minimize.
[2022-05-21 12:35:15] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 43762 ms
[2022-05-21 12:35:18] [INFO ] Computed and/alt/rep : 1/9/1 causal constraints (skipped 18323 transitions) in 2987 ms.
[2022-05-21 12:35:19] [INFO ] Added : 0 causal constraints over 0 iterations in 4424 ms. Result :sat
Interrupted Parikh directed walk after 46889 steps, including 46889 resets, run timeout after 30001 ms. (steps per millisecond=1 )
Parikh directed walk for 46889 steps, including 46889 resets, run took 30001 ms. (steps per millisecond=1 )
Random directed walk for 500007 steps, including 0 resets, run took 28140 ms (no deadlock found). (steps per millisecond=17 )
Random walk for 500000 steps, including 0 resets, run took 18052 ms (no deadlock found). (steps per millisecond=27 )
Interrupted Random directed walk after 465629 steps, including 0 resets, run timeout after 30002 ms. (steps per millisecond=15 )
Random walk for 500000 steps, including 0 resets, run took 14593 ms (no deadlock found). (steps per millisecond=34 )
Starting structural reductions in DEADLOCKS mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 230 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2022-05-21 12:37:21] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2022-05-21 12:37:21] [INFO ] Computed 13 place invariants in 68 ms
[2022-05-21 12:37:23] [INFO ] Implicit Places using invariants in 1761 ms returned []
Implicit Place search using SMT only with invariants took 1764 ms to find 0 implicit places.
[2022-05-21 12:37:23] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2022-05-21 12:37:23] [INFO ] Computed 13 place invariants in 51 ms
[2022-05-21 12:37:31] [INFO ] Dead Transitions using invariants and state equation in 8394 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 626/626 places, 31352/31352 transitions.
Interrupted Random walk after 976855 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=32 )
[2022-05-21 12:38:01] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2022-05-21 12:38:01] [INFO ] Computed 13 place invariants in 83 ms
[2022-05-21 12:38:05] [INFO ] [Real]Absence check using 13 positive place invariants in 17 ms returned sat
[2022-05-21 12:38:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 12:38:22] [INFO ] [Real]Absence check using state equation in 16946 ms returned sat
[2022-05-21 12:38:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 12:38:25] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2022-05-21 12:38:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 12:38:44] [INFO ] [Nat]Absence check using state equation in 18962 ms returned sat
[2022-05-21 12:38:45] [INFO ] State equation strengthened by 268 read => feed constraints.
[2022-05-21 12:38:48] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-21 12:38:49] [INFO ] [Nat]Added 268 Read/Feed constraints in 4300 ms returned sat
[2022-05-21 12:38:51] [INFO ] Deduced a trap composed of 48 places in 1997 ms of which 1 ms to minimize.
[2022-05-21 12:38:53] [INFO ] Deduced a trap composed of 24 places in 1650 ms of which 0 ms to minimize.
[2022-05-21 12:38:55] [INFO ] Deduced a trap composed of 40 places in 1484 ms of which 1 ms to minimize.
[2022-05-21 12:38:57] [INFO ] Deduced a trap composed of 48 places in 1438 ms of which 1 ms to minimize.
[2022-05-21 12:38:59] [INFO ] Deduced a trap composed of 40 places in 1299 ms of which 0 ms to minimize.
[2022-05-21 12:39:01] [INFO ] Deduced a trap composed of 40 places in 1430 ms of which 0 ms to minimize.
[2022-05-21 12:39:03] [INFO ] Deduced a trap composed of 40 places in 1211 ms of which 1 ms to minimize.
[2022-05-21 12:39:05] [INFO ] Deduced a trap composed of 64 places in 1640 ms of which 0 ms to minimize.
[2022-05-21 12:39:07] [INFO ] Deduced a trap composed of 40 places in 1719 ms of which 1 ms to minimize.
[2022-05-21 12:39:09] [INFO ] Deduced a trap composed of 64 places in 1665 ms of which 1 ms to minimize.
[2022-05-21 12:39:11] [INFO ] Deduced a trap composed of 64 places in 1165 ms of which 0 ms to minimize.
[2022-05-21 12:39:13] [INFO ] Deduced a trap composed of 64 places in 1100 ms of which 0 ms to minimize.
[2022-05-21 12:39:14] [INFO ] Deduced a trap composed of 48 places in 894 ms of which 1 ms to minimize.
[2022-05-21 12:39:16] [INFO ] Deduced a trap composed of 40 places in 1778 ms of which 3 ms to minimize.
[2022-05-21 12:39:18] [INFO ] Deduced a trap composed of 48 places in 985 ms of which 1 ms to minimize.
[2022-05-21 12:39:20] [INFO ] Deduced a trap composed of 64 places in 1048 ms of which 0 ms to minimize.
[2022-05-21 12:39:21] [INFO ] Deduced a trap composed of 48 places in 951 ms of which 1 ms to minimize.
[2022-05-21 12:39:23] [INFO ] Deduced a trap composed of 64 places in 1154 ms of which 1 ms to minimize.
[2022-05-21 12:39:25] [INFO ] Deduced a trap composed of 64 places in 1243 ms of which 1 ms to minimize.
[2022-05-21 12:39:27] [INFO ] Deduced a trap composed of 65 places in 1070 ms of which 0 ms to minimize.
[2022-05-21 12:39:28] [INFO ] Deduced a trap composed of 48 places in 794 ms of which 0 ms to minimize.
[2022-05-21 12:39:29] [INFO ] Deduced a trap composed of 64 places in 702 ms of which 1 ms to minimize.
[2022-05-21 12:39:32] [INFO ] Trap strengthening (SAT) tested/added 22/22 trap constraints in 43213 ms
Parikh directed walk for 456100 steps, including 1000 resets, run took 15813 ms. (steps per millisecond=28 )
Random directed walk for 500008 steps, including 0 resets, run took 29356 ms (no deadlock found). (steps per millisecond=17 )
Random walk for 500000 steps, including 0 resets, run took 15825 ms (no deadlock found). (steps per millisecond=31 )
Interrupted Random directed walk after 465654 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=15 )
Random walk for 500000 steps, including 0 resets, run took 17589 ms (no deadlock found). (steps per millisecond=28 )
[2022-05-21 12:41:23] [INFO ] Flatten gal took : 1240 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14050806143579721618
[2022-05-21 12:41:23] [INFO ] Too many transitions (31353) to apply POR reductions. Disabling POR matrices.
[2022-05-21 12:41:24] [INFO ] Applying decomposition
[2022-05-21 12:41:24] [INFO ] Built C files in 533ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14050806143579721618
Running compilation step : cd /tmp/ltsmin14050806143579721618;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-21 12:41:25] [INFO ] Flatten gal took : 893 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2135730638585541083.txt' '-o' '/tmp/graph2135730638585541083.bin' '-w' '/tmp/graph2135730638585541083.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2135730638585541083.bin' '-l' '-1' '-v' '-w' '/tmp/graph2135730638585541083.weights' '-q' '0' '-e' '0.001'
[2022-05-21 12:41:28] [INFO ] Decomposing Gal with order
[2022-05-21 12:41:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 12:41:31] [INFO ] Removed a total of 91896 redundant transitions.
[2022-05-21 12:41:31] [INFO ] Flatten gal took : 1966 ms
[2022-05-21 12:41:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 1504 labels/synchronizations in 1482 ms.
[2022-05-21 12:41:34] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock2171113236513776755.gal : 157 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityDeadlock2171113236513776755.gal' '-t' 'CGAL' '-ctl' 'DEADLOCK'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/R...225
No direction supplied, using forward translation only.
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14050806143579721618;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 360 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14050806143579721618;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 360 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-21 12:54:18] [INFO ] Flatten gal took : 1172 ms
[2022-05-21 12:54:18] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock17836816015976857449.gal : 157 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityDeadlock17836816015976857449.gal' '-t' 'CGAL' '-ctl' 'DEADLOCK' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/R...247
No direction supplied, using forward translation only.

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityDeadlock = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityDeadlock -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="RERS17pb113-PT-3"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is RERS17pb113-PT-3, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r193-tajo-165281576800011"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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