fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r289-tajo-171654445900406
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for PolyORBNT-COL-S10J20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
439.983 7740.00 18555.00 52.70 TFTTFTTTTFTTFTFF normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r289-tajo-171654445900406.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBNT-COL-S10J20, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445900406
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 8.2K Apr 12 11:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 12 11:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 12 11:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 11:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 12 13:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 12 13:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 12 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 12 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 92K 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 PolyORBNT-COL-S10J20-ReachabilityCardinality-2024-00
FORMULA_NAME PolyORBNT-COL-S10J20-ReachabilityCardinality-2024-01
FORMULA_NAME PolyORBNT-COL-S10J20-ReachabilityCardinality-2024-02
FORMULA_NAME PolyORBNT-COL-S10J20-ReachabilityCardinality-2024-03
FORMULA_NAME PolyORBNT-COL-S10J20-ReachabilityCardinality-2024-04
FORMULA_NAME PolyORBNT-COL-S10J20-ReachabilityCardinality-2024-05
FORMULA_NAME PolyORBNT-COL-S10J20-ReachabilityCardinality-2024-06
FORMULA_NAME PolyORBNT-COL-S10J20-ReachabilityCardinality-2024-07
FORMULA_NAME PolyORBNT-COL-S10J20-ReachabilityCardinality-2024-08
FORMULA_NAME PolyORBNT-COL-S10J20-ReachabilityCardinality-2024-09
FORMULA_NAME PolyORBNT-COL-S10J20-ReachabilityCardinality-2024-10
FORMULA_NAME PolyORBNT-COL-S10J20-ReachabilityCardinality-2024-11
FORMULA_NAME PolyORBNT-COL-S10J20-ReachabilityCardinality-2024-12
FORMULA_NAME PolyORBNT-COL-S10J20-ReachabilityCardinality-2024-13
FORMULA_NAME PolyORBNT-COL-S10J20-ReachabilityCardinality-2024-14
FORMULA_NAME PolyORBNT-COL-S10J20-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716880812480

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S10J20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 07:20:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 07:20:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 07:20:14] [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-28 07:20:14] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 07:20:14] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 667 ms
[2024-05-28 07:20:14] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 494 PT places and 11822.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 36 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 07:20:14] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 5 ms.
[2024-05-28 07:20:14] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40004 steps (2281 resets) in 1139 ms. (35 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4004 steps (97 resets) in 66 ms. (59 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4005 steps (80 resets) in 60 ms. (65 steps per ms) remains 13/15 properties
BEST_FIRST walk for 4002 steps (63 resets) in 87 ms. (45 steps per ms) remains 12/13 properties
BEST_FIRST walk for 4000 steps (85 resets) in 31 ms. (125 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4001 steps (101 resets) in 47 ms. (83 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (100 resets) in 27 ms. (143 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4001 steps (101 resets) in 13 ms. (285 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (94 resets) in 13 ms. (286 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4002 steps (81 resets) in 21 ms. (181 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (96 resets) in 12 ms. (308 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (86 resets) in 12 ms. (308 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (76 resets) in 37 ms. (105 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (73 resets) in 39 ms. (100 steps per ms) remains 12/12 properties
// Phase 1: matrix 38 rows 48 cols
[2024-05-28 07:20:15] [INFO ] Computed 13 invariants in 8 ms
[2024-05-28 07:20:15] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem PolyORBNT-COL-S10J20-ReachabilityCardinality-2024-05 is UNSAT
Problem PolyORBNT-COL-S10J20-ReachabilityCardinality-2024-08 is UNSAT
Problem PolyORBNT-COL-S10J20-ReachabilityCardinality-2024-10 is UNSAT
Problem PolyORBNT-COL-S10J20-ReachabilityCardinality-2024-14 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 5/5 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 6/11 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/11 constraints. Problems are: Problem set: 4 solved, 8 unsolved
Problem PolyORBNT-COL-S10J20-ReachabilityCardinality-2024-03 is UNSAT
Problem PolyORBNT-COL-S10J20-ReachabilityCardinality-2024-07 is UNSAT
At refinement iteration 3 (OVERLAPS) 1/48 variables, 1/12 constraints. Problems are: Problem set: 6 solved, 6 unsolved
Problem PolyORBNT-COL-S10J20-ReachabilityCardinality-2024-00 is UNSAT
Problem PolyORBNT-COL-S10J20-ReachabilityCardinality-2024-06 is UNSAT
Problem PolyORBNT-COL-S10J20-ReachabilityCardinality-2024-11 is UNSAT
Problem PolyORBNT-COL-S10J20-ReachabilityCardinality-2024-12 is UNSAT
Problem PolyORBNT-COL-S10J20-ReachabilityCardinality-2024-15 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/13 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/13 constraints. Problems are: Problem set: 11 solved, 1 unsolved
Problem PolyORBNT-COL-S10J20-ReachabilityCardinality-2024-02 is UNSAT
After SMT solving in domain Real declared 86/86 variables, and 61 constraints, problems are : Problem set: 12 solved, 0 unsolved in 405 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 48/48 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 514ms problems are : Problem set: 12 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-05-28 07:20:16] [INFO ] Flatten gal took : 36 ms
[2024-05-28 07:20:16] [INFO ] Flatten gal took : 7 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 PolyORBNT-COL-S10J20-ReachabilityCardinality-2024-00 TRUE TECHNIQUES CPN_APPROX
FORMULA PolyORBNT-COL-S10J20-ReachabilityCardinality-2024-02 TRUE TECHNIQUES CPN_APPROX
FORMULA PolyORBNT-COL-S10J20-ReachabilityCardinality-2024-03 TRUE TECHNIQUES CPN_APPROX
FORMULA PolyORBNT-COL-S10J20-ReachabilityCardinality-2024-05 TRUE TECHNIQUES CPN_APPROX
FORMULA PolyORBNT-COL-S10J20-ReachabilityCardinality-2024-06 TRUE TECHNIQUES CPN_APPROX
FORMULA PolyORBNT-COL-S10J20-ReachabilityCardinality-2024-07 TRUE TECHNIQUES CPN_APPROX
FORMULA PolyORBNT-COL-S10J20-ReachabilityCardinality-2024-08 TRUE TECHNIQUES CPN_APPROX
FORMULA PolyORBNT-COL-S10J20-ReachabilityCardinality-2024-10 TRUE TECHNIQUES CPN_APPROX
FORMULA PolyORBNT-COL-S10J20-ReachabilityCardinality-2024-11 TRUE TECHNIQUES CPN_APPROX
FORMULA PolyORBNT-COL-S10J20-ReachabilityCardinality-2024-12 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBNT-COL-S10J20-ReachabilityCardinality-2024-14 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBNT-COL-S10J20-ReachabilityCardinality-2024-15 FALSE TECHNIQUES CPN_APPROX
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-28 07:20:16] [INFO ] Unfolded HLPN to a Petri net with 494 places and 11780 transitions 111159 arcs in 259 ms.
[2024-05-28 07:20:16] [INFO ] Unfolded 16 HLPN properties in 1 ms.
Deduced a syphon composed of 20 places in 30 ms
Reduce places removed 20 places and 20 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
RANDOM walk for 40000 steps (2236 resets) in 2065 ms. (19 steps per ms) remains 3/4 properties
FORMULA PolyORBNT-COL-S10J20-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (136 resets) in 546 ms. (73 steps per ms) remains 1/3 properties
FORMULA PolyORBNT-COL-S10J20-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S10J20-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (419 resets) in 171 ms. (232 steps per ms) remains 1/1 properties
[2024-05-28 07:20:17] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
// Phase 1: matrix 1641 rows 474 cols
[2024-05-28 07:20:17] [INFO ] Computed 72 invariants in 119 ms
[2024-05-28 07:20:17] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 168/170 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 44/214 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 210/424 variables, 21/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 36/460 variables, 18/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/472 variables, 7/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/472 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/473 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/473 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1641/2114 variables, 473/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2114 variables, 1/546 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2114 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/2115 variables, 1/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2115 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2115 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2115/2115 variables, and 547 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1096 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 474/474 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 168/170 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 44/214 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 210/424 variables, 21/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 36/460 variables, 18/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/472 variables, 7/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/472 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/473 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/473 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1641/2114 variables, 473/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2114 variables, 1/546 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2114 variables, 1/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2114 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/2115 variables, 1/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2115 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/2115 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2115/2115 variables, and 548 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1338 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 474/474 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2591ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
FORMULA PolyORBNT-COL-S10J20-ReachabilityCardinality-2024-04 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 30 ms.
All properties solved without resorting to model-checking.
Total runtime 6203 ms.
ITS solved all properties within timeout

BK_STOP 1716880820220

--------------------
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="PolyORBNT-COL-S10J20"
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 PolyORBNT-COL-S10J20, 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 r289-tajo-171654445900406"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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