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

About the Execution of 2021-gold for StigmergyCommit-PT-05a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
242.392 16983.00 35037.00 430.30 FTTFTFFFFTTTTTTT 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.r305-smll-165463878400053.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 gold2021
Input is StigmergyCommit-PT-05a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r305-smll-165463878400053
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 4.9K May 30 15:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 45K May 30 15:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 30 15:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 30 15:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 25 13:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 25 13:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 25 13:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 25 13:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 14K May 30 15:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K May 30 15:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 30 15:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K May 30 15:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 25 13:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 25 13:01 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 613K 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 StigmergyCommit-PT-05a-ReachabilityCardinality-00
FORMULA_NAME StigmergyCommit-PT-05a-ReachabilityCardinality-01
FORMULA_NAME StigmergyCommit-PT-05a-ReachabilityCardinality-02
FORMULA_NAME StigmergyCommit-PT-05a-ReachabilityCardinality-03
FORMULA_NAME StigmergyCommit-PT-05a-ReachabilityCardinality-04
FORMULA_NAME StigmergyCommit-PT-05a-ReachabilityCardinality-05
FORMULA_NAME StigmergyCommit-PT-05a-ReachabilityCardinality-06
FORMULA_NAME StigmergyCommit-PT-05a-ReachabilityCardinality-07
FORMULA_NAME StigmergyCommit-PT-05a-ReachabilityCardinality-08
FORMULA_NAME StigmergyCommit-PT-05a-ReachabilityCardinality-09
FORMULA_NAME StigmergyCommit-PT-05a-ReachabilityCardinality-10
FORMULA_NAME StigmergyCommit-PT-05a-ReachabilityCardinality-11
FORMULA_NAME StigmergyCommit-PT-05a-ReachabilityCardinality-12
FORMULA_NAME StigmergyCommit-PT-05a-ReachabilityCardinality-13
FORMULA_NAME StigmergyCommit-PT-05a-ReachabilityCardinality-14
FORMULA_NAME StigmergyCommit-PT-05a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654719517734

