Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2022-input.r211-oct2-165281604000166.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is SafeBus-PT-06, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-oct2-165281604000166
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 896K
-rw-r--r-- 1 mcc users 18K Apr 29 11:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 129K Apr 29 11:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 42K Apr 29 11:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 221K Apr 29 11:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.1K May 9 08:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 39K May 9 08:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 17K May 9 08:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 71K May 9 08:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.6K May 9 08:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.2K May 9 08:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 303K 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 1653116568962

Running Version 202205111006
[2022-05-21 07:02:50] [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 07:02:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 07:02:50] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2022-05-21 07:02:50] [INFO ] Transformed 144 places.
[2022-05-21 07:02:50] [INFO ] Transformed 451 transitions.
[2022-05-21 07:02:50] [INFO ] Parsed PT model containing 144 places and 451 transitions in 203 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 4 ms.
Working with output stream class java.io.PrintStream
Reduce places removed 6 places and 0 transitions.
Built sparse matrix representations for Structural reductions in 5 ms.9550KB memory used
Starting structural reductions in DEADLOCKS mode, iteration 0 : 138/138 places, 451/451 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 47 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 138/138 places, 451/451 transitions.
Starting structural reductions in DEADLOCKS mode, iteration 0 : 138/138 places, 451/451 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 30 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
[2022-05-21 07:02:50] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
// Phase 1: matrix 242 rows 138 cols
[2022-05-21 07:02:50] [INFO ] Computed 29 place invariants in 24 ms
[2022-05-21 07:02:50] [INFO ] Implicit Places using invariants in 298 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 329 ms to find 6 implicit places.
Starting structural reductions in DEADLOCKS mode, iteration 1 : 132/138 places, 451/451 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 132 transition count 445
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 445
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -114
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 120 transition count 559
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 24 rules in 36 ms. Remains 120 /132 variables (removed 12) and now considering 559/451 (removed -108) transitions.
[2022-05-21 07:02:50] [INFO ] Flow matrix only has 350 transitions (discarded 209 similar events)
// Phase 1: matrix 350 rows 120 cols
[2022-05-21 07:02:50] [INFO ] Computed 23 place invariants in 10 ms
[2022-05-21 07:02:50] [INFO ] Implicit Places using invariants in 165 ms returned []
[2022-05-21 07:02:50] [INFO ] Flow matrix only has 350 transitions (discarded 209 similar events)
// Phase 1: matrix 350 rows 120 cols
[2022-05-21 07:02:50] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-21 07:02:51] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-05-21 07:02:51] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 537 ms to find 0 implicit places.
Starting structural reductions in DEADLOCKS mode, iteration 2 : 120/138 places, 559/451 transitions.
Finished structural reductions, in 2 iterations. Remains : 120/138 places, 559/451 transitions.
Random walk for 1250000 steps, including 0 resets, run took 3295 ms (no deadlock found). (steps per millisecond=379 )
Random directed walk for 1250001 steps, including 0 resets, run took 2773 ms (no deadlock found). (steps per millisecond=450 )
[2022-05-21 07:02:57] [INFO ] Flow matrix only has 350 transitions (discarded 209 similar events)
// Phase 1: matrix 350 rows 120 cols
[2022-05-21 07:02:57] [INFO ] Computed 23 place invariants in 10 ms
[2022-05-21 07:02:57] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-05-21 07:02:57] [INFO ] [Real]Absence check using 8 positive and 15 generalized place invariants in 17 ms returned sat
[2022-05-21 07:02:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:02:57] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2022-05-21 07:02:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:02:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2022-05-21 07:02:57] [INFO ] [Nat]Absence check using 8 positive and 15 generalized place invariants in 9 ms returned sat
[2022-05-21 07:02:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:02:57] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2022-05-21 07:02:57] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-05-21 07:02:57] [INFO ] [Nat]Added 43 Read/Feed constraints in 68 ms returned sat
[2022-05-21 07:02:57] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 2 ms to minimize.
[2022-05-21 07:02:57] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2022-05-21 07:02:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 159 ms
[2022-05-21 07:02:58] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 308 transitions) in 48 ms.
[2022-05-21 07:02:58] [INFO ] Added : 2 causal constraints over 2 iterations in 116 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
Parikh directed walk for 10400 steps, including 822 resets, run took 61 ms. (steps per millisecond=170 )
Random directed walk for 500000 steps, including 0 resets, run took 1132 ms (no deadlock found). (steps per millisecond=441 )
Random walk for 500000 steps, including 0 resets, run took 1262 ms (no deadlock found). (steps per millisecond=396 )
Random directed walk for 500003 steps, including 0 resets, run took 1228 ms (no deadlock found). (steps per millisecond=407 )
Random walk for 500000 steps, including 0 resets, run took 1381 ms (no deadlock found). (steps per millisecond=362 )
Starting structural reductions in DEADLOCKS mode, iteration 0 : 120/120 places, 559/559 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 24 ms. Remains 120 /120 variables (removed 0) and now considering 559/559 (removed 0) transitions.
[2022-05-21 07:03:03] [INFO ] Flow matrix only has 350 transitions (discarded 209 similar events)
// Phase 1: matrix 350 rows 120 cols
[2022-05-21 07:03:03] [INFO ] Computed 23 place invariants in 7 ms
[2022-05-21 07:03:03] [INFO ] Implicit Places using invariants in 143 ms returned []
[2022-05-21 07:03:03] [INFO ] Flow matrix only has 350 transitions (discarded 209 similar events)
// Phase 1: matrix 350 rows 120 cols
[2022-05-21 07:03:03] [INFO ] Computed 23 place invariants in 7 ms
[2022-05-21 07:03:03] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-05-21 07:03:03] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
[2022-05-21 07:03:03] [INFO ] Redundant transitions in 23 ms returned []
[2022-05-21 07:03:03] [INFO ] Flow matrix only has 350 transitions (discarded 209 similar events)
// Phase 1: matrix 350 rows 120 cols
[2022-05-21 07:03:03] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-21 07:03:03] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 36 transitions.
Found 36 dead transitions using SMT.
Drop transitions removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in DEADLOCKS mode, iteration 1 : 120/120 places, 523/559 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 21 ms. Remains 120 /120 variables (removed 0) and now considering 523/523 (removed 0) transitions.
[2022-05-21 07:03:03] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions, in 2 iterations. Remains : 120/120 places, 523/559 transitions.
Random walk for 1250000 steps, including 0 resets, run took 3182 ms (no deadlock found). (steps per millisecond=392 )
Random directed walk for 1250000 steps, including 0 resets, run took 2622 ms (no deadlock found). (steps per millisecond=476 )
[2022-05-21 07:03:09] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
// Phase 1: matrix 350 rows 120 cols
[2022-05-21 07:03:09] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-21 07:03:09] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2022-05-21 07:03:09] [INFO ] [Real]Absence check using 8 positive and 15 generalized place invariants in 24 ms returned sat
[2022-05-21 07:03:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:03:10] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2022-05-21 07:03:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:03:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-05-21 07:03:10] [INFO ] [Nat]Absence check using 8 positive and 15 generalized place invariants in 12 ms returned sat
[2022-05-21 07:03:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:03:10] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2022-05-21 07:03:10] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-05-21 07:03:10] [INFO ] [Nat]Added 43 Read/Feed constraints in 27 ms returned sat
[2022-05-21 07:03:10] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
[2022-05-21 07:03:10] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2022-05-21 07:03:10] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 0 ms to minimize.
[2022-05-21 07:03:10] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2022-05-21 07:03:10] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 0 ms to minimize.
[2022-05-21 07:03:10] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 0 ms to minimize.
[2022-05-21 07:03:10] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 0 ms to minimize.
[2022-05-21 07:03:10] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2022-05-21 07:03:11] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2022-05-21 07:03:11] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2022-05-21 07:03:11] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 882 ms
[2022-05-21 07:03:11] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 308 transitions) in 63 ms.
[2022-05-21 07:03:11] [INFO ] Added : 1 causal constraints over 1 iterations in 171 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
Parikh directed walk for 4700 steps, including 630 resets, run took 20 ms. (steps per millisecond=235 )
Random directed walk for 500001 steps, including 0 resets, run took 998 ms (no deadlock found). (steps per millisecond=501 )
Random walk for 500000 steps, including 0 resets, run took 1343 ms (no deadlock found). (steps per millisecond=372 )
Random directed walk for 500000 steps, including 0 resets, run took 1120 ms (no deadlock found). (steps per millisecond=446 )
Random walk for 500000 steps, including 0 resets, run took 1161 ms (no deadlock found). (steps per millisecond=430 )
[2022-05-21 07:03:16] [INFO ] Flatten gal took : 69 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4067531523781386020
[2022-05-21 07:03:16] [INFO ] Applying decomposition
[2022-05-21 07:03:16] [INFO ] Computing symmetric may disable matrix : 451 transitions.
[2022-05-21 07:03:16] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:03:16] [INFO ] Computing symmetric may enable matrix : 451 transitions.
[2022-05-21 07:03:16] [INFO ] Flatten gal took : 35 ms
[2022-05-21 07:03:16] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:03:16] [INFO ] Computing Do-Not-Accords matrix : 451 transitions.
[2022-05-21 07:03:16] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph11680484837570984803.txt' '-o' '/tmp/graph11680484837570984803.bin' '-w' '/tmp/graph11680484837570984803.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11680484837570984803.bin' '-l' '-1' '-v' '-w' '/tmp/graph11680484837570984803.weights' '-q' '0' '-e' '0.001'
[2022-05-21 07:03:16] [INFO ] Built C files in 184ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4067531523781386020
Running compilation step : cd /tmp/ltsmin4067531523781386020;'/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 07:03:16] [INFO ] Decomposing Gal with order
[2022-05-21 07:03:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 07:03:16] [INFO ] Removed a total of 467 redundant transitions.
[2022-05-21 07:03:16] [INFO ] Flatten gal took : 134 ms
[2022-05-21 07:03:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 282 labels/synchronizations in 25 ms.
[2022-05-21 07:03:16] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock11926084921450544168.gal : 5 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/ReachabilityDeadlock11926084921450544168.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...226
No direction supplied, using forward translation only.
Compilation finished in 1269 ms.
Running link step : cd /tmp/ltsmin4067531523781386020;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin4067531523781386020;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-d'
LTSmin run took 316413 ms.
FORMULA ReachabilityDeadlock FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 344253 ms.

BK_STOP 1653116914377

--------------------
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="SafeBus-PT-06"
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 SafeBus-PT-06, 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 r211-oct2-165281604000166"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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