Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r109-smll-162075343900104.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is GPPP-PT-C0001N0000000001, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r109-smll-162075343900104
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 126K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 88K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Mar 28 16:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 28 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 28 16:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 11:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 23 11:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.8K Mar 22 19:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 22 19:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 17 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1 May 5 16:51 large_marking
-rw-r--r-- 1 mcc users 21K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1620892111956

Running Version 0
[2021-05-13 07:48:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2021-05-13 07:48:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 07:48:35] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2021-05-13 07:48:35] [INFO ] Transformed 33 places.
[2021-05-13 07:48:35] [INFO ] Transformed 22 transitions.
[2021-05-13 07:48:35] [INFO ] Parsed PT model containing 33 places and 22 transitions in 126 ms.
Discarding 1 transitions out of 22. Remains 21
Built sparse matrix representations for Structural reductions in 8 ms.14893KB memory used
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 21 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2021-05-13 07:48:35] [INFO ] Computed 13 place invariants in 12 ms
[2021-05-13 07:48:36] [INFO ] Dead Transitions using invariants and state equation in 335 ms returned []
Finished structural reductions, in 1 iterations. Remains : 33/33 places, 22/22 transitions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 7 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2021-05-13 07:48:36] [INFO ] Computed 13 place invariants in 7 ms
[2021-05-13 07:48:36] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-13 07:48:36] [INFO ] Computed 13 place invariants in 17 ms
[2021-05-13 07:48:36] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2021-05-13 07:48:36] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-13 07:48:36] [INFO ] Computed 13 place invariants in 3 ms
[2021-05-13 07:48:36] [INFO ] Dead Transitions using invariants and state equation in 68 ms returned []
Finished structural reductions, in 1 iterations. Remains : 33/33 places, 22/22 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1571 ms (no deadlock found). (steps per millisecond=795 )
Random directed walk for 1250000 steps, including 0 resets, run took 1058 ms (no deadlock found). (steps per millisecond=1181 )
// Phase 1: matrix 22 rows 33 cols
[2021-05-13 07:48:39] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-13 07:48:39] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-13 07:48:39] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2021-05-13 07:48:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 07:48:39] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2021-05-13 07:48:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 07:48:39] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-13 07:48:39] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 17 ms returned unsat
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 7 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 19
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 30 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 27 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 25 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 24 transition count 15
Applied a total of 15 rules in 22 ms. Remains 24 /33 variables (removed 9) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 24 cols
[2021-05-13 07:48:39] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-13 07:48:39] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
// Phase 1: matrix 15 rows 24 cols
[2021-05-13 07:48:39] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-13 07:48:39] [INFO ] Implicit Places using invariants in 53 ms returned [0, 3, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 56 ms to find 3 implicit places.
// Phase 1: matrix 15 rows 21 cols
[2021-05-13 07:48:39] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-13 07:48:39] [INFO ] Dead Transitions using invariants and state equation in 60 ms returned []
Starting structural reductions, iteration 1 : 21/33 places, 15/22 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 17 transition count 12
Applied a total of 7 rules in 4 ms. Remains 17 /21 variables (removed 4) and now considering 12/15 (removed 3) transitions.
// Phase 1: matrix 12 rows 17 cols
[2021-05-13 07:48:39] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-13 07:48:39] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 12 rows 17 cols
[2021-05-13 07:48:39] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-13 07:48:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-13 07:48:39] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 17/33 places, 12/22 transitions.
Discarding 1 transitions out of 12. Remains 11
[2021-05-13 07:48:39] [INFO ] Initial state test concluded for 1 properties.
Finished random walk after 31 steps, including 0 resets, run visited all 10 properties in 1 ms. (steps per millisecond=31 )
Able to resolve query QuasiLiveness after proving 11 properties.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 30 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 27 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 25 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 24 transition count 15
Applied a total of 15 rules in 20 ms. Remains 24 /33 variables (removed 9) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 24 cols
[2021-05-13 07:48:39] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-13 07:48:39] [INFO ] Dead Transitions using invariants and state equation in 71 ms returned []
// Phase 1: matrix 15 rows 24 cols
[2021-05-13 07:48:39] [INFO ] Computed 11 place invariants in 8 ms
[2021-05-13 07:48:39] [INFO ] Implicit Places using invariants in 104 ms returned [0, 3, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 105 ms to find 3 implicit places.
// Phase 1: matrix 15 rows 21 cols
[2021-05-13 07:48:39] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-13 07:48:39] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Starting structural reductions, iteration 1 : 21/33 places, 15/22 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 17 transition count 12
Applied a total of 7 rules in 2 ms. Remains 17 /21 variables (removed 4) and now considering 12/15 (removed 3) transitions.
// Phase 1: matrix 12 rows 17 cols
[2021-05-13 07:48:39] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-13 07:48:40] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 12 rows 17 cols
[2021-05-13 07:48:40] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-13 07:48:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-13 07:48:40] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 17/33 places, 12/22 transitions.
Discarding 1 transitions out of 12. Remains 11
[2021-05-13 07:48:40] [INFO ] Flatten gal took : 45 ms
[2021-05-13 07:48:40] [INFO ] Flatten gal took : 13 ms
[2021-05-13 07:48:40] [INFO ] Time to serialize gal into /tmp/CTLFireability13513669436275256733.gal : 11 ms
[2021-05-13 07:48:40] [INFO ] Time to serialize properties into /tmp/CTLFireability7437033490233309873.ctl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability13513669436275256733.gal, -t, CGAL, -ctl, /tmp/CTLFireability7437033490233309873.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability13513669436275256733.gal -t CGAL -ctl /tmp/CTLFireability7437033490233309873.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 11 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,85,0.018571,4240,2,231,5,708,6,0,86,479,0


