fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r081-smll-158922977900420
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for GPPP-PT-C0001N0000000001

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15740.520 5148.00 11523.00 236.30 TTTFFFTTFTFFTTFF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 3.4K Apr 4 20:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 4 20:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 4 09:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 4 09:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 8 14:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 8 14:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 3 21:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 3 21:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.8K Apr 3 13:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 3 13:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 4 01:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 4 01:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 1 Mar 24 05:37 large_marking
-rw-r--r-- 1 mcc users 21K Mar 24 05:37 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 GPPP-PT-C0001N0000000001-CTLFireability-00
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLFireability-01
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLFireability-02
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLFireability-03
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLFireability-04
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLFireability-05
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLFireability-06
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLFireability-07
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLFireability-08
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLFireability-09
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLFireability-10
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLFireability-11
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLFireability-12
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLFireability-13
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLFireability-14
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1589744752353

[2020-05-17 19:45:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-17 19:45:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-17 19:45:54] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2020-05-17 19:45:54] [INFO ] Transformed 33 places.
[2020-05-17 19:45:54] [INFO ] Transformed 22 transitions.
[2020-05-17 19:45:54] [INFO ] Parsed PT model containing 33 places and 22 transitions in 96 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 21 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 297 ms. (steps per millisecond=336 ) properties seen :[1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 22 rows 33 cols
[2020-05-17 19:45:55] [INFO ] Computed 13 place invariants in 5 ms
[2020-05-17 19:45:55] [INFO ] [Real]Absence check using 6 positive place invariants in 17 ms returned sat
[2020-05-17 19:45:55] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned unsat
[2020-05-17 19:45:55] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2020-05-17 19:45:55] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned unsat
[2020-05-17 19:45:55] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2020-05-17 19:45:55] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2020-05-17 19:45:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 19:45:55] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2020-05-17 19:45:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-17 19:45:55] [INFO ] [Nat]Absence check using 6 positive place invariants in 10 ms returned sat
[2020-05-17 19:45:55] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 14 ms returned sat
[2020-05-17 19:45:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-17 19:45:55] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2020-05-17 19:45:55] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints in 5 ms.
[2020-05-17 19:45:55] [INFO ] Added : 21 causal constraints over 5 iterations in 47 ms. Result :sat
[2020-05-17 19:45:55] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2020-05-17 19:45:55] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 6 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-05-17 19:45:55] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-17 19:45:55] [INFO ] Flatten gal took : 52 ms
[2020-05-17 19:45:55] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-17 19:45:55] [INFO ] Flatten gal took : 15 ms
FORMULA GPPP-PT-C0001N0000000001-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000001-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000001-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000001-CTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000001-CTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000001-CTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-17 19:45:55] [INFO ] Applying decomposition
[2020-05-17 19:45:56] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph13125610476095523385.txt, -o, /tmp/graph13125610476095523385.bin, -w, /tmp/graph13125610476095523385.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph13125610476095523385.bin, -l, -1, -v, -w, /tmp/graph13125610476095523385.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-17 19:45:56] [INFO ] Decomposing Gal with order
[2020-05-17 19:45:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-17 19:45:56] [INFO ] Removed a total of 2 redundant transitions.
[2020-05-17 19:45:56] [INFO ] Flatten gal took : 56 ms
[2020-05-17 19:45:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2020-05-17 19:45:56] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 5 ms
[2020-05-17 19:45:56] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 3 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 10 CTL formulae.
built 8 ordering constraints for composite.
built 2 ordering constraints for composite.
built 10 ordering constraints for composite.
built 5 ordering constraints for composite.
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,10380,0.039317,5096,415,232,1677,617,129,1166,71,1087,0


