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-165281577000111.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 RERS17pb115-PT-5, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r193-tajo-165281577000111
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 70M
-rw-r--r-- 1 mcc users 5.5K Apr 30 06:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Apr 30 06:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 30 06:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 30 06:28 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:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 9 08:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:34 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 69M 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 1653138421593

Running Version 202205111006
[2022-05-21 13:07:03] [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 13:07:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 13:07:06] [INFO ] Load time of PNML (sax parser for PT used): 3139 ms
[2022-05-21 13:07:06] [INFO ] Transformed 1399 places.
[2022-05-21 13:07:07] [INFO ] Transformed 144369 transitions.
[2022-05-21 13:07:07] [INFO ] Parsed PT model containing 1399 places and 144369 transitions in 4076 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 92 ms.461347KB memory used
Starting structural reductions in DEADLOCKS mode, iteration 0 : 1399/1399 places, 144369/144369 transitions.
Computed a total of 19 stabilizing places and 1 stable transitions
Ensure Unique test removed 18 places
Computed a total of 1 stabilizing places and 1 stable transitions
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 1381 transition count 144369
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 19 place count 1380 transition count 144368
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 19 rules in 6950 ms. Remains 1380 /1399 variables (removed 19) and now considering 144368/144369 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 1380/1399 places, 144368/144369 transitions.
Interrupted Random walk after 210471 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=7 )
[2022-05-21 13:07:46] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2022-05-21 13:07:46] [INFO ] Computed 19 place invariants in 696 ms
[2022-05-21 13:08:08] [INFO ] [Real]Absence check using 19 positive place invariants in 73 ms returned sat
[2022-05-21 13:08:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 13:08:27] [INFO ] [Real]Absence check using state equation in 19033 ms returned sat
[2022-05-21 13:08:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 13:08:52] [INFO ] [Nat]Absence check using 19 positive place invariants in 50 ms returned sat
[2022-05-21 13:08:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 13:09:12] [INFO ] [Nat]Absence check using state equation in 19430 ms returned sat
[2022-05-21 13:09:14] [INFO ] State equation strengthened by 741 read => feed constraints.
[2022-05-21 13:09:20] [INFO ] [Nat]Added 741 Read/Feed constraints in 5824 ms returned sat
[2022-05-21 13:09:32] [INFO ] Deduced a trap composed of 128 places in 10430 ms of which 8 ms to minimize.
[2022-05-21 13:09:43] [INFO ] Deduced a trap composed of 48 places in 9372 ms of which 3 ms to minimize.
[2022-05-21 13:09:54] [INFO ] Deduced a trap composed of 64 places in 10180 ms of which 3 ms to minimize.
[2022-05-21 13:10:06] [INFO ] Deduced a trap composed of 80 places in 10106 ms of which 2 ms to minimize.
[2022-05-21 13:10:14] [INFO ] Deduced a trap composed of 72 places in 6884 ms of which 1 ms to minimize.
[2022-05-21 13:10:23] [INFO ] Deduced a trap composed of 96 places in 7184 ms of which 1 ms to minimize.
[2022-05-21 13:10:30] [INFO ] Deduced a trap composed of 72 places in 6377 ms of which 1 ms to minimize.
[2022-05-21 13:10:39] [INFO ] Deduced a trap composed of 16 places in 6669 ms of which 1 ms to minimize.
[2022-05-21 13:10:46] [INFO ] Deduced a trap composed of 128 places in 6329 ms of which 1 ms to minimize.
[2022-05-21 13:10:56] [INFO ] Deduced a trap composed of 64 places in 7862 ms of which 1 ms to minimize.
[2022-05-21 13:11:04] [INFO ] Deduced a trap composed of 40 places in 6697 ms of which 2 ms to minimize.
[2022-05-21 13:11:12] [INFO ] Deduced a trap composed of 72 places in 6289 ms of which 2 ms to minimize.
[2022-05-21 13:11:20] [INFO ] Deduced a trap composed of 128 places in 6251 ms of which 1 ms to minimize.
[2022-05-21 13:11:27] [INFO ] Deduced a trap composed of 40 places in 5836 ms of which 0 ms to minimize.
[2022-05-21 13:11:34] [INFO ] Deduced a trap composed of 128 places in 5732 ms of which 1 ms to minimize.
[2022-05-21 13:11:42] [INFO ] Deduced a trap composed of 96 places in 6597 ms of which 1 ms to minimize.
[2022-05-21 13:11:50] [INFO ] Deduced a trap composed of 64 places in 5759 ms of which 0 ms to minimize.
[2022-05-21 13:11:59] [INFO ] Deduced a trap composed of 64 places in 7911 ms of which 1 ms to minimize.
[2022-05-21 13:12:08] [INFO ] Deduced a trap composed of 34 places in 6824 ms of which 0 ms to minimize.
[2022-05-21 13:12:16] [INFO ] Deduced a trap composed of 48 places in 6872 ms of which 0 ms to minimize.
[2022-05-21 13:12:23] [INFO ] Deduced a trap composed of 40 places in 5798 ms of which 7 ms to minimize.
[2022-05-21 13:12:31] [INFO ] Deduced a trap composed of 96 places in 5894 ms of which 1 ms to minimize.
[2022-05-21 13:12:39] [INFO ] Deduced a trap composed of 64 places in 6566 ms of which 0 ms to minimize.
[2022-05-21 13:12:49] [INFO ] Deduced a trap composed of 96 places in 8155 ms of which 1 ms to minimize.
[2022-05-21 13:12:57] [INFO ] Deduced a trap composed of 72 places in 6259 ms of which 1 ms to minimize.
[2022-05-21 13:13:05] [INFO ] Deduced a trap composed of 128 places in 6748 ms of which 1 ms to minimize.
[2022-05-21 13:13:13] [INFO ] Deduced a trap composed of 128 places in 7049 ms of which 1 ms to minimize.
[2022-05-21 13:13:21] [INFO ] Deduced a trap composed of 64 places in 6338 ms of which 1 ms to minimize.
[2022-05-21 13:13:28] [INFO ] Deduced a trap composed of 72 places in 5214 ms of which 0 ms to minimize.
[2022-05-21 13:13:42] [INFO ] Deduced a trap composed of 4 places in 12795 ms of which 2 ms to minimize.
[2022-05-21 13:13:42] [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 close... while checking Deadlocks.
Interrupted Random directed walk after 122644 steps, including 0 resets, run timeout after 30003 ms. (steps per millisecond=4 )
Interrupted Random walk after 232877 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=7 )
Interrupted Random directed walk after 138195 steps, including 0 resets, run timeout after 30007 ms. (steps per millisecond=4 )
Interrupted Random walk after 284324 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=9 )
Starting structural reductions in DEADLOCKS mode, iteration 0 : 1380/1380 places, 144368/144368 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 1886 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2022-05-21 13:15:44] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2022-05-21 13:15:44] [INFO ] Computed 19 place invariants in 516 ms
[2022-05-21 13:15:52] [INFO ] Implicit Places using invariants in 8440 ms returned []
Implicit Place search using SMT only with invariants took 8441 ms to find 0 implicit places.
[2022-05-21 13:15:52] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2022-05-21 13:15:53] [INFO ] Computed 19 place invariants in 290 ms
[2022-05-21 13:16:23] [INFO ] Performed 89173/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2022-05-21 13:16:41] [INFO ] Dead Transitions using invariants and state equation in 48294 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1380/1380 places, 144368/144368 transitions.
Interrupted Random walk after 248818 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=8 )
[2022-05-21 13:17:11] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2022-05-21 13:17:11] [INFO ] Computed 19 place invariants in 264 ms
[2022-05-21 13:17:33] [INFO ] [Real]Absence check using 19 positive place invariants in 68 ms returned sat
[2022-05-21 13:17:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 13:17:53] [INFO ] [Real]Absence check using state equation in 19701 ms returned sat
[2022-05-21 13:17:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 13:18:15] [INFO ] [Nat]Absence check using 19 positive place invariants in 48 ms returned sat
[2022-05-21 13:18:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 13:18:36] [INFO ] [Nat]Absence check using state equation in 21724 ms returned sat
[2022-05-21 13:18:38] [INFO ] State equation strengthened by 741 read => feed constraints.
[2022-05-21 13:18:46] [INFO ] [Nat]Added 741 Read/Feed constraints in 7939 ms returned sat
[2022-05-21 13:18:56] [INFO ] Deduced a trap composed of 128 places in 9431 ms of which 2 ms to minimize.
[2022-05-21 13:19:06] [INFO ] Deduced a trap composed of 48 places in 7721 ms of which 1 ms to minimize.
[2022-05-21 13:19:15] [INFO ] Deduced a trap composed of 64 places in 7765 ms of which 1 ms to minimize.
[2022-05-21 13:19:25] [INFO ] Deduced a trap composed of 80 places in 8730 ms of which 2 ms to minimize.
[2022-05-21 13:19:33] [INFO ] Deduced a trap composed of 72 places in 6741 ms of which 1 ms to minimize.
[2022-05-21 13:19:42] [INFO ] Deduced a trap composed of 96 places in 7823 ms of which 1 ms to minimize.
[2022-05-21 13:19:51] [INFO ] Deduced a trap composed of 72 places in 7619 ms of which 1 ms to minimize.
[2022-05-21 13:20:00] [INFO ] Deduced a trap composed of 16 places in 7339 ms of which 0 ms to minimize.
[2022-05-21 13:20:09] [INFO ] Deduced a trap composed of 128 places in 7420 ms of which 1 ms to minimize.
[2022-05-21 13:20:18] [INFO ] Deduced a trap composed of 64 places in 8109 ms of which 2 ms to minimize.
[2022-05-21 13:20:29] [INFO ] Deduced a trap composed of 40 places in 9723 ms of which 3 ms to minimize.
[2022-05-21 13:20:38] [INFO ] Deduced a trap composed of 72 places in 7406 ms of which 1 ms to minimize.
[2022-05-21 13:20:48] [INFO ] Deduced a trap composed of 128 places in 8079 ms of which 1 ms to minimize.
[2022-05-21 13:20:57] [INFO ] Deduced a trap composed of 40 places in 7289 ms of which 1 ms to minimize.
[2022-05-21 13:21:06] [INFO ] Deduced a trap composed of 128 places in 7392 ms of which 0 ms to minimize.
[2022-05-21 13:21:16] [INFO ] Deduced a trap composed of 96 places in 9363 ms of which 1 ms to minimize.
[2022-05-21 13:21:25] [INFO ] Deduced a trap composed of 64 places in 6989 ms of which 1 ms to minimize.
[2022-05-21 13:21:42] [INFO ] Deduced a trap composed of 64 places in 15083 ms of which 1 ms to minimize.
[2022-05-21 13:21:53] [INFO ] Deduced a trap composed of 34 places in 9302 ms of which 1 ms to minimize.
[2022-05-21 13:22:00] [INFO ] Deduced a trap composed of 48 places in 6507 ms of which 1 ms to minimize.
[2022-05-21 13:22:08] [INFO ] Deduced a trap composed of 40 places in 5801 ms of which 2 ms to minimize.
[2022-05-21 13:22:16] [INFO ] Deduced a trap composed of 96 places in 6760 ms of which 1 ms to minimize.
[2022-05-21 13:22:27] [INFO ] Deduced a trap composed of 64 places in 8945 ms of which 1 ms to minimize.
[2022-05-21 13:22:37] [INFO ] Deduced a trap composed of 96 places in 8264 ms of which 1 ms to minimize.
[2022-05-21 13:22:45] [INFO ] Deduced a trap composed of 72 places in 6473 ms of which 1 ms to minimize.
[2022-05-21 13:22:53] [INFO ] Deduced a trap composed of 128 places in 6909 ms of which 1 ms to minimize.
[2022-05-21 13:23:01] [INFO ] Deduced a trap composed of 128 places in 6373 ms of which 9 ms to minimize.
[2022-05-21 13:23:01] [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 close... while checking Deadlocks.
Interrupted Random directed walk after 139458 steps, including 0 resets, run timeout after 30005 ms. (steps per millisecond=4 )
Interrupted Random walk after 238139 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=7 )
Interrupted Random directed walk after 136285 steps, including 0 resets, run timeout after 30006 ms. (steps per millisecond=4 )
Interrupted Random walk after 275776 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=9 )
[2022-05-21 13:25:07] [INFO ] Flatten gal took : 4817 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin342924018619101052
[2022-05-21 13:25:10] [INFO ] Too many transitions (144369) to apply POR reductions. Disabling POR matrices.
[2022-05-21 13:25:12] [INFO ] Built C files in 2038ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin342924018619101052
Running compilation step : cd /tmp/ltsmin342924018619101052;'/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 13:25:16] [INFO ] Applying decomposition
[2022-05-21 13:25:21] [INFO ] Flatten gal took : 5278 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/graph14063270411896122436.txt' '-o' '/tmp/graph14063270411896122436.bin' '-w' '/tmp/graph14063270411896122436.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14063270411896122436.bin' '-l' '-1' '-v' '-w' '/tmp/graph14063270411896122436.weights' '-q' '0' '-e' '0.001'
[2022-05-21 13:25:35] [INFO ] Decomposing Gal with order
[2022-05-21 13:25:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 13:25:51] [INFO ] Removed a total of 434871 redundant transitions.
[2022-05-21 13:25:53] [INFO ] Flatten gal took : 11343 ms
[2022-05-21 13:26:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 2270 labels/synchronizations in 19217 ms.
[2022-05-21 13:26:18] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock5085484395151849348.gal : 622 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/ReachabilityDeadlock5085484395151849348.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/ltsmin342924018619101052;'/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/ltsmin342924018619101052;'/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)

BK_STOP 1653140037404

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="RERS17pb115-PT-5"
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 RERS17pb115-PT-5, 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-165281577000111"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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