fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r139-tall-165271828000413
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for MultiCrashLeafsetExtension-PT-S16C03

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1230.052 312463.00 373490.00 2134.80 T normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r139-tall-165271828000413.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/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 MultiCrashLeafsetExtension-PT-S16C03, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r139-tall-165271828000413
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.8M
-rw-r--r-- 1 mcc users 12K Apr 29 16:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 29 16:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 29 16:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 29 16:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K May 9 08:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 9 08:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 9 08:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 9 08:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K May 9 08:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 3.5M 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 StableMarking

=== Now, execution of the tool begins

BK_START 1652744534771

Running Version 202205111006
[2022-05-16 23:42:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -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-16 23:42:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 23:42:16] [INFO ] Load time of PNML (sax parser for PT used): 316 ms
[2022-05-16 23:42:16] [INFO ] Transformed 3606 places.
[2022-05-16 23:42:16] [INFO ] Transformed 5141 transitions.
[2022-05-16 23:42:16] [INFO ] Parsed PT model containing 3606 places and 5141 transitions in 439 ms.
Incomplete random walk after 10000 steps, including 316 resets, run finished after 1551 ms. (steps per millisecond=6 ) properties (out of 3606) seen :2161
Running SMT prover for 1445 properties.
[2022-05-16 23:42:18] [INFO ] Flow matrix only has 4869 transitions (discarded 272 similar events)
// Phase 1: matrix 4869 rows 3606 cols
[2022-05-16 23:42:18] [INFO ] Computed 459 place invariants in 257 ms
[2022-05-16 23:42:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-16 23:42:44] [INFO ] After 25057ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 1445 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1445 out of 3606 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3606/3606 places, 5141/5141 transitions.
Graph (complete) has 12103 edges and 3606 vertex of which 3580 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.19 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions removed 471 transitions
Trivial Post-agglo rules discarded 471 transitions
Performed 471 trivial Post agglomeration. Transition count delta: 471
Iterating post reduction 0 with 471 rules applied. Total rules applied 472 place count 3580 transition count 4670
Reduce places removed 471 places and 0 transitions.
Iterating post reduction 1 with 471 rules applied. Total rules applied 943 place count 3109 transition count 4670
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 93 Pre rules applied. Total rules applied 943 place count 3109 transition count 4577
Deduced a syphon composed of 93 places in 3 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 2 with 186 rules applied. Total rules applied 1129 place count 3016 transition count 4577
Discarding 378 places :
Symmetric choice reduction at 2 with 378 rule applications. Total rules 1507 place count 2638 transition count 4199
Iterating global reduction 2 with 378 rules applied. Total rules applied 1885 place count 2638 transition count 4199
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1896 place count 2627 transition count 4166
Iterating global reduction 2 with 11 rules applied. Total rules applied 1907 place count 2627 transition count 4166
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1911 place count 2625 transition count 4164
Free-agglomeration rule (complex) applied 262 times.
Iterating global reduction 2 with 262 rules applied. Total rules applied 2173 place count 2625 transition count 3924
Reduce places removed 262 places and 0 transitions.
Iterating post reduction 2 with 262 rules applied. Total rules applied 2435 place count 2363 transition count 3924
Partial Free-agglomeration rule applied 93 times.
Drop transitions removed 93 transitions
Iterating global reduction 3 with 93 rules applied. Total rules applied 2528 place count 2363 transition count 3924
Applied a total of 2528 rules in 988 ms. Remains 2363 /3606 variables (removed 1243) and now considering 3924/5141 (removed 1217) transitions.
Finished structural reductions, in 1 iterations. Remains : 2363/3606 places, 3924/5141 transitions.
Interrupted random walk after 423051 steps, including 20254 resets, run timeout after 30001 ms. (steps per millisecond=14 ) properties seen 822
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 623) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 623) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 623) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 623) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 623) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 623) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 623) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 623) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 623) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 623) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 623) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 623) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 623) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 623) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 623) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 623) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 623) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 623) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 623) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 623) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 623) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 623) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 623) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 623) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 623) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 623) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 623) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 623) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 623) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 623) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 623) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 623) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 623) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 623) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 623) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 623) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 623) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 623) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 623) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 623) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 623) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 623) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 623) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 623) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 623) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 623) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 623) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 623) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 623) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 623) seen :0
Running SMT prover for 623 properties.
[2022-05-16 23:43:15] [INFO ] Flow matrix only has 3636 transitions (discarded 288 similar events)
// Phase 1: matrix 3636 rows 2363 cols
[2022-05-16 23:43:16] [INFO ] Computed 433 place invariants in 78 ms
[2022-05-16 23:43:40] [INFO ] After 24675ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:623
[2022-05-16 23:44:01] [INFO ] [Nat]Absence check using 33 positive place invariants in 51 ms returned sat
[2022-05-16 23:44:01] [INFO ] [Nat]Absence check using 33 positive and 400 generalized place invariants in 93 ms returned sat
[2022-05-16 23:45:25] [INFO ] After 61654ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :623
[2022-05-16 23:45:25] [INFO ] State equation strengthened by 1362 read => feed constraints.
[2022-05-16 23:46:33] [INFO ] After 67826ms SMT Verify possible using 1362 Read/Feed constraints in natural domain returned unsat :510 sat :113
[2022-05-16 23:46:35] [INFO ] Deduced a trap composed of 558 places in 1556 ms of which 11 ms to minimize.
[2022-05-16 23:46:37] [INFO ] Deduced a trap composed of 295 places in 1728 ms of which 3 ms to minimize.
[2022-05-16 23:46:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3619 ms
[2022-05-16 23:46:41] [INFO ] Deduced a trap composed of 461 places in 1512 ms of which 3 ms to minimize.
[2022-05-16 23:46:43] [INFO ] Deduced a trap composed of 401 places in 1550 ms of which 3 ms to minimize.
[2022-05-16 23:46:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3829 ms
[2022-05-16 23:46:46] [INFO ] Deduced a trap composed of 444 places in 1716 ms of which 2 ms to minimize.
[2022-05-16 23:46:47] [INFO ] Deduced a trap composed of 278 places in 1538 ms of which 2 ms to minimize.
[2022-05-16 23:46:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3581 ms
[2022-05-16 23:46:51] [INFO ] Deduced a trap composed of 412 places in 1732 ms of which 2 ms to minimize.
[2022-05-16 23:46:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1957 ms
[2022-05-16 23:46:56] [INFO ] Deduced a trap composed of 343 places in 1746 ms of which 3 ms to minimize.
[2022-05-16 23:46:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1964 ms
[2022-05-16 23:46:58] [INFO ] Deduced a trap composed of 342 places in 1745 ms of which 2 ms to minimize.
[2022-05-16 23:46:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1967 ms
[2022-05-16 23:47:00] [INFO ] Deduced a trap composed of 400 places in 1726 ms of which 2 ms to minimize.
[2022-05-16 23:47:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1945 ms
[2022-05-16 23:47:04] [INFO ] Deduced a trap composed of 331 places in 1735 ms of which 2 ms to minimize.
[2022-05-16 23:47:06] [INFO ] Deduced a trap composed of 372 places in 1729 ms of which 2 ms to minimize.
[2022-05-16 23:47:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3793 ms
[2022-05-16 23:47:08] [INFO ] Deduced a trap composed of 333 places in 1723 ms of which 2 ms to minimize.
[2022-05-16 23:47:10] [INFO ] Deduced a trap composed of 289 places in 1716 ms of which 2 ms to minimize.
[2022-05-16 23:47:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3777 ms
[2022-05-16 23:47:12] [INFO ] Deduced a trap composed of 356 places in 1720 ms of which 2 ms to minimize.
[2022-05-16 23:47:14] [INFO ] Deduced a trap composed of 290 places in 1715 ms of which 2 ms to minimize.
[2022-05-16 23:47:16] [INFO ] Deduced a trap composed of 290 places in 1728 ms of which 2 ms to minimize.
[2022-05-16 23:47:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 5643 ms
[2022-05-16 23:47:19] [INFO ] Deduced a trap composed of 289 places in 1583 ms of which 2 ms to minimize.
[2022-05-16 23:47:21] [INFO ] Deduced a trap composed of 316 places in 1723 ms of which 3 ms to minimize.
[2022-05-16 23:47:23] [INFO ] Deduced a trap composed of 391 places in 1718 ms of which 2 ms to minimize.
[2022-05-16 23:47:25] [INFO ] Deduced a trap composed of 374 places in 1743 ms of which 2 ms to minimize.
[2022-05-16 23:47:27] [INFO ] Deduced a trap composed of 372 places in 1729 ms of which 2 ms to minimize.
[2022-05-16 23:47:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-16 23:47:27] [INFO ] After 226190ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:623
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Total runtime 311322 ms.

BK_STOP 1652744847234

--------------------
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
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution StableMarking -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 StableMarking -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="MultiCrashLeafsetExtension-PT-S16C03"
export BK_EXAMINATION="StableMarking"
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 MultiCrashLeafsetExtension-PT-S16C03, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r139-tall-165271828000413"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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