fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r294-smll-165463872700310
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for StigmergyElection-PT-05b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
365.447 18948.00 41328.00 150.60 TFTTFTFFTFTTFTTT 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.r294-smll-165463872700310.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 StigmergyElection-PT-05b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463872700310
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 860K
-rw-r--r-- 1 mcc users 6.9K May 30 14:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 30 14:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 30 14:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 30 14:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 25 13:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 25 13:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 25 13:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 25 13:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 12K May 30 14:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K May 30 14:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 30 14:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K May 30 14:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 25 13:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 25 13:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 12:20 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 12:20 instance
-rw-r--r-- 1 mcc users 6 May 29 12:20 iscolored
-rw-r--r-- 1 mcc users 428K May 29 12:20 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-00
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-01
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-02
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-03
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-04
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-05
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-06
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-07
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-08
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-09
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-10
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-11
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-12
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-13
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-14
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654849863485

Running Version 202205111006
[2022-06-10 08:31:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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, 3600]
[2022-06-10 08:31:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 08:31:06] [INFO ] Load time of PNML (sax parser for PT used): 383 ms
[2022-06-10 08:31:06] [INFO ] Transformed 699 places.
[2022-06-10 08:31:06] [INFO ] Transformed 1266 transitions.
[2022-06-10 08:31:06] [INFO ] Found NUPN structural information;
[2022-06-10 08:31:06] [INFO ] Parsed PT model containing 699 places and 1266 transitions in 644 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 41 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 111 resets, run finished after 1162 ms. (steps per millisecond=8 ) properties (out of 15) seen :7
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1266 rows 699 cols
[2022-06-10 08:31:08] [INFO ] Computed 6 place invariants in 77 ms
[2022-06-10 08:31:10] [INFO ] After 1088ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-06-10 08:31:10] [INFO ] [Nat]Absence check using 6 positive place invariants in 15 ms returned sat
[2022-06-10 08:31:12] [INFO ] After 1882ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :6
[2022-06-10 08:31:14] [INFO ] Deduced a trap composed of 189 places in 845 ms of which 9 ms to minimize.
[2022-06-10 08:31:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 918 ms
[2022-06-10 08:31:15] [INFO ] Deduced a trap composed of 189 places in 614 ms of which 2 ms to minimize.
[2022-06-10 08:31:15] [INFO ] Deduced a trap composed of 190 places in 817 ms of which 2 ms to minimize.
[2022-06-10 08:31:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1646 ms
[2022-06-10 08:31:17] [INFO ] Deduced a trap composed of 190 places in 824 ms of which 3 ms to minimize.
[2022-06-10 08:31:18] [INFO ] Deduced a trap composed of 192 places in 931 ms of which 2 ms to minimize.
[2022-06-10 08:31:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2013 ms
[2022-06-10 08:31:18] [INFO ] Deduced a trap composed of 189 places in 363 ms of which 1 ms to minimize.
[2022-06-10 08:31:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 487 ms
[2022-06-10 08:31:19] [INFO ] After 8015ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :5
Attempting to minimize the solution found.
Minimization took 402 ms.
[2022-06-10 08:31:19] [INFO ] After 9163ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :5
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 5 different solutions.
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 2391 ms.
Support contains 7 out of 699 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 699/699 places, 1266/1266 transitions.
Graph (trivial) has 699 edges and 699 vertex of which 103 / 699 are part of one of the 15 SCC in 32 ms
Free SCC test removed 88 places
Drop transitions removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Graph (complete) has 1174 edges and 611 vertex of which 601 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.18 ms
Discarding 10 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 430 transitions
Trivial Post-agglo rules discarded 430 transitions
Performed 430 trivial Post agglomeration. Transition count delta: 430
Iterating post reduction 0 with 435 rules applied. Total rules applied 437 place count 601 transition count 714
Reduce places removed 430 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 454 rules applied. Total rules applied 891 place count 171 transition count 690
Reduce places removed 12 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 19 rules applied. Total rules applied 910 place count 159 transition count 683
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 9 rules applied. Total rules applied 919 place count 152 transition count 681
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 920 place count 151 transition count 681
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 920 place count 151 transition count 669
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 944 place count 139 transition count 669
Discarding 40 places :
Symmetric choice reduction at 5 with 40 rule applications. Total rules 984 place count 99 transition count 629
Iterating global reduction 5 with 40 rules applied. Total rules applied 1024 place count 99 transition count 629
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 1024 place count 99 transition count 626
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 1030 place count 96 transition count 626
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 1043 place count 83 transition count 192
Iterating global reduction 5 with 13 rules applied. Total rules applied 1056 place count 83 transition count 192
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 1066 place count 83 transition count 182
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 1096 place count 68 transition count 167
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1097 place count 68 transition count 166
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 1102 place count 63 transition count 161
Iterating global reduction 7 with 5 rules applied. Total rules applied 1107 place count 63 transition count 161
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1113 place count 60 transition count 169
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 1122 place count 60 transition count 160
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1124 place count 59 transition count 166
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 1132 place count 59 transition count 158
Free-agglomeration rule applied 26 times.
Iterating global reduction 7 with 26 rules applied. Total rules applied 1158 place count 59 transition count 132
Reduce places removed 26 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 29 rules applied. Total rules applied 1187 place count 33 transition count 129
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 1192 place count 28 transition count 124
Iterating global reduction 8 with 5 rules applied. Total rules applied 1197 place count 28 transition count 124
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 8 with 9 rules applied. Total rules applied 1206 place count 28 transition count 115
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 1209 place count 28 transition count 112
Applied a total of 1209 rules in 376 ms. Remains 28 /699 variables (removed 671) and now considering 112/1266 (removed 1154) transitions.
Finished structural reductions, in 1 iterations. Remains : 28/699 places, 112/1266 transitions.
Finished random walk after 495 steps, including 37 resets, run visited all 3 properties in 27 ms. (steps per millisecond=18 )
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 16415 ms.

BK_STOP 1654849882433

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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 ReachabilityCardinality -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 3600 -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="StigmergyElection-PT-05b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 StigmergyElection-PT-05b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r294-smll-165463872700310"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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