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

About the Execution of 2022-gold for NoC3x3-PT-1B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
231.296 48248.00 86992.00 208.90 F normal

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.r288-smll-167863554000148.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 gold2022
Input is NoC3x3-PT-1B, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r288-smll-167863554000148
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 840K
-rw-r--r-- 1 mcc users 7.3K Feb 26 09:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 09:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 09:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 09:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 09:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Feb 26 09:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 09:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 09:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 362K 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 StableMarking

=== Now, execution of the tool begins

BK_START 1678901903763

Running Version 202205111006
[2023-03-15 17:38:26] [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]
[2023-03-15 17:38:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 17:38:27] [INFO ] Load time of PNML (sax parser for PT used): 400 ms
[2023-03-15 17:38:27] [INFO ] Transformed 1416 places.
[2023-03-15 17:38:27] [INFO ] Transformed 1640 transitions.
[2023-03-15 17:38:27] [INFO ] Found NUPN structural information;
[2023-03-15 17:38:27] [INFO ] Parsed PT model containing 1416 places and 1640 transitions in 693 ms.
Graph (trivial) has 1441 edges and 1416 vertex of which 916 / 1416 are part of one of the 20 SCC in 20 ms
Free SCC test removed 896 places
Structural test allowed to assert that 1127 places are NOT stable. Took 57 ms.
Ensure Unique test removed 1064 transitions
Reduce redundant transitions removed 1064 transitions.
Incomplete random walk after 10000 steps, including 65 resets, run finished after 1063 ms. (steps per millisecond=9 ) properties (out of 289) seen :253
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 36) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 34) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 33) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 31) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 27) seen :0
Running SMT prover for 27 properties.
[2023-03-15 17:38:28] [INFO ] Flow matrix only has 557 transitions (discarded 19 similar events)
// Phase 1: matrix 557 rows 520 cols
[2023-03-15 17:38:28] [INFO ] Computed 40 place invariants in 31 ms
[2023-03-15 17:38:29] [INFO ] After 1157ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:27
[2023-03-15 17:38:30] [INFO ] [Nat]Absence check using 40 positive place invariants in 57 ms returned sat
[2023-03-15 17:38:32] [INFO ] After 1376ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :27
[2023-03-15 17:38:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 17:38:33] [INFO ] After 849ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :27
[2023-03-15 17:38:33] [INFO ] Deduced a trap composed of 28 places in 157 ms of which 11 ms to minimize.
[2023-03-15 17:38:33] [INFO ] Deduced a trap composed of 65 places in 117 ms of which 2 ms to minimize.
[2023-03-15 17:38:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 405 ms
[2023-03-15 17:38:34] [INFO ] Deduced a trap composed of 52 places in 75 ms of which 2 ms to minimize.
[2023-03-15 17:38:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2023-03-15 17:38:35] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 2 ms to minimize.
[2023-03-15 17:38:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2023-03-15 17:38:35] [INFO ] After 2819ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :27
Attempting to minimize the solution found.
Minimization took 725 ms.
[2023-03-15 17:38:36] [INFO ] After 6131ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :27
Fused 27 Parikh solutions to 23 different solutions.
Parikh walk visited 2 properties in 1615 ms.
Support contains 25 out of 520 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 520/520 places, 576/576 transitions.
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 520 transition count 536
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 60 place count 500 transition count 536
Discarding 143 places :
Symmetric choice reduction at 2 with 143 rule applications. Total rules 203 place count 357 transition count 393
Iterating global reduction 2 with 143 rules applied. Total rules applied 346 place count 357 transition count 393
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 346 place count 357 transition count 367
Deduced a syphon composed of 26 places in 2 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 398 place count 331 transition count 367
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 406 place count 323 transition count 358
Iterating global reduction 2 with 8 rules applied. Total rules applied 414 place count 323 transition count 358
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 552 place count 254 transition count 289
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 554 place count 253 transition count 300
Free-agglomeration rule applied 108 times.
Iterating global reduction 2 with 108 rules applied. Total rules applied 662 place count 253 transition count 192
Reduce places removed 108 places and 0 transitions.
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (complete) has 346 edges and 145 vertex of which 124 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.4 ms
Discarding 21 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 129 rules applied. Total rules applied 791 place count 124 transition count 172
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 3 with 21 rules applied. Total rules applied 812 place count 124 transition count 151
Applied a total of 812 rules in 203 ms. Remains 124 /520 variables (removed 396) and now considering 151/576 (removed 425) transitions.
Finished structural reductions, in 1 iterations. Remains : 124/520 places, 151/576 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 12819 ms. (steps per millisecond=78 ) properties (out of 25) seen :23
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1918 ms. (steps per millisecond=521 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1385 ms. (steps per millisecond=722 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 151 rows 124 cols
[2023-03-15 17:38:54] [INFO ] Computed 31 place invariants in 4 ms
[2023-03-15 17:38:54] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 17:38:54] [INFO ] [Nat]Absence check using 31 positive place invariants in 14 ms returned sat
[2023-03-15 17:38:54] [INFO ] After 115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 17:38:54] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-03-15 17:38:54] [INFO ] After 43ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 17:38:54] [INFO ] After 80ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-15 17:38:54] [INFO ] After 312ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 31 ms.
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 124/124 places, 151/151 transitions.
Graph (complete) has 295 edges and 124 vertex of which 25 are kept as prefixes of interest. Removing 99 places using SCC suffix rule.0 ms
Discarding 99 places :
Also discarding 98 output transitions
Drop transitions removed 98 transitions
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 25 transition count 40
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 24 transition count 39
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 24 transition count 39
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 22 transition count 37
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 23 place count 22 transition count 34
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 21 transition count 33
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 21 transition count 33
Applied a total of 25 rules in 12 ms. Remains 21 /124 variables (removed 103) and now considering 33/151 (removed 118) transitions.
Finished structural reductions, in 1 iterations. Remains : 21/124 places, 33/151 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 10846 ms. (steps per millisecond=92 ) properties (out of 2) seen :0
Interrupted Best-First random walk after 786817 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=157 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1403 ms. (steps per millisecond=712 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 33 rows 21 cols
[2023-03-15 17:39:11] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-15 17:39:11] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 17:39:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-15 17:39:11] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 17:39:11] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-15 17:39:11] [INFO ] After 8ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 17:39:11] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-15 17:39:11] [INFO ] After 78ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Parikh walk visited 1 properties in 0 ms.
Able to resolve query StableMarking after proving 291 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 45559 ms.

BK_STOP 1678901952011

--------------------
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="NoC3x3-PT-1B"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="gold2022"
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 gold2022"
echo " Input is NoC3x3-PT-1B, 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 r288-smll-167863554000148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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