fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r330-tall-171662363000206
Last Updated
July 7, 2024

About the Execution of 2023-gold for RERS2020-PT-pb101

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16166.575 1233661.00 1377924.00 21539.90 [undef] Cannot compute

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r330-tall-171662363000206.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is RERS2020-PT-pb101, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-171662363000206
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 84M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 83M May 18 16:43 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 1716800667302

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=gold2023
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=RERS2020-PT-pb101
Not applying reductions.
Model is PT
ReachabilityDeadlock PT
Running Version 202304061127
[2024-05-27 09:04:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-05-27 09:04:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 09:04:31] [INFO ] Load time of PNML (sax parser for PT used): 2296 ms
[2024-05-27 09:04:31] [INFO ] Transformed 906 places.
[2024-05-27 09:04:31] [INFO ] Transformed 149363 transitions.
[2024-05-27 09:04:31] [INFO ] Found NUPN structural information;
[2024-05-27 09:04:31] [INFO ] Parsed PT model containing 906 places and 149363 transitions and 595952 arcs in 2795 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 2 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 2798 transitions
Reduce redundant transitions removed 2798 transitions.
Built sparse matrix representations for Structural reductions in 104 ms.292110KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 906/906 places, 146565/146565 transitions.
Computed a total of 144 stabilizing places and 28382 stable transitions
Ensure Unique test removed 4 places
Computed a total of 140 stabilizing places and 28382 stable transitions
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 902 transition count 146565
Computed a total of 140 stabilizing places and 28382 stable transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 902 transition count 146564
Deduced a syphon composed of 1 places in 57 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 901 transition count 146564
Computed a total of 139 stabilizing places and 28381 stable transitions
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 59 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 1 with 42 rules applied. Total rules applied 48 place count 880 transition count 146543
Ensure Unique test removed 1161 transitions
Reduce isomorphic transitions removed 1161 transitions.
Computed a total of 134 stabilizing places and 28154 stable transitions
Iterating post reduction 1 with 1161 rules applied. Total rules applied 1209 place count 880 transition count 145382
Computed a total of 134 stabilizing places and 28154 stable transitions
Computed a total of 134 stabilizing places and 28154 stable transitions
Applied a total of 1209 rules in 5046 ms. Remains 880 /906 variables (removed 26) and now considering 145382/146565 (removed 1183) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 5059 ms. Remains : 880/906 places, 145382/146565 transitions.
Interrupted Random walk after 401010 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=13 )
[2024-05-27 09:05:07] [INFO ] Flow matrix only has 112309 transitions (discarded 33073 similar events)
// Phase 1: matrix 112309 rows 880 cols
[2024-05-27 09:05:08] [INFO ] Computed 5 invariants in 537 ms
[2024-05-27 09:05:16] [INFO ] [Real]Absence check using 5 positive place invariants in 20 ms returned sat
[2024-05-27 09:05:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 09:05:50] [INFO ] [Real]Absence check using state equation in 34306 ms returned sat
[2024-05-27 09:05:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 09:06:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 42 ms returned sat
[2024-05-27 09:06:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 09:06:33] [INFO ] [Nat]Absence check using state equation in 32123 ms returned sat
[2024-05-27 09:06:35] [INFO ] State equation strengthened by 2563 read => feed constraints.
[2024-05-27 09:06:52] [INFO ] [Nat]Added 2563 Read/Feed constraints in 16787 ms returned sat
[2024-05-27 09:07:05] [INFO ] Deduced a trap composed of 83 places in 12108 ms of which 13 ms to minimize.
[2024-05-27 09:07:19] [INFO ] Deduced a trap composed of 242 places in 12298 ms of which 3 ms to minimize.
[2024-05-27 09:07:33] [INFO ] Deduced a trap composed of 226 places in 12197 ms of which 2 ms to minimize.
[2024-05-27 09:07:46] [INFO ] Deduced a trap composed of 196 places in 11788 ms of which 3 ms to minimize.
[2024-05-27 09:08:00] [INFO ] Deduced a trap composed of 54 places in 12385 ms of which 2 ms to minimize.
[2024-05-27 09:08:14] [INFO ] Deduced a trap composed of 494 places in 12666 ms of which 2 ms to minimize.
[2024-05-27 09:08:28] [INFO ] Deduced a trap composed of 495 places in 12005 ms of which 2 ms to minimize.
[2024-05-27 09:08:36] [INFO ] Deduced a trap composed of 192 places in 6853 ms of which 1 ms to minimize.
[2024-05-27 09:08:44] [INFO ] Deduced a trap composed of 441 places in 7021 ms of which 0 ms to minimize.
[2024-05-27 09:08:59] [INFO ] Deduced a trap composed of 27 places in 12732 ms of which 2 ms to minimize.
[2024-05-27 09:09:07] [INFO ] Deduced a trap composed of 249 places in 7126 ms of which 1 ms to minimize.
[2024-05-27 09:09:15] [INFO ] Deduced a trap composed of 499 places in 6493 ms of which 1 ms to minimize.
[2024-05-27 09:09:27] [INFO ] Deduced a trap composed of 502 places in 10683 ms of which 1 ms to minimize.
[2024-05-27 09:09:40] [INFO ] Deduced a trap composed of 53 places in 11277 ms of which 2 ms to minimize.
[2024-05-27 09:09:52] [INFO ] Deduced a trap composed of 145 places in 10655 ms of which 1 ms to minimize.
[2024-05-27 09:10:04] [INFO ] Deduced a trap composed of 142 places in 10552 ms of which 2 ms to minimize.
[2024-05-27 09:10:16] [INFO ] Deduced a trap composed of 60 places in 10573 ms of which 1 ms to minimize.
[2024-05-27 09:10:29] [INFO ] Deduced a trap composed of 408 places in 10872 ms of which 2 ms to minimize.
[2024-05-27 09:10:40] [INFO ] Deduced a trap composed of 134 places in 9847 ms of which 1 ms to minimize.
[2024-05-27 09:10:44] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 232451 ms
[2024-05-27 09:11:11] [INFO ] Computed and/alt/rep : 151/1131/151 causal constraints (skipped 112155 transitions) in 26937 ms.
[2024-05-27 09:11:11] [INFO ] Added : 0 causal constraints over 0 iterations in 26941 ms. Result :unknown
Interrupted Parikh directed walk after 11117 steps, including 11117 resets, run timeout after 30002 ms. (steps per millisecond=0 )
Parikh directed walk for 11117 steps, including 11117 resets, run took 30003 ms. (steps per millisecond=0 )
Interrupted Random directed walk after 317569 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=10 )
Interrupted Random walk after 415990 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=13 )
Interrupted Random directed walk after 305899 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=10 )
Interrupted Random walk after 426213 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=14 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 880/880 places, 145382/145382 transitions.
Computed a total of 134 stabilizing places and 28154 stable transitions
Computed a total of 134 stabilizing places and 28154 stable transitions
Computed a total of 134 stabilizing places and 28154 stable transitions
Applied a total of 0 rules in 1405 ms. Remains 880 /880 variables (removed 0) and now considering 145382/145382 (removed 0) transitions.
[2024-05-27 09:13:43] [INFO ] Flow matrix only has 112309 transitions (discarded 33073 similar events)
[2024-05-27 09:13:43] [INFO ] Invariant cache hit.
[2024-05-27 09:13:52] [INFO ] Implicit Places using invariants in 9762 ms returned []
Implicit Place search using SMT only with invariants took 9764 ms to find 0 implicit places.
[2024-05-27 09:13:52] [INFO ] Flow matrix only has 112309 transitions (discarded 33073 similar events)
[2024-05-27 09:13:52] [INFO ] Invariant cache hit.
[2024-05-27 09:14:22] [INFO ] Performed 95746/145382 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-05-27 09:14:38] [INFO ] Dead Transitions using invariants and state equation in 45576 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 56746 ms. Remains : 880/880 places, 145382/145382 transitions.
Interrupted Random walk after 407465 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=13 )
[2024-05-27 09:15:08] [INFO ] Flow matrix only has 112309 transitions (discarded 33073 similar events)
[2024-05-27 09:15:08] [INFO ] Invariant cache hit.
[2024-05-27 09:15:17] [INFO ] [Real]Absence check using 5 positive place invariants in 17 ms returned sat
[2024-05-27 09:15:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 09:15:48] [INFO ] [Real]Absence check using state equation in 31824 ms returned sat
[2024-05-27 09:15:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 09:15:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 41 ms returned sat
[2024-05-27 09:15:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 09:16:30] [INFO ] [Nat]Absence check using state equation in 31800 ms returned sat
[2024-05-27 09:16:32] [INFO ] State equation strengthened by 2563 read => feed constraints.
[2024-05-27 09:16:49] [INFO ] [Nat]Added 2563 Read/Feed constraints in 16884 ms returned sat
[2024-05-27 09:17:03] [INFO ] Deduced a trap composed of 83 places in 12014 ms of which 2 ms to minimize.
[2024-05-27 09:17:16] [INFO ] Deduced a trap composed of 242 places in 12054 ms of which 2 ms to minimize.
[2024-05-27 09:17:29] [INFO ] Deduced a trap composed of 226 places in 11710 ms of which 2 ms to minimize.
[2024-05-27 09:17:42] [INFO ] Deduced a trap composed of 196 places in 11752 ms of which 2 ms to minimize.
[2024-05-27 09:17:55] [INFO ] Deduced a trap composed of 54 places in 11716 ms of which 2 ms to minimize.
[2024-05-27 09:18:09] [INFO ] Deduced a trap composed of 494 places in 12156 ms of which 1 ms to minimize.
[2024-05-27 09:18:22] [INFO ] Deduced a trap composed of 495 places in 11934 ms of which 4 ms to minimize.
[2024-05-27 09:18:31] [INFO ] Deduced a trap composed of 192 places in 6990 ms of which 1 ms to minimize.
[2024-05-27 09:18:39] [INFO ] Deduced a trap composed of 441 places in 6931 ms of which 1 ms to minimize.
[2024-05-27 09:18:52] [INFO ] Deduced a trap composed of 27 places in 11594 ms of which 2 ms to minimize.
[2024-05-27 09:19:01] [INFO ] Deduced a trap composed of 249 places in 7076 ms of which 1 ms to minimize.
[2024-05-27 09:19:09] [INFO ] Deduced a trap composed of 499 places in 6452 ms of which 1 ms to minimize.
[2024-05-27 09:19:21] [INFO ] Deduced a trap composed of 502 places in 10709 ms of which 1 ms to minimize.
[2024-05-27 09:19:34] [INFO ] Deduced a trap composed of 53 places in 11546 ms of which 2 ms to minimize.
[2024-05-27 09:19:46] [INFO ] Deduced a trap composed of 145 places in 10554 ms of which 2 ms to minimize.
[2024-05-27 09:19:57] [INFO ] Deduced a trap composed of 142 places in 10135 ms of which 5 ms to minimize.
[2024-05-27 09:20:09] [INFO ] Deduced a trap composed of 60 places in 10606 ms of which 2 ms to minimize.
[2024-05-27 09:20:21] [INFO ] Deduced a trap composed of 408 places in 10252 ms of which 1 ms to minimize.
[2024-05-27 09:20:32] [INFO ] Deduced a trap composed of 134 places in 9314 ms of which 2 ms to minimize.
[2024-05-27 09:20:36] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 226582 ms
[2024-05-27 09:21:02] [INFO ] Computed and/alt/rep : 151/1131/151 causal constraints (skipped 112155 transitions) in 26386 ms.
[2024-05-27 09:21:02] [INFO ] Added : 0 causal constraints over 0 iterations in 26398 ms. Result :unknown
Interrupted Parikh directed walk after 14483 steps, including 14483 resets, run timeout after 30001 ms. (steps per millisecond=0 )
Parikh directed walk for 14483 steps, including 14483 resets, run took 30002 ms. (steps per millisecond=0 )
Interrupted Random directed walk after 314730 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=10 )
Interrupted Random walk after 423434 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=14 )
Interrupted Random directed walk after 315711 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=10 )
Interrupted Random walk after 402976 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=13 )
[2024-05-27 09:23:37] [INFO ] Flatten gal took : 4177 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9772178845742316882
[2024-05-27 09:23:40] [INFO ] Too many transitions (146565) to apply POR reductions. Disabling POR matrices.
[2024-05-27 09:23:41] [INFO ] Built C files in 1553ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9772178845742316882
Running compilation step : cd /tmp/ltsmin9772178845742316882;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-27 09:23:42] [INFO ] Applying decomposition
[2024-05-27 09:23:46] [INFO ] Flatten gal took : 4142 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5992231247587970251.txt' '-o' '/tmp/graph5992231247587970251.bin' '-w' '/tmp/graph5992231247587970251.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5992231247587970251.bin' '-l' '-1' '-v' '-w' '/tmp/graph5992231247587970251.weights' '-q' '0' '-e' '0.001'
[2024-05-27 09:23:54] [INFO ] Decomposing Gal with order
[2024-05-27 09:23:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 09:24:04] [INFO ] Removed a total of 380412 redundant transitions.
[2024-05-27 09:24:05] [INFO ] Flatten gal took : 7342 ms
[2024-05-27 09:24:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 2509 labels/synchronizations in 23904 ms.
[2024-05-27 09:24:31] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock1609179532789466012.gal : 473 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityDeadlock1609179532789466012.gal' '-t' 'CGAL' '-ctl' 'DEADLOCK'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...234

BK_STOP 1716801900963

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityDeadlock = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityDeadlock -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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="RERS2020-PT-pb101"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is RERS2020-PT-pb101, 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 r330-tall-171662363000206"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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