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

About the Execution of ITS-Tools for StigmergyCommit-PT-02b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
348.168 17083.00 35685.00 190.10 FTTTFFFTFFTFTTTT 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-165463872400102.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 StigmergyCommit-PT-02b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463872400102
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 660K
-rw-r--r-- 1 mcc users 5.9K May 30 14:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 30 14:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 30 14:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 30 14:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 25 13:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 25 13:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 25 13:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 25 13:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 11K May 30 14:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K May 30 14:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 30 14:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K May 30 14:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 25 13:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 25 13:00 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 231K 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-02b-ReachabilityCardinality-00
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityCardinality-01
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityCardinality-02
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityCardinality-03
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityCardinality-04
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityCardinality-05
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityCardinality-06
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityCardinality-07
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityCardinality-08
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityCardinality-09
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityCardinality-10
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityCardinality-11
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityCardinality-12
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityCardinality-13
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityCardinality-14
FORMULA_NAME StigmergyCommit-PT-02b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654768043782

Running Version 202205111006
[2022-06-09 09:47:26] [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-09 09:47:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 09:47:26] [INFO ] Load time of PNML (sax parser for PT used): 309 ms
[2022-06-09 09:47:26] [INFO ] Transformed 928 places.
[2022-06-09 09:47:27] [INFO ] Transformed 1040 transitions.
[2022-06-09 09:47:27] [INFO ] Found NUPN structural information;
[2022-06-09 09:47:27] [INFO ] Parsed PT model containing 928 places and 1040 transitions in 597 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 206 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 164 resets, run finished after 1064 ms. (steps per millisecond=9 ) properties (out of 13) seen :2
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 11) seen :1
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 42 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 1040 rows 928 cols
[2022-06-09 09:47:29] [INFO ] Computed 4 place invariants in 43 ms
[2022-06-09 09:47:30] [INFO ] After 1031ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-06-09 09:47:31] [INFO ] [Nat]Absence check using 4 positive place invariants in 12 ms returned sat
[2022-06-09 09:47:32] [INFO ] After 1146ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :5
[2022-06-09 09:47:34] [INFO ] Deduced a trap composed of 397 places in 976 ms of which 14 ms to minimize.
[2022-06-09 09:47:35] [INFO ] Deduced a trap composed of 396 places in 618 ms of which 3 ms to minimize.
[2022-06-09 09:47:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1950 ms
[2022-06-09 09:47:35] [INFO ] After 3969ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :5
Attempting to minimize the solution found.
Minimization took 500 ms.
[2022-06-09 09:47:35] [INFO ] After 5031ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :5
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 5 different solutions.
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 1571 ms.
Support contains 48 out of 928 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 928/928 places, 1040/1040 transitions.
Graph (trivial) has 810 edges and 928 vertex of which 54 / 928 are part of one of the 7 SCC in 7 ms
Free SCC test removed 47 places
Drop transitions removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Graph (complete) has 1183 edges and 881 vertex of which 879 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 582 transitions
Trivial Post-agglo rules discarded 582 transitions
Performed 582 trivial Post agglomeration. Transition count delta: 582
Iterating post reduction 0 with 583 rules applied. Total rules applied 585 place count 879 transition count 397
Reduce places removed 582 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 590 rules applied. Total rules applied 1175 place count 297 transition count 389
Reduce places removed 3 places and 0 transitions.
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Iterating post reduction 2 with 42 rules applied. Total rules applied 1217 place count 294 transition count 350
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 3 with 39 rules applied. Total rules applied 1256 place count 255 transition count 350
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 40 Pre rules applied. Total rules applied 1256 place count 255 transition count 310
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 1336 place count 215 transition count 310
Discarding 33 places :
Symmetric choice reduction at 4 with 33 rule applications. Total rules 1369 place count 182 transition count 277
Iterating global reduction 4 with 33 rules applied. Total rules applied 1402 place count 182 transition count 277
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1404 place count 182 transition count 275
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1404 place count 182 transition count 274
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1406 place count 181 transition count 274
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 1417 place count 170 transition count 229
Iterating global reduction 5 with 11 rules applied. Total rules applied 1428 place count 170 transition count 229
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1430 place count 170 transition count 227
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1432 place count 168 transition count 225
Iterating global reduction 6 with 2 rules applied. Total rules applied 1434 place count 168 transition count 225
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1436 place count 166 transition count 223
Iterating global reduction 6 with 2 rules applied. Total rules applied 1438 place count 166 transition count 223
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1440 place count 166 transition count 221
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 1466 place count 153 transition count 208
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1469 place count 150 transition count 205
Iterating global reduction 7 with 3 rules applied. Total rules applied 1472 place count 150 transition count 205
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1473 place count 149 transition count 204
Iterating global reduction 7 with 1 rules applied. Total rules applied 1474 place count 149 transition count 204
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1475 place count 148 transition count 203
Iterating global reduction 7 with 1 rules applied. Total rules applied 1476 place count 148 transition count 203
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 1480 place count 146 transition count 217
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 1483 place count 146 transition count 214
Free-agglomeration rule applied 19 times.
Iterating global reduction 7 with 19 rules applied. Total rules applied 1502 place count 146 transition count 195
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 1521 place count 127 transition count 195
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1522 place count 126 transition count 194
Iterating global reduction 8 with 1 rules applied. Total rules applied 1523 place count 126 transition count 194
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 8 with 22 rules applied. Total rules applied 1545 place count 126 transition count 172
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 1548 place count 126 transition count 172
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1549 place count 126 transition count 171
Applied a total of 1549 rules in 221 ms. Remains 126 /928 variables (removed 802) and now considering 171/1040 (removed 869) transitions.
Finished structural reductions, in 1 iterations. Remains : 126/928 places, 171/1040 transitions.
Incomplete random walk after 1000000 steps, including 1204 resets, run finished after 1530 ms. (steps per millisecond=653 ) properties (out of 4) seen :3
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 2178 resets, run finished after 919 ms. (steps per millisecond=1088 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 171 rows 126 cols
[2022-06-09 09:47:40] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 09:47:40] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 09:47:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2022-06-09 09:47:40] [INFO ] After 140ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 09:47:40] [INFO ] State equation strengthened by 36 read => feed constraints.
[2022-06-09 09:47:40] [INFO ] After 29ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 09:47:40] [INFO ] Deduced a trap composed of 57 places in 101 ms of which 2 ms to minimize.
[2022-06-09 09:47:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2022-06-09 09:47:40] [INFO ] After 206ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2022-06-09 09:47:40] [INFO ] After 468ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
FORMULA StigmergyCommit-PT-02b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 1 ms.
All properties solved without resorting to model-checking.
Total runtime 14383 ms.

BK_STOP 1654768060865

--------------------
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="StigmergyCommit-PT-02b"
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 StigmergyCommit-PT-02b, 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-165463872400102"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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