Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r170-tall-167838857200421.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is FamilyReunion-PT-L00100M0010C005P005G002, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838857200421
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 42M
-rw-r--r-- 1 mcc users 290K Feb 26 13:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.8M Feb 26 13:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.1M Feb 26 12:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.7M Feb 26 12:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 170K Feb 25 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 700K Feb 25 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 327K Feb 25 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 869K Feb 25 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.3M Feb 26 15:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 7.3M Feb 26 15:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.7M Feb 26 14:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 5.8M Feb 26 14:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 27K Feb 25 16:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 81K Feb 25 16:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 24 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 17M Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-00
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-01
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-02
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-03
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-04
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-05
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-06
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-07
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-08
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-09
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-10
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-11
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-12
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-13
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-14
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678542161125

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-PT-L00100M0010C005P005G002
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 13:42:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-11 13:42:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 13:42:43] [INFO ] Load time of PNML (sax parser for PT used): 704 ms
[2023-03-11 13:42:43] [INFO ] Transformed 40605 places.
[2023-03-11 13:42:43] [INFO ] Transformed 36871 transitions.
[2023-03-11 13:42:43] [INFO ] Parsed PT model containing 40605 places and 36871 transitions and 112728 arcs in 970 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 511 ms.
Reduce places removed 31 places and 0 transitions.
// Phase 1: matrix 36871 rows 40574 cols
[2023-03-11 13:42:49] [INFO ] Computed 8805 place invariants in 5196 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 951 ms. (steps per millisecond=10 ) properties (out of 16) seen :134
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 14) seen :101
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 14) seen :101
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 14) seen :101
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 14) seen :102
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 14) seen :101
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 14) seen :101
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 14) seen :101
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 14) seen :101
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 14) seen :101
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :101
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :101
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :101
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 14) seen :101
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 14) seen :101
[2023-03-11 13:42:51] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, 210, -1, -1, 210, 1, 15, 2, 1, 1, 14] Max seen :[5, 4, 16, 101, 0, 5, 0, 0, 0, 1, 0, 0, 0, 0]
Support contains 2529 out of 40574 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40574/40574 places, 36871/36871 transitions.
Graph (complete) has 65258 edges and 40574 vertex of which 40328 are kept as prefixes of interest. Removing 246 places using SCC suffix rule.64 ms
Discarding 246 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Discarding 6665 places :
Implicit places reduction removed 6665 places
Drop transitions removed 17567 transitions
Trivial Post-agglo rules discarded 17567 transitions
Performed 17567 trivial Post agglomeration. Transition count delta: 17567
Iterating post reduction 0 with 24232 rules applied. Total rules applied 24233 place count 33663 transition count 19298
Reduce places removed 17567 places and 0 transitions.
Performed 1214 Post agglomeration using F-continuation condition.Transition count delta: 1214
Iterating post reduction 1 with 18781 rules applied. Total rules applied 43014 place count 16096 transition count 18084
Reduce places removed 1214 places and 0 transitions.
Iterating post reduction 2 with 1214 rules applied. Total rules applied 44228 place count 14882 transition count 18084
Performed 1515 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1515 Pre rules applied. Total rules applied 44228 place count 14882 transition count 16569
Deduced a syphon composed of 1515 places in 31 ms
Ensure Unique test removed 706 places
Reduce places removed 2221 places and 0 transitions.
Iterating global reduction 3 with 3736 rules applied. Total rules applied 47964 place count 12661 transition count 16569
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 605 transitions
Trivial Post-agglo rules discarded 605 transitions
Performed 605 trivial Post agglomeration. Transition count delta: 605
Iterating post reduction 3 with 606 rules applied. Total rules applied 48570 place count 12660 transition count 15964
Reduce places removed 605 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 606 rules applied. Total rules applied 49176 place count 12055 transition count 15963
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 49177 place count 12054 transition count 15963
Discarding 4443 places :
Symmetric choice reduction at 6 with 4443 rule applications. Total rules 53620 place count 7611 transition count 11318
Iterating global reduction 6 with 4443 rules applied. Total rules applied 58063 place count 7611 transition count 11318
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 201 places :
Implicit places reduction removed 201 places
Drop transitions removed 703 transitions
Trivial Post-agglo rules discarded 703 transitions
Performed 703 trivial Post agglomeration. Transition count delta: 703
Iterating post reduction 6 with 1409 rules applied. Total rules applied 59472 place count 7410 transition count 10110
Reduce places removed 703 places and 0 transitions.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Iterating post reduction 7 with 804 rules applied. Total rules applied 60276 place count 6707 transition count 10009
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 8 with 101 rules applied. Total rules applied 60377 place count 6606 transition count 10009
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 103 Pre rules applied. Total rules applied 60377 place count 6606 transition count 9906
Deduced a syphon composed of 103 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 9 with 207 rules applied. Total rules applied 60584 place count 6502 transition count 9906
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 60591 place count 6495 transition count 9199
Iterating global reduction 9 with 7 rules applied. Total rules applied 60598 place count 6495 transition count 9199
Ensure Unique test removed 504 transitions
Reduce isomorphic transitions removed 504 transitions.
Discarding 100 places :
Implicit places reduction removed 100 places
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Iterating post reduction 9 with 704 rules applied. Total rules applied 61302 place count 6395 transition count 8595
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 10 with 100 rules applied. Total rules applied 61402 place count 6295 transition count 8595
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 61404 place count 6293 transition count 8393
Iterating global reduction 11 with 2 rules applied. Total rules applied 61406 place count 6293 transition count 8393
Performed 506 Post agglomeration using F-continuation condition.Transition count delta: 506
Deduced a syphon composed of 506 places in 3 ms
Ensure Unique test removed 100 places
Reduce places removed 606 places and 0 transitions.
Iterating global reduction 11 with 1112 rules applied. Total rules applied 62518 place count 5687 transition count 7887
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 3 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 11 with 200 rules applied. Total rules applied 62718 place count 5587 transition count 7787
Free-agglomeration rule (complex) applied 203 times.
Iterating global reduction 11 with 203 rules applied. Total rules applied 62921 place count 5587 transition count 7584
Ensure Unique test removed 1 places
Reduce places removed 204 places and 0 transitions.
Iterating post reduction 11 with 204 rules applied. Total rules applied 63125 place count 5383 transition count 7584
Applied a total of 63125 rules in 6801 ms. Remains 5383 /40574 variables (removed 35191) and now considering 7584/36871 (removed 29287) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6803 ms. Remains : 5383/40574 places, 7584/36871 transitions.
// Phase 1: matrix 7584 rows 5383 cols
[2023-03-11 13:44:09] [INFO ] Computed 815 place invariants in 151 ms
Finished random walk after 403960 steps, including 356 resets, run visited all 14 properties in 30001 ms. (steps per millisecond=13 )
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 993496 steps, including 4 resets, run visited all 11 properties in 5001 ms. (steps per millisecond=198 )
Incomplete Best-First random walk after 1000001 steps, including 4 resets, run finished after 4920 ms. (steps per millisecond=203 ) properties (out of 11) seen :484
Finished Best-First random walk after 293659 steps, including 2 resets, run visited all 11 properties in 5011 ms. (steps per millisecond=58 )
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3477 ms. (steps per millisecond=287 ) properties (out of 11) seen :138
Interrupted Best-First random walk after 839455 steps, including 4 resets, run timeout after 5003 ms. (steps per millisecond=167 ) properties seen 354
Finished Best-First random walk after 451039 steps, including 2 resets, run visited all 11 properties in 5001 ms. (steps per millisecond=90 )
Incomplete Best-First random walk after 1000001 steps, including 5 resets, run finished after 4790 ms. (steps per millisecond=208 ) properties (out of 11) seen :361
Finished Best-First random walk after 818190 steps, including 4 resets, run visited all 11 properties in 5001 ms. (steps per millisecond=163 )
Incomplete Best-First random walk after 1000001 steps, including 4 resets, run finished after 3481 ms. (steps per millisecond=287 ) properties (out of 11) seen :361
Incomplete Best-First random walk after 1000001 steps, including 4 resets, run finished after 3474 ms. (steps per millisecond=287 ) properties (out of 11) seen :360
Incomplete Best-First random walk after 1000001 steps, including 4 resets, run finished after 3614 ms. (steps per millisecond=276 ) properties (out of 11) seen :357
[2023-03-11 13:45:28] [INFO ] Invariant cache hit.
[2023-03-11 13:45:28] [INFO ] [Real]Absence check using 0 positive and 815 generalized place invariants in 328 ms returned sat
[2023-03-11 13:45:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 13:45:30] [INFO ] [Real]Absence check using state equation in 1626 ms returned unsat
[2023-03-11 13:45:31] [INFO ] [Real]Absence check using 0 positive and 815 generalized place invariants in 287 ms returned sat
[2023-03-11 13:45:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 13:45:32] [INFO ] [Real]Absence check using state equation in 1692 ms returned unsat
[2023-03-11 13:45:33] [INFO ] [Real]Absence check using 0 positive and 815 generalized place invariants in 296 ms returned sat
[2023-03-11 13:45:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 13:45:35] [INFO ] [Real]Absence check using state equation in 1684 ms returned unsat
[2023-03-11 13:45:36] [INFO ] [Real]Absence check using 0 positive and 815 generalized place invariants in 307 ms returned sat
[2023-03-11 13:45:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 13:45:37] [INFO ] [Real]Absence check using state equation in 845 ms returned unsat
[2023-03-11 13:45:37] [INFO ] [Real]Absence check using 0 positive and 815 generalized place invariants in 283 ms returned sat
[2023-03-11 13:45:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 13:45:39] [INFO ] [Real]Absence check using state equation in 1990 ms returned unsat
[2023-03-11 13:45:40] [INFO ] [Real]Absence check using 0 positive and 815 generalized place invariants in 289 ms returned sat
[2023-03-11 13:45:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 13:45:42] [INFO ] [Real]Absence check using state equation in 1603 ms returned unsat
[2023-03-11 13:45:42] [INFO ] [Real]Absence check using 0 positive and 815 generalized place invariants in 291 ms returned sat
[2023-03-11 13:45:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 13:45:44] [INFO ] [Real]Absence check using state equation in 1843 ms returned unsat
[2023-03-11 13:45:45] [INFO ] [Real]Absence check using 0 positive and 815 generalized place invariants in 278 ms returned sat
[2023-03-11 13:45:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 13:45:48] [INFO ] [Real]Absence check using state equation in 2989 ms returned unsat
[2023-03-11 13:45:49] [INFO ] [Real]Absence check using 0 positive and 815 generalized place invariants in 274 ms returned sat
[2023-03-11 13:45:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 13:45:51] [INFO ] [Real]Absence check using state equation in 1990 ms returned unsat
[2023-03-11 13:45:51] [INFO ] [Real]Absence check using 0 positive and 815 generalized place invariants in 290 ms returned sat
[2023-03-11 13:45:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 13:45:54] [INFO ] [Real]Absence check using state equation in 2908 ms returned unsat
[2023-03-11 13:45:55] [INFO ] [Real]Absence check using 0 positive and 815 generalized place invariants in 290 ms returned sat
[2023-03-11 13:45:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 13:45:59] [INFO ] [Real]Absence check using state equation in 3821 ms returned unsat
Current structural bounds on expressions (after SMT) : [101, 101, 101, 101, 3, 101, 101, 3, 1, 1, 1] Max seen :[101, 101, 101, 101, 3, 101, 101, 3, 1, 1, 1]
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-07 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-06 101 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-05 101 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-04 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-03 101 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-02 101 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-01 101 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-00 101 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 196940 ms.
ITS solved all properties within timeout

BK_STOP 1678542360364

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -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="FamilyReunion-PT-L00100M0010C005P005G002"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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-5348"
echo " Executing tool marciexred"
echo " Input is FamilyReunion-PT-L00100M0010C005P005G002, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r170-tall-167838857200421"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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