fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r399-tall-171690530300418
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for Sudoku-COL-AN02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
300.428 4263.00 10280.00 62.50 FTFFTFTTFTTTFTTF normal

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-171690530300418.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-AN02, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690530300418
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 6.0K Apr 12 10:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 12 10:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 12 10:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 12 10:03 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.9K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 10:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Apr 12 10:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 12 10:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 10:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 08:00 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 6.5K 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-AN02-CTLFireability-2024-00
FORMULA_NAME Sudoku-COL-AN02-CTLFireability-2024-01
FORMULA_NAME Sudoku-COL-AN02-CTLFireability-2024-02
FORMULA_NAME Sudoku-COL-AN02-CTLFireability-2024-03
FORMULA_NAME Sudoku-COL-AN02-CTLFireability-2024-04
FORMULA_NAME Sudoku-COL-AN02-CTLFireability-2024-05
FORMULA_NAME Sudoku-COL-AN02-CTLFireability-2024-06
FORMULA_NAME Sudoku-COL-AN02-CTLFireability-2024-07
FORMULA_NAME Sudoku-COL-AN02-CTLFireability-2024-08
FORMULA_NAME Sudoku-COL-AN02-CTLFireability-2024-09
FORMULA_NAME Sudoku-COL-AN02-CTLFireability-2024-10
FORMULA_NAME Sudoku-COL-AN02-CTLFireability-2024-11
FORMULA_NAME Sudoku-COL-AN02-CTLFireability-2024-12
FORMULA_NAME Sudoku-COL-AN02-CTLFireability-2024-13
FORMULA_NAME Sudoku-COL-AN02-CTLFireability-2024-14
FORMULA_NAME Sudoku-COL-AN02-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717024917198

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 23:21:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 23:21:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 23:21:58] [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-29 23:21:58] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-29 23:21:58] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 463 ms
[2024-05-29 23:21:58] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 20 PT places and 8.0 transition bindings in 14 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 18 ms.
[2024-05-29 23:21:58] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 3 ms.
[2024-05-29 23:21:58] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 9 formulas.
FORMULA Sudoku-COL-AN02-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN02-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Remains 1 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 )
[2024-05-29 23:21:59] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-29 23:21:59] [INFO ] Flatten gal took : 11 ms
FORMULA Sudoku-COL-AN02-CTLFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 23:21:59] [INFO ] Flatten gal took : 1 ms
Domain [N(2), N(2)] of place Rows breaks symmetries in sort N
[2024-05-29 23:21:59] [INFO ] Unfolded HLPN to a Petri net with 20 places and 8 transitions 32 arcs in 9 ms.
[2024-05-29 23:21:59] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Sudoku-COL-AN02-CTLFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN02-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 12 transition count 8
Applied a total of 8 rules in 7 ms. Remains 12 /20 variables (removed 8) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 12 cols
[2024-05-29 23:21:59] [INFO ] Computed 5 invariants in 14 ms
[2024-05-29 23:21:59] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-29 23:21:59] [INFO ] Invariant cache hit.
[2024-05-29 23:21:59] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Starting structural reductions in LTL mode, iteration 1 : 12/20 places, 8/8 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 208 ms. Remains : 12/20 places, 8/8 transitions.
Support contains 12 out of 12 places after structural reductions.
[2024-05-29 23:21:59] [INFO ] Flatten gal took : 11 ms
[2024-05-29 23:21:59] [INFO ] Flatten gal took : 11 ms
[2024-05-29 23:21:59] [INFO ] Input system was already deterministic with 8 transitions.
Reduction of identical properties reduced properties to check from 9 to 3
RANDOM walk for 40000 steps (8910 resets) in 1056 ms. (37 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40002 steps (2221 resets) in 1399 ms. (28 steps per ms) remains 1/1 properties
[2024-05-29 23:22:00] [INFO ] Invariant cache hit.
Problem AtomicPropp2 is UNSAT
After SMT solving in domain Real declared 12/20 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 24 ms.
Refiners :[Generalized P Invariants (flows): 0/5 constraints, State Equation: 0/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 48ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
[2024-05-29 23:22:00] [INFO ] Flatten gal took : 7 ms
[2024-05-29 23:22:00] [INFO ] Flatten gal took : 9 ms
[2024-05-29 23:22:00] [INFO ] Input system was already deterministic with 8 transitions.
Computed a total of 12 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 12 transition count 8
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 12/12 places, 8/8 transitions.
[2024-05-29 23:22:00] [INFO ] Flatten gal took : 2 ms
[2024-05-29 23:22:00] [INFO ] Flatten gal took : 1 ms
[2024-05-29 23:22:00] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 12/12 places, 8/8 transitions.
[2024-05-29 23:22:00] [INFO ] Flatten gal took : 2 ms
[2024-05-29 23:22:00] [INFO ] Flatten gal took : 1 ms
[2024-05-29 23:22:00] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 12/12 places, 8/8 transitions.
[2024-05-29 23:22:00] [INFO ] Flatten gal took : 1 ms
[2024-05-29 23:22:00] [INFO ] Flatten gal took : 1 ms
[2024-05-29 23:22:00] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 12/12 places, 8/8 transitions.
[2024-05-29 23:22:00] [INFO ] Flatten gal took : 1 ms
[2024-05-29 23:22:00] [INFO ] Flatten gal took : 2 ms
[2024-05-29 23:22:00] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 12/12 places, 8/8 transitions.
[2024-05-29 23:22:00] [INFO ] Flatten gal took : 1 ms
[2024-05-29 23:22:00] [INFO ] Flatten gal took : 1 ms
[2024-05-29 23:22:00] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 0 ms. Remains : 12/12 places, 8/8 transitions.
[2024-05-29 23:22:00] [INFO ] Flatten gal took : 1 ms
[2024-05-29 23:22:00] [INFO ] Flatten gal took : 2 ms
[2024-05-29 23:22:00] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 12/12 places, 8/8 transitions.
[2024-05-29 23:22:00] [INFO ] Flatten gal took : 1 ms
[2024-05-29 23:22:00] [INFO ] Flatten gal took : 1 ms
[2024-05-29 23:22:00] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 12/12 places, 8/8 transitions.
[2024-05-29 23:22:00] [INFO ] Flatten gal took : 2 ms
[2024-05-29 23:22:00] [INFO ] Flatten gal took : 2 ms
[2024-05-29 23:22:00] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 12/12 places, 8/8 transitions.
[2024-05-29 23:22:00] [INFO ] Flatten gal took : 1 ms
[2024-05-29 23:22:00] [INFO ] Flatten gal took : 1 ms
[2024-05-29 23:22:00] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 12/12 places, 8/8 transitions.
[2024-05-29 23:22:00] [INFO ] Flatten gal took : 1 ms
[2024-05-29 23:22:00] [INFO ] Flatten gal took : 1 ms
[2024-05-29 23:22:00] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 12/12 places, 8/8 transitions.
[2024-05-29 23:22:00] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-29 23:22:00] [INFO ] Flatten gal took : 1 ms
FORMULA Sudoku-COL-AN02-CTLFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 23:22:00] [INFO ] Flatten gal took : 1 ms
[2024-05-29 23:22:00] [INFO ] Input system was already deterministic with 8 transitions.
Support contains 0 out of 12 places (down from 12) after GAL structural reductions.
[2024-05-29 23:22:00] [INFO ] Flatten gal took : 6 ms
[2024-05-29 23:22:00] [INFO ] Flatten gal took : 5 ms
[2024-05-29 23:22:00] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLFireability.sr.xml took 9 ms.
[2024-05-29 23:22:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 12 places, 8 transitions and 24 arcs took 2 ms.
Total runtime 2305 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Sudoku-COL-AN02

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 12
TRANSITIONS: 8
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, Sys 0.000s]


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 533
MODEL NAME: /home/mcc/execution/413/model
12 places, 8 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA Sudoku-COL-AN02-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Sudoku-COL-AN02-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Sudoku-COL-AN02-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Sudoku-COL-AN02-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Sudoku-COL-AN02-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Sudoku-COL-AN02-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Sudoku-COL-AN02-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Sudoku-COL-AN02-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Sudoku-COL-AN02-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Sudoku-COL-AN02-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717024921461

--------------------
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 CTLFireability -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-AN02"
export BK_EXAMINATION="CTLFireability"
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-AN02, examination is CTLFireability"
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-171690530300418"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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