fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r344-tall-167889215900126
Last Updated
May 14, 2023

About the Execution of Marcie+red for RERS17pb115-PT-8

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5884.800 1800000.00 1883514.00 4120.80 [undef] Time out reached

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.r344-tall-167889215900126.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 RERS17pb115-PT-8, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r344-tall-167889215900126
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 70M
-rw-r--r-- 1 mcc users 6.2K Feb 25 13:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 13:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 13:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 13:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 16:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 14:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Feb 25 14:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 13:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 25 13:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 69M 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 ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1679132058297

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=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=RERS17pb115-PT-8
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 09:34:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2023-03-18 09:34:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 09:34:21] [INFO ] Load time of PNML (sax parser for PT used): 1938 ms
[2023-03-18 09:34:22] [INFO ] Transformed 1399 places.
[2023-03-18 09:34:22] [INFO ] Transformed 144369 transitions.
[2023-03-18 09:34:22] [INFO ] Parsed PT model containing 1399 places and 144369 transitions and 577414 arcs in 2453 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 2 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 40 ms.364230KB memory used
Starting structural reductions in DEADLOCK 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 3729 ms. Remains 1380 /1399 variables (removed 19) and now considering 144368/144369 (removed 1) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 3743 ms. Remains : 1380/1399 places, 144368/144369 transitions.
Interrupted Random walk after 289798 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=9 )
[2023-03-18 09:34:57] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2023-03-18 09:34:57] [INFO ] Computed 19 place invariants in 374 ms
[2023-03-18 09:35:21] [INFO ] [Real]Absence check using 19 positive place invariants in 91 ms returned sat
[2023-03-18 09:35:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 09:35:40] [INFO ] [Real]Absence check using state equation in 18779 ms returned sat
[2023-03-18 09:35:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 09:36:04] [INFO ] [Nat]Absence check using 19 positive place invariants in 74 ms returned sat
[2023-03-18 09:36:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 09:36:24] [INFO ] [Nat]Absence check using state equation in 19114 ms returned sat
[2023-03-18 09:36:25] [INFO ] State equation strengthened by 741 read => feed constraints.
[2023-03-18 09:36:31] [INFO ] [Nat]Added 741 Read/Feed constraints in 6179 ms returned sat
[2023-03-18 09:36:38] [INFO ] Deduced a trap composed of 40 places in 5711 ms of which 4 ms to minimize.
[2023-03-18 09:36:45] [INFO ] Deduced a trap composed of 64 places in 6319 ms of which 1 ms to minimize.
[2023-03-18 09:36:52] [INFO ] Deduced a trap composed of 40 places in 5747 ms of which 1 ms to minimize.
[2023-03-18 09:37:00] [INFO ] Deduced a trap composed of 72 places in 6352 ms of which 2 ms to minimize.
[2023-03-18 09:37:08] [INFO ] Deduced a trap composed of 96 places in 7007 ms of which 2 ms to minimize.
[2023-03-18 09:37:16] [INFO ] Deduced a trap composed of 64 places in 6720 ms of which 0 ms to minimize.
[2023-03-18 09:37:23] [INFO ] Deduced a trap composed of 72 places in 6337 ms of which 3 ms to minimize.
[2023-03-18 09:37:31] [INFO ] Deduced a trap composed of 64 places in 6533 ms of which 4 ms to minimize.
[2023-03-18 09:37:40] [INFO ] Deduced a trap composed of 128 places in 7646 ms of which 1 ms to minimize.
[2023-03-18 09:37:47] [INFO ] Deduced a trap composed of 34 places in 6479 ms of which 1 ms to minimize.
[2023-03-18 09:37:55] [INFO ] Deduced a trap composed of 16 places in 6423 ms of which 14 ms to minimize.
[2023-03-18 09:38:05] [INFO ] Deduced a trap composed of 128 places in 8535 ms of which 1 ms to minimize.
[2023-03-18 09:38:13] [INFO ] Deduced a trap composed of 48 places in 6759 ms of which 0 ms to minimize.
[2023-03-18 09:38:21] [INFO ] Deduced a trap composed of 128 places in 7089 ms of which 0 ms to minimize.
[2023-03-18 09:38:28] [INFO ] Deduced a trap composed of 72 places in 5750 ms of which 0 ms to minimize.
[2023-03-18 09:38:36] [INFO ] Deduced a trap composed of 96 places in 6967 ms of which 1 ms to minimize.
[2023-03-18 09:38:44] [INFO ] Deduced a trap composed of 96 places in 6696 ms of which 1 ms to minimize.
[2023-03-18 09:38:52] [INFO ] Deduced a trap composed of 72 places in 7133 ms of which 1 ms to minimize.
[2023-03-18 09:39:00] [INFO ] Deduced a trap composed of 64 places in 6901 ms of which 1 ms to minimize.
[2023-03-18 09:39:08] [INFO ] Deduced a trap composed of 96 places in 6628 ms of which 1 ms to minimize.
[2023-03-18 09:39:15] [INFO ] Deduced a trap composed of 64 places in 6244 ms of which 1 ms to minimize.
[2023-03-18 09:39:23] [INFO ] Deduced a trap composed of 80 places in 6197 ms of which 1 ms to minimize.
[2023-03-18 09:39:30] [INFO ] Deduced a trap composed of 40 places in 6354 ms of which 1 ms to minimize.
[2023-03-18 09:39:38] [INFO ] Deduced a trap composed of 128 places in 6005 ms of which 1 ms to minimize.
[2023-03-18 09:39:45] [INFO ] Deduced a trap composed of 96 places in 6283 ms of which 0 ms to minimize.
[2023-03-18 09:39:52] [INFO ] Deduced a trap composed of 48 places in 6000 ms of which 0 ms to minimize.
[2023-03-18 09:39:59] [INFO ] Deduced a trap composed of 128 places in 6336 ms of which 0 ms to minimize.
[2023-03-18 09:40:06] [INFO ] Deduced a trap composed of 128 places in 5675 ms of which 1 ms to minimize.
[2023-03-18 09:40:13] [INFO ] Deduced a trap composed of 72 places in 5974 ms of which 0 ms to minimize.
[2023-03-18 09:40:20] [INFO ] Deduced a trap composed of 72 places in 5745 ms of which 0 ms to minimize.
[2023-03-18 09:40:27] [INFO ] Deduced a trap composed of 128 places in 5602 ms of which 1 ms to minimize.
[2023-03-18 09:40:35] [INFO ] Deduced a trap composed of 64 places in 6343 ms of which 0 ms to minimize.
[2023-03-18 09:40:42] [INFO ] Deduced a trap composed of 128 places in 6563 ms of which 0 ms to minimize.
[2023-03-18 09:40: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 195316 steps, including 0 resets, run timeout after 30003 ms. (steps per millisecond=6 )
Interrupted Random walk after 368762 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=12 )
Interrupted Random directed walk after 202031 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=6 )
Interrupted Random walk after 364664 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=12 )
Starting structural reductions in DEADLOCK 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 1230 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2023-03-18 09:42:44] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-18 09:42:44] [INFO ] Invariant cache hit.
[2023-03-18 09:42:52] [INFO ] Implicit Places using invariants in 8507 ms returned []
Implicit Place search using SMT only with invariants took 8511 ms to find 0 implicit places.
[2023-03-18 09:42:52] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-18 09:42:52] [INFO ] Invariant cache hit.
[2023-03-18 09:43:22] [INFO ] Performed 95957/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 09:43:38] [INFO ] Dead Transitions using invariants and state equation in 45639 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 55381 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Interrupted Random walk after 309113 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=10 )
[2023-03-18 09:44:08] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-18 09:44:08] [INFO ] Invariant cache hit.
[2023-03-18 09:44:31] [INFO ] [Real]Absence check using 19 positive place invariants in 32 ms returned sat
[2023-03-18 09:44:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 09:44:51] [INFO ] [Real]Absence check using state equation in 19771 ms returned sat
[2023-03-18 09:44:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 09:45:15] [INFO ] [Nat]Absence check using 19 positive place invariants in 70 ms returned sat
[2023-03-18 09:45:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 09:45:34] [INFO ] [Nat]Absence check using state equation in 19420 ms returned sat
[2023-03-18 09:45:35] [INFO ] State equation strengthened by 741 read => feed constraints.
[2023-03-18 09:45:41] [INFO ] [Nat]Added 741 Read/Feed constraints in 6302 ms returned sat
[2023-03-18 09:45:49] [INFO ] Deduced a trap composed of 40 places in 6362 ms of which 1 ms to minimize.
[2023-03-18 09:45:57] [INFO ] Deduced a trap composed of 72 places in 6818 ms of which 1 ms to minimize.
[2023-03-18 09:46:05] [INFO ] Deduced a trap composed of 48 places in 7216 ms of which 1 ms to minimize.
[2023-03-18 09:46:14] [INFO ] Deduced a trap composed of 72 places in 7982 ms of which 1 ms to minimize.
[2023-03-18 09:46:22] [INFO ] Deduced a trap composed of 96 places in 6716 ms of which 1 ms to minimize.
[2023-03-18 09:46:29] [INFO ] Deduced a trap composed of 64 places in 6361 ms of which 0 ms to minimize.
[2023-03-18 09:46:37] [INFO ] Deduced a trap composed of 40 places in 6609 ms of which 2 ms to minimize.
[2023-03-18 09:46:45] [INFO ] Deduced a trap composed of 128 places in 7010 ms of which 0 ms to minimize.
[2023-03-18 09:46:53] [INFO ] Deduced a trap composed of 16 places in 6555 ms of which 1 ms to minimize.
[2023-03-18 09:47:01] [INFO ] Deduced a trap composed of 128 places in 7471 ms of which 1 ms to minimize.
[2023-03-18 09:47:09] [INFO ] Deduced a trap composed of 48 places in 7024 ms of which 1 ms to minimize.
[2023-03-18 09:47:17] [INFO ] Deduced a trap composed of 128 places in 6986 ms of which 0 ms to minimize.
[2023-03-18 09:47:26] [INFO ] Deduced a trap composed of 64 places in 7037 ms of which 1 ms to minimize.
[2023-03-18 09:47:34] [INFO ] Deduced a trap composed of 72 places in 7027 ms of which 1 ms to minimize.
[2023-03-18 09:47:41] [INFO ] Deduced a trap composed of 72 places in 6778 ms of which 1 ms to minimize.
[2023-03-18 09:47:49] [INFO ] Deduced a trap composed of 64 places in 6867 ms of which 2 ms to minimize.
[2023-03-18 09:47:57] [INFO ] Deduced a trap composed of 80 places in 6734 ms of which 1 ms to minimize.
[2023-03-18 09:48:05] [INFO ] Deduced a trap composed of 96 places in 6686 ms of which 1 ms to minimize.
[2023-03-18 09:48:13] [INFO ] Deduced a trap composed of 64 places in 6630 ms of which 1 ms to minimize.
[2023-03-18 09:48:21] [INFO ] Deduced a trap composed of 128 places in 7594 ms of which 0 ms to minimize.
[2023-03-18 09:48:30] [INFO ] Deduced a trap composed of 96 places in 7097 ms of which 0 ms to minimize.
[2023-03-18 09:48:37] [INFO ] Deduced a trap composed of 72 places in 6138 ms of which 1 ms to minimize.
[2023-03-18 09:48:44] [INFO ] Deduced a trap composed of 96 places in 6000 ms of which 1 ms to minimize.
[2023-03-18 09:48:52] [INFO ] Deduced a trap composed of 128 places in 6257 ms of which 3 ms to minimize.
[2023-03-18 09:49:00] [INFO ] Deduced a trap composed of 128 places in 6923 ms of which 0 ms to minimize.
[2023-03-18 09:49:07] [INFO ] Deduced a trap composed of 40 places in 6386 ms of which 1 ms to minimize.
[2023-03-18 09:49:15] [INFO ] Deduced a trap composed of 34 places in 6270 ms of which 1 ms to minimize.
[2023-03-18 09:49:22] [INFO ] Deduced a trap composed of 128 places in 6159 ms of which 0 ms to minimize.
[2023-03-18 09:49:29] [INFO ] Deduced a trap composed of 96 places in 5881 ms of which 1 ms to minimize.
[2023-03-18 09:49:37] [INFO ] Deduced a trap composed of 64 places in 6196 ms of which 1 ms to minimize.
[2023-03-18 09:49:43] [INFO ] Deduced a trap composed of 96 places in 5459 ms of which 1 ms to minimize.
[2023-03-18 09:49:50] [INFO ] Deduced a trap composed of 128 places in 5911 ms of which 0 ms to minimize.
[2023-03-18 09:49:58] [INFO ] Deduced a trap composed of 128 places in 6421 ms of which 1 ms to minimize.
[2023-03-18 09:49:58] [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 193117 steps, including 0 resets, run timeout after 30007 ms. (steps per millisecond=6 )
Interrupted Random walk after 355697 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=11 )
Interrupted Random directed walk after 191813 steps, including 0 resets, run timeout after 30002 ms. (steps per millisecond=6 )
Interrupted Random walk after 362429 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=12 )
[2023-03-18 09:52:03] [INFO ] Flatten gal took : 3911 ms
[2023-03-18 09:52:03] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityDeadlock.sr.xml took 1 ms.
[2023-03-18 09:52:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1399 places, 144369 transitions and 577414 arcs took 298 ms.
Total runtime 1063388 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=/home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin//ReachabilityDeadlock.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: RERS17pb115_PT_8
(NrP: 1399 NrTr: 144369 NrArc: 577414)

parse formulas
formulas created successfully
place and transition orderings generation:0m51.244sec

net check time: 0m 0.152sec

init dd package: 0m 2.657sec

TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 10146808 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15981288 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -timeout 180 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 2m 8.747sec

1399 2751 3547 3547 5058 5178 5428 5434 8361 9309 9309 13476 13999

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-8"
export BK_EXAMINATION="ReachabilityDeadlock"
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 RERS17pb115-PT-8, 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 r344-tall-167889215900126"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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