Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r399-tall-171690530600558.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is Sudoku-COL-BN09, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690530600558
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 7.0K Apr 12 12:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 12 12:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 12 11:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 11:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 12:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 12 12:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 12 12:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 12 12:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 08:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 146K May 18 16:43 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 Sudoku-COL-BN09-ReachabilityCardinality-2024-00
FORMULA_NAME Sudoku-COL-BN09-ReachabilityCardinality-2024-01
FORMULA_NAME Sudoku-COL-BN09-ReachabilityCardinality-2024-02
FORMULA_NAME Sudoku-COL-BN09-ReachabilityCardinality-2024-03
FORMULA_NAME Sudoku-COL-BN09-ReachabilityCardinality-2024-04
FORMULA_NAME Sudoku-COL-BN09-ReachabilityCardinality-2024-05
FORMULA_NAME Sudoku-COL-BN09-ReachabilityCardinality-2024-06
FORMULA_NAME Sudoku-COL-BN09-ReachabilityCardinality-2024-07
FORMULA_NAME Sudoku-COL-BN09-ReachabilityCardinality-2024-08
FORMULA_NAME Sudoku-COL-BN09-ReachabilityCardinality-2024-09
FORMULA_NAME Sudoku-COL-BN09-ReachabilityCardinality-2024-10
FORMULA_NAME Sudoku-COL-BN09-ReachabilityCardinality-2024-11
FORMULA_NAME Sudoku-COL-BN09-ReachabilityCardinality-2024-12
FORMULA_NAME Sudoku-COL-BN09-ReachabilityCardinality-2024-13
FORMULA_NAME Sudoku-COL-BN09-ReachabilityCardinality-2024-14
FORMULA_NAME Sudoku-COL-BN09-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717052820103

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-BN09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 07:07:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-30 07:07:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 07:07:01] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-30 07:07:01] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 07:07:01] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 608 ms
[2024-05-30 07:07:02] [INFO ] Imported 5 HL places and 1 HL transitions for a total of 1053 PT places and 6561.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
FORMULA Sudoku-COL-BN09-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 07:07:02] [INFO ] Built PT skeleton of HLPN with 5 places and 1 transitions 5 arcs in 3 ms.
[2024-05-30 07:07:02] [INFO ] Skeletonized 15 HLPN properties in 1 ms.
Remains 15 properties that can be checked using skeleton over-approximation.
Computed a total of 5 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 1
RANDOM walk for 40168 steps (480 resets) in 186 ms. (214 steps per ms) remains 3/15 properties
BEST_FIRST walk for 40168 steps (480 resets) in 52 ms. (757 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40168 steps (480 resets) in 67 ms. (590 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40168 steps (480 resets) in 120 ms. (331 steps per ms) remains 3/3 properties
// Phase 1: matrix 1 rows 5 cols
[2024-05-30 07:07:02] [INFO ] Computed 4 invariants in 3 ms
Problem Sudoku-COL-BN09-ReachabilityCardinality-2024-04 is UNSAT
Problem Sudoku-COL-BN09-ReachabilityCardinality-2024-13 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/6 variables, 5/9 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 0/6 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6/6 variables, and 9 constraints, problems are : Problem set: 2 solved, 1 unsolved in 156 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/5 variables, 1/4 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/6 variables, 5/9 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6 variables, 1/10 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/6 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6/6 variables, and 10 constraints, problems are : Problem set: 2 solved, 1 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 234ms problems are : Problem set: 2 solved, 1 unsolved
Finished Parikh walk after 15 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
Parikh walk visited 1 properties in 14 ms.
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-05-30 07:07:02] [INFO ] Flatten gal took : 13 ms
[2024-05-30 07:07:02] [INFO ] Flatten gal took : 1 ms
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
FORMULA Sudoku-COL-BN09-ReachabilityCardinality-2024-04 FALSE TECHNIQUES CPN_APPROX
FORMULA Sudoku-COL-BN09-ReachabilityCardinality-2024-13 FALSE TECHNIQUES CPN_APPROX
Domain [N(9), N(9)] of place Rows breaks symmetries in sort N
[2024-05-30 07:07:02] [INFO ] Unfolded HLPN to a Petri net with 1053 places and 729 transitions 3645 arcs in 43 ms.
[2024-05-30 07:07:02] [INFO ] Unfolded 15 HLPN properties in 3 ms.
RANDOM walk for 40000 steps (601 resets) in 4210 ms. (9 steps per ms) remains 2/13 properties
FORMULA Sudoku-COL-BN09-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-COL-BN09-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-COL-BN09-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-COL-BN09-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-COL-BN09-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-COL-BN09-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-COL-BN09-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-COL-BN09-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-COL-BN09-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-COL-BN09-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-COL-BN09-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 1177 ms. (33 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 386 ms. (103 steps per ms) remains 2/2 properties
// Phase 1: matrix 729 rows 1053 cols
[2024-05-30 07:07:04] [INFO ] Computed 324 invariants in 23 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/972 variables, 243/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/972 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 81/1053 variables, 81/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1053 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 729/1782 variables, 1053/1377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1782 variables, 0/1377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1782/1782 variables, and 1377 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3098 ms.
Refiners :[Positive P Invariants (semi-flows): 324/324 constraints, State Equation: 1053/1053 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/972 variables, 243/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/972 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 81/1053 variables, 81/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1053 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 729/1782 variables, 1053/1377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1782/1782 variables, and 1379 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5005 ms.
Refiners :[Positive P Invariants (semi-flows): 324/324 constraints, State Equation: 1053/1053 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 8607ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 972 out of 1053 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 37 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 1053/1053 places, 729/729 transitions.
RANDOM walk for 40000 steps (601 resets) in 2715 ms. (14 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1031 ms. (38 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 253 ms. (157 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 286969 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :0 out of 2
Probabilistic random walk after 286969 steps, saw 75647 distinct states, run finished after 3004 ms. (steps per millisecond=95 ) properties seen :0
[2024-05-30 07:07:17] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/972 variables, 243/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/972 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 81/1053 variables, 81/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1053 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 729/1782 variables, 1053/1377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1782 variables, 0/1377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/1782 variables, 0/1377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1782/1782 variables, and 1377 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2707 ms.
Refiners :[Positive P Invariants (semi-flows): 324/324 constraints, State Equation: 1053/1053 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/972 variables, 243/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/972 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 81/1053 variables, 81/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1053 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 729/1782 variables, 1053/1377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1782 variables, 2/1379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1782 variables, 0/1379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/1782 variables, 0/1379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1782/1782 variables, and 1379 constraints, problems are : Problem set: 0 solved, 2 unsolved in 26679 ms.
Refiners :[Positive P Invariants (semi-flows): 324/324 constraints, State Equation: 1053/1053 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 29715ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 77 steps, including 0 resets, run visited all 2 properties in 8 ms. (steps per millisecond=9 )
FORMULA Sudoku-COL-BN09-ReachabilityCardinality-2024-11 FALSE TECHNIQUES PARIKH_WALK
FORMULA Sudoku-COL-BN09-ReachabilityCardinality-2024-06 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 8 ms.
All properties solved without resorting to model-checking.
Total runtime 45489 ms.
ITS solved all properties within timeout

BK_STOP 1717052866811

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML

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="Sudoku-COL-BN09"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is Sudoku-COL-BN09, 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 r399-tall-171690530600558"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-BN09.tgz
mv Sudoku-COL-BN09 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 ;