Running Version 0
[2022-06-08 20:18:40] [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-08 20:18:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-08 20:18:40] [INFO ] Load time of PNML (sax parser for PT used): 353 ms
[2022-06-08 20:18:41] [INFO ] Transformed 220 places.
[2022-06-08 20:18:41] [INFO ] Transformed 1212 transitions.
[2022-06-08 20:18:41] [INFO ] Found NUPN structural information;
[2022-06-08 20:18:41] [INFO ] Parsed PT model containing 220 places and 1212 transitions in 471 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 800 transitions
Reduce redundant transitions removed 800 transitions.
FORMULA StigmergyCommit-PT-05a-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-05a-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 7 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 14) seen :9
FORMULA StigmergyCommit-PT-05a-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-05a-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-05a-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-05a-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-05a-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-05a-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-05a-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-05a-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-05a-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2022-06-08 20:18:41] [INFO ] Flow matrix only has 394 transitions (discarded 18 similar events)
// Phase 1: matrix 394 rows 220 cols
[2022-06-08 20:18:41] [INFO ] Computed 7 place invariants in 28 ms
[2022-06-08 20:18:41] [INFO ] [Real]Absence check using 7 positive place invariants in 16 ms returned sat
[2022-06-08 20:18:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:18:42] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2022-06-08 20:18:42] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:18:42] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2022-06-08 20:18:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:18:42] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2022-06-08 20:18:42] [INFO ] State equation strengthened by 209 read => feed constraints.
[2022-06-08 20:18:42] [INFO ] [Nat]Added 209 Read/Feed constraints in 47 ms returned sat
[2022-06-08 20:18:42] [INFO ] Deduced a trap composed of 17 places in 188 ms of which 8 ms to minimize.
[2022-06-08 20:18:42] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 2 ms to minimize.
[2022-06-08 20:18:43] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 2 ms to minimize.
[2022-06-08 20:18:43] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 3 ms to minimize.
[2022-06-08 20:18:43] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 1 ms to minimize.
[2022-06-08 20:18:43] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 0 ms to minimize.
[2022-06-08 20:18:43] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 0 ms to minimize.
[2022-06-08 20:18:43] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2022-06-08 20:18:43] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2022-06-08 20:18:43] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2022-06-08 20:18:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 1278 ms
[2022-06-08 20:18:43] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2022-06-08 20:18:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:18:44] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2022-06-08 20:18:44] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:18:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2022-06-08 20:18:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:18:44] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2022-06-08 20:18:44] [INFO ] [Nat]Added 209 Read/Feed constraints in 60 ms returned sat
[2022-06-08 20:18:44] [INFO ] Deduced a trap composed of 17 places in 169 ms of which 1 ms to minimize.
[2022-06-08 20:18:44] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 2 ms to minimize.
[2022-06-08 20:18:44] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 1 ms to minimize.
[2022-06-08 20:18:44] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 1 ms to minimize.
[2022-06-08 20:18:45] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2022-06-08 20:18:45] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 1 ms to minimize.
[2022-06-08 20:18:45] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 1 ms to minimize.
[2022-06-08 20:18:45] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 1 ms to minimize.
[2022-06-08 20:18:45] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 0 ms to minimize.
[2022-06-08 20:18:45] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 0 ms to minimize.
[2022-06-08 20:18:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 1350 ms
[2022-06-08 20:18:45] [INFO ] [Real]Absence check using 7 positive place invariants in 12 ms returned sat
[2022-06-08 20:18:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:18:45] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2022-06-08 20:18:45] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:18:46] [INFO ] [Nat]Absence check using 7 positive place invariants in 13 ms returned sat
[2022-06-08 20:18:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:18:46] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2022-06-08 20:18:46] [INFO ] [Nat]Added 209 Read/Feed constraints in 47 ms returned sat
[2022-06-08 20:18:46] [INFO ] Deduced a trap composed of 18 places in 140 ms of which 1 ms to minimize.
[2022-06-08 20:18:46] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 1 ms to minimize.
[2022-06-08 20:18:46] [INFO ] Deduced a trap composed of 17 places in 169 ms of which 1 ms to minimize.
[2022-06-08 20:18:46] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 1 ms to minimize.
[2022-06-08 20:18:47] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 1 ms to minimize.
[2022-06-08 20:18:47] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2022-06-08 20:18:47] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 1 ms to minimize.
[2022-06-08 20:18:47] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
[2022-06-08 20:18:47] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 0 ms to minimize.
[2022-06-08 20:18:47] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2022-06-08 20:18:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 1359 ms
[2022-06-08 20:18:47] [INFO ] [Real]Absence check using 7 positive place invariants in 14 ms returned sat
[2022-06-08 20:18:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:18:48] [INFO ] [Real]Absence check using state equation in 259 ms returned sat
[2022-06-08 20:18:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:18:48] [INFO ] [Nat]Absence check using 7 positive place invariants in 16 ms returned sat
[2022-06-08 20:18:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:18:48] [INFO ] [Nat]Absence check using state equation in 240 ms returned sat
[2022-06-08 20:18:48] [INFO ] [Nat]Added 209 Read/Feed constraints in 76 ms returned sat
[2022-06-08 20:18:48] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 0 ms to minimize.
[2022-06-08 20:18:48] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 1 ms to minimize.
[2022-06-08 20:18:48] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 1 ms to minimize.
[2022-06-08 20:18:49] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 2 ms to minimize.
[2022-06-08 20:18:49] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 10 ms to minimize.
[2022-06-08 20:18:49] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 1 ms to minimize.
[2022-06-08 20:18:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 1014 ms
[2022-06-08 20:18:49] [INFO ] [Real]Absence check using 7 positive place invariants in 11 ms returned sat
[2022-06-08 20:18:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:18:49] [INFO ] [Real]Absence check using state equation in 288 ms returned sat
[2022-06-08 20:18:49] [INFO ] [Real]Added 209 Read/Feed constraints in 56 ms returned sat
[2022-06-08 20:18:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:18:50] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2022-06-08 20:18:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:18:50] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2022-06-08 20:18:50] [INFO ] [Nat]Added 209 Read/Feed constraints in 67 ms returned sat
[2022-06-08 20:18:50] [INFO ] Deduced a trap composed of 18 places in 195 ms of which 2 ms to minimize.
[2022-06-08 20:18:50] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 0 ms to minimize.
[2022-06-08 20:18:50] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 0 ms to minimize.
[2022-06-08 20:18:50] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 2 ms to minimize.
[2022-06-08 20:18:51] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 0 ms to minimize.
[2022-06-08 20:18:51] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 8 ms to minimize.
[2022-06-08 20:18:51] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 853 ms
[2022-06-08 20:18:51] [INFO ] Computed and/alt/rep : 248/314/248 causal constraints (skipped 145 transitions) in 104 ms.
[2022-06-08 20:18:53] [INFO ] Added : 242 causal constraints over 49 iterations in 2122 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
FORMULA StigmergyCommit-PT-05a-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-05a-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-05a-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-05a-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 1 different solutions.
Finished Parikh walk after 1526 steps, including 0 resets, run visited all 1 properties in 21 ms. (steps per millisecond=72 )
FORMULA StigmergyCommit-PT-05a-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1654719534717

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="StigmergyCommit-PT-05a"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is StigmergyCommit-PT-05a, 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 r305-smll-165463878400053"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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