Converting to forward existential form...Done !
original formula: EF((EF(((i1.u4.ATP>=7)&&(i2.u0.Lac>=7))) * ((((u3.DHAP>=1)||((u7.G6P>=1)&&(u7.b1>=3)))||((u8.Ru5P>=1)&&(u8.a1>=2)))||((i1.u5._3PG>=1)&&(u3.GAP<1)))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * ((((u3.DHAP>=1)||((u7.G6P>=1)&&(u7.b1>=3)))||((u8.Ru5P>=1)&&(u8.a1>=2)))||((i1.u5._3PG>=1)&&(u3.GAP<1)))),TRUE) * ((i1.u4.ATP>=7)&&(i2.u0.Lac>=7)))] != FALSE
(forward)formula 0,1,0.064013,5480,1,0,1861,627,270,1688,140,1522,4402
FORMULA GPPP-PT-C0001N0000000001-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AX((A(((u8.Xu5P>=1)&&(u3.E4P>=1)) U ((u8.Xu5P>=1)&&(u8.R5P>=1))) + EF(((i1.u4.ATP>=7)&&(i2.u0.Lac>=7)))))
=> equivalent forward existential formula: ([(FwdU((EY(Init) * !(E(TRUE U ((i1.u4.ATP>=7)&&(i2.u0.Lac>=7))))),!(((u8.Xu5P>=1)&&(u8.R5P>=1)))) * (!(((u8.Xu5P>=1)&&(u3.E4P>=1))) * !(((u8.Xu5P>=1)&&(u8.R5P>=1)))))] = FALSE * [FwdG((EY(Init) * !(E(TRUE U ((i1.u4.ATP>=7)&&(i2.u0.Lac>=7))))),!(((u8.Xu5P>=1)&&(u8.R5P>=1))))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions Transketolase2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/21/1/22
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
(forward)formula 1,1,0.136289,7592,1,0,5258,1918,678,6271,478,5042,13061
FORMULA GPPP-PT-C0001N0000000001-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF(AG(((((u3.DHAP>=1)&&(i1.u4.ATP>=7))&&(i2.u0.Lac>=7))||(((((i1.u4._1_3_BPG>=1)&&(i1.u4.ADP>=1))&&(i0.u1.NADPplus>=2))&&(u7.G6P>=1))&&(u7.b2>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((((u3.DHAP>=1)&&(i1.u4.ATP>=7))&&(i2.u0.Lac>=7))||(((((i1.u4._1_3_BPG>=1)&&(i1.u4.ADP>=1))&&(i0.u1.NADPplus>=2))&&(u7.G6P>=1))&&(u7.b2>=1)))))))] != FALSE
(forward)formula 2,0,0.143501,7592,1,0,5295,1918,710,6305,481,5044,13438
FORMULA GPPP-PT-C0001N0000000001-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: ((!(EX(((i1.u4._1_3_BPG>=1)&&(i1.u4.ADP>=1)))) * EF(((u8.Ru5P>=1)&&(u8.a1>=2)))) * EF(AG(((i0.u1.NADPH>=1)&&(i0.u2.GSSG>=1)))))
=> equivalent forward existential formula: (([(EY(Init) * ((i1.u4._1_3_BPG>=1)&&(i1.u4.ADP>=1)))] = FALSE * [(Init * !(E(TRUE U ((u8.Ru5P>=1)&&(u8.a1>=2)))))] = FALSE) * [(Init * !(E(TRUE U !(E(TRUE U !(((i0.u1.NADPH>=1)&&(i0.u2.GSSG>=1))))))))] = FALSE)
(forward)formula 3,0,0.147012,7856,1,0,5421,1919,719,6316,481,5044,13830
FORMULA GPPP-PT-C0001N0000000001-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF((((i0.u2.GSH>=2)&&(u7.G6P>=1))&&(u7.b1>=3)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (((i0.u2.GSH>=2)&&(u7.G6P>=1))&&(u7.b1>=3)))] != FALSE
(forward)formula 4,1,0.148324,7856,1,0,5425,1919,725,6331,481,5044,13855
FORMULA GPPP-PT-C0001N0000000001-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: !(E(AF((u3.GAP>=1)) U AG((u3.GAP>=1))))
=> equivalent forward existential formula: [(FwdU(Init,!(EG(!((u3.GAP>=1))))) * !(E(TRUE U !((u3.GAP>=1)))))] = FALSE
(forward)formula 5,1,0.150155,7856,1,0,5432,1947,726,6331,481,5057,13938
FORMULA GPPP-PT-C0001N0000000001-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EX(A((i0.u2.GSH>=2) U (u3.DHAP>=1)))
=> equivalent forward existential formula: [((EY(Init) * !(EG(!((u3.DHAP>=1))))) * !(E(!((u3.DHAP>=1)) U (!((i0.u2.GSH>=2)) * !((u3.DHAP>=1))))))] != FALSE
(forward)formula 6,0,0.304095,11816,1,0,18234,2193,749,15563,483,6947,33786
FORMULA GPPP-PT-C0001N0000000001-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(AG(EF(((u7.G6P>=1)&&(u7.b1>=3)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U ((u7.G6P>=1)&&(u7.b1>=3)))))))] != FALSE
(forward)formula 7,1,0.307506,12080,1,0,18288,2193,749,15632,483,6955,33966
FORMULA GPPP-PT-C0001N0000000001-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG(EX(((u7.G6P>=1)&&(u7.b1>=3))))
=> equivalent forward existential formula: [FwdG(Init,EX(((u7.G6P>=1)&&(u7.b1>=3))))] != FALSE
(forward)formula 8,0,0.308455,12080,1,0,18294,2193,752,15639,483,6955,33991
FORMULA GPPP-PT-C0001N0000000001-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: E(AG(((i0.u1.NADPH>=1)&&(i0.u2.GSSG>=1))) U EX(((u8.Xu5P<1)||(u8.R5P<1))))
=> equivalent forward existential formula: [(EY(FwdU(Init,!(E(TRUE U !(((i0.u1.NADPH>=1)&&(i0.u2.GSSG>=1))))))) * ((u8.Xu5P<1)||(u8.R5P<1)))] != FALSE
(forward)formula 9,1,0.310147,12344,1,0,18294,2193,760,15640,483,6955,33994
FORMULA GPPP-PT-C0001N0000000001-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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


BK_STOP 1589744757501

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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 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 r081-smll-158922977900420"
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 [ "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 ;