Converting to forward existential form...Done !
original formula: AG(EF(((G6P>=1)&&(b1>=3))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((G6P>=1)&&(b1>=3)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions Transketolase2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/11/1/12
(forward)formula 0,1,0.049141,5220,1,0,30,2624,42,16,599,1905,35
Formula is TRUE !

***************************************

original formula: AG(EF(((ATP>=1)&&(Gluc>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((ATP>=1)&&(Gluc>=1)))))] = FALSE
(forward)formula 1,1,0.059482,5484,1,0,32,2703,43,18,599,1983,41
Formula is TRUE !

***************************************

original formula: AG(EF(((Ru5P>=1)&&(a2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Ru5P>=1)&&(a2>=1)))))] = FALSE
(forward)formula 2,1,0.064186,5484,1,0,34,3157,44,20,599,2480,47
Formula is TRUE !

***************************************

original formula: AG(EF(((Ru5P>=1)&&(a1>=2))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Ru5P>=1)&&(a1>=2)))))] = FALSE
(forward)formula 3,1,0.067436,5484,1,0,35,3404,45,21,599,2764,53
Formula is TRUE !

***************************************

original formula: AG(EF((((S7P>=1)&&(DHAP>=1))&&(c1>=7))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((S7P>=1)&&(DHAP>=1))&&(c1>=7)))))] = FALSE
(forward)formula 4,1,0.069645,5484,1,0,36,3468,46,22,600,2832,59
Formula is TRUE !

***************************************

original formula: AG(EF(((Xu5P>=1)&&(E4P>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Xu5P>=1)&&(E4P>=1)))))] = FALSE
(forward)formula 5,1,0.070783,5484,1,0,36,3468,47,22,600,2832,61
Formula is TRUE !

***************************************

original formula: AG(EF(((Xu5P>=1)&&(R5P>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Xu5P>=1)&&(R5P>=1)))))] = FALSE
(forward)formula 6,1,0.072714,5484,1,0,37,3563,48,23,600,2921,67
Formula is TRUE !

***************************************

original formula: AG(EF(((ATP>=1)&&(F6P>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((ATP>=1)&&(F6P>=1)))))] = FALSE
(forward)formula 7,1,0.074855,5484,1,0,38,3658,49,24,600,3017,73
Formula is TRUE !

***************************************

original formula: AG(EF(((G6P>=1)&&(b2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((G6P>=1)&&(b2>=1)))))] = FALSE
(forward)formula 8,1,0.080473,5484,1,0,40,4082,50,26,600,3524,79
Formula is TRUE !

***************************************

original formula: AG(EF(((ATP>=7)&&(Lac>=7))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((ATP>=7)&&(Lac>=7)))))] = FALSE
(forward)formula 9,1,0.082031,5748,1,0,41,4101,51,27,600,3538,85
Formula is TRUE !

***************************************

original formula: AG(EF(((DHAP>=1)&&(c2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((DHAP>=1)&&(c2>=1)))))] = FALSE
(forward)formula 10,1,0.083831,5748,1,0,42,4116,52,28,600,3555,91
Formula is TRUE !

***************************************

Able to resolve query Liveness after proving 11 properties.
FORMULA Liveness TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

BK_STOP 1620892122067

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ Liveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution Liveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination Liveness -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="GPPP-PT-C0001N0000000001"
export BK_EXAMINATION="Liveness"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is GPPP-PT-C0001N0000000001, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r109-smll-162075343900104"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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