fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r111-csrt-158961257800516
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for Parking-PT-104

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15742.960 5946.00 14360.00 99.90 TTTFTTFFTFTTFFFT normal

Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r111-csrt-158961257800516.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off 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 Parking-PT-104, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-csrt-158961257800516
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 196K
-rw-r--r-- 1 mcc users 3.2K Apr 11 23:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 11 23:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 10 22:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 12K Apr 10 22:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.9K Apr 14 12:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 14 12:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 10 07:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 10 07:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 9 11:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 9 11:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 10 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 10 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 23K 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 Parking-PT-104-CTLFireability-00
FORMULA_NAME Parking-PT-104-CTLFireability-01
FORMULA_NAME Parking-PT-104-CTLFireability-02
FORMULA_NAME Parking-PT-104-CTLFireability-03
FORMULA_NAME Parking-PT-104-CTLFireability-04
FORMULA_NAME Parking-PT-104-CTLFireability-05
FORMULA_NAME Parking-PT-104-CTLFireability-06
FORMULA_NAME Parking-PT-104-CTLFireability-07
FORMULA_NAME Parking-PT-104-CTLFireability-08
FORMULA_NAME Parking-PT-104-CTLFireability-09
FORMULA_NAME Parking-PT-104-CTLFireability-10
FORMULA_NAME Parking-PT-104-CTLFireability-11
FORMULA_NAME Parking-PT-104-CTLFireability-12
FORMULA_NAME Parking-PT-104-CTLFireability-13
FORMULA_NAME Parking-PT-104-CTLFireability-14
FORMULA_NAME Parking-PT-104-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1590000661980

[2020-05-20 18:51:05] [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-20 18:51:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-20 18:51:05] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2020-05-20 18:51:05] [INFO ] Transformed 65 places.
[2020-05-20 18:51:05] [INFO ] Transformed 97 transitions.
[2020-05-20 18:51:05] [INFO ] Found NUPN structural information;
[2020-05-20 18:51:05] [INFO ] Parsed PT model containing 65 places and 97 transitions in 102 ms.
Ensure Unique test removed 41 transitions
Reduce redundant transitions removed 41 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 19 ms.
Incomplete random walk after 100000 steps, including 5954 resets, run finished after 227 ms. (steps per millisecond=440 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1]
// Phase 1: matrix 56 rows 65 cols
[2020-05-20 18:51:05] [INFO ] Computed 16 place invariants in 5 ms
[2020-05-20 18:51:05] [INFO ] [Real]Absence check using 15 positive place invariants in 53 ms returned sat
[2020-05-20 18:51:05] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-20 18:51:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:51:05] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2020-05-20 18:51:05] [INFO ] State equation strengthened by 12 read => feed constraints.
[2020-05-20 18:51:05] [INFO ] [Real]Added 12 Read/Feed constraints in 4 ms returned sat
[2020-05-20 18:51:05] [INFO ] Computed and/alt/rep : 55/191/55 causal constraints in 7 ms.
[2020-05-20 18:51:05] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:51:05] [INFO ] [Nat]Absence check using 15 positive place invariants in 21 ms returned sat
[2020-05-20 18:51:05] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-20 18:51:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:51:06] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2020-05-20 18:51:06] [INFO ] [Nat]Added 12 Read/Feed constraints in 3 ms returned sat
[2020-05-20 18:51:06] [INFO ] Computed and/alt/rep : 55/191/55 causal constraints in 8 ms.
[2020-05-20 18:51:06] [INFO ] Added : 54 causal constraints over 11 iterations in 350 ms. Result :sat
[2020-05-20 18:51:06] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2020-05-20 18:51:06] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 2 ms returned unsat
[2020-05-20 18:51:06] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2020-05-20 18:51:06] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-05-20 18:51:06] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-20 18:51:06] [INFO ] Flatten gal took : 46 ms
[2020-05-20 18:51:06] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-20 18:51:06] [INFO ] Flatten gal took : 11 ms
FORMULA Parking-PT-104-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-104-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-20 18:51:06] [INFO ] Applying decomposition
[2020-05-20 18:51:06] [INFO ] Flatten gal took : 9 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/graph2370747847082791307.txt, -o, /tmp/graph2370747847082791307.bin, -w, /tmp/graph2370747847082791307.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/graph2370747847082791307.bin, -l, -1, -v, -w, /tmp/graph2370747847082791307.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-20 18:51:06] [INFO ] Decomposing Gal with order
[2020-05-20 18:51:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-20 18:51:06] [INFO ] Removed a total of 2 redundant transitions.
[2020-05-20 18:51:07] [INFO ] Flatten gal took : 59 ms
[2020-05-20 18:51:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2020-05-20 18:51:07] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 4 ms
[2020-05-20 18:51:07] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 1 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 14 CTL formulae.
built 19 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 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,31745,0.035815,5144,92,112,736,1595,178,687,87,2571,0


Converting to forward existential form...Done !
original formula: EF(AX(((i3.u6.p14==1)&&(i3.u12.p42==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(((i3.u6.p14==1)&&(i3.u12.p42==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t92, t93, t94, t95, u18.t4, u18.t6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/50/6/56
(forward)formula 0,1,0.054768,5852,1,0,1968,1595,666,2140,477,2575,5002
FORMULA Parking-PT-104-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AX(EG(((u18.p29!=1)||(u18.p64!=1))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(((u18.p29!=1)||(u18.p64!=1)))))] = FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 1,1,0.131335,9548,1,0,10674,1741,878,11256,510,4116,22674
FORMULA Parking-PT-104-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG(EX(((i2.u2.p6==1)||(u11.p36==1))))
=> equivalent forward existential formula: [FwdG(Init,EX(((i2.u2.p6==1)||(u11.p36==1))))] != FALSE
(forward)formula 2,1,0.1809,11924,1,0,16606,1854,884,17353,510,5669,32803
FORMULA Parking-PT-104-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF((u13.p45==1))
=> equivalent forward existential formula: [FwdG(Init,!((u13.p45==1)))] = FALSE
(forward)formula 3,0,0.193413,12452,1,0,17004,2748,1021,17936,522,7532,34447
FORMULA Parking-PT-104-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: E((u13.p44!=1) U ((i2.u2.p6==1)&&(i2.u9.p27==1)))
=> equivalent forward existential formula: [(FwdU(Init,(u13.p44!=1)) * ((i2.u2.p6==1)&&(i2.u9.p27==1)))] != FALSE
(forward)formula 4,1,0.194478,12716,1,0,17024,2748,1034,17966,523,7534,34576
FORMULA Parking-PT-104-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EX((EF(((i4.u4.p10==1)&&(i4.u10.p34==1))) * (i3.u6.p14==1)))
=> equivalent forward existential formula: [(FwdU((EY(Init) * (i3.u6.p14==1)),TRUE) * ((i4.u4.p10==1)&&(i4.u10.p34==1)))] != FALSE
(forward)formula 5,1,0.196388,12716,1,0,17107,2748,1048,18090,523,7540,34851
FORMULA Parking-PT-104-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (A(AX((u11.p36==1)) U AF(((i2.u2.p5==1)&&(i4.u16.p55==1)))) * A(EG(((u18.p29==1)&&(u18.p64==1))) U EF((i2.u9.p28==1))))
=> equivalent forward existential formula: [(((Init * !((E(!(!(EG(!(((i2.u2.p5==1)&&(i4.u16.p55==1)))))) U (!(!(EX(!((u11.p36==1))))) * !(!(EG(!(((i2.u2.p5==1)&&(i4.u16.p55==1)))))))) + EG(!(!(EG(!(((i2.u2.p5==1)&&(i4.u16.p55==1)))))))))) * !(EG(!(E(TRUE U (i2.u9.p28==1)))))) * !(E(!(E(TRUE U (i2.u9.p28==1))) U (!(EG(((u18.p29==1)&&(u18.p64==1)))) * !(E(TRUE U (i2.u9.p28==1)))))))] != FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 6,0,0.411139,21956,1,0,37978,3043,1210,40033,543,8945,76501
FORMULA Parking-PT-104-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(EX(!(AF((i0.u8.p20==1)))))
=> equivalent forward existential formula: [FwdG(EY(Init),!((i0.u8.p20==1)))] = FALSE
(forward)formula 7,0,0.416466,22220,1,0,38295,3043,1244,40421,543,8954,77641
FORMULA Parking-PT-104-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: A(EG(((u13.p44==1)||((i7.u5.p12==1)&&(i7.u15.p52==1)))) U EG((u13.p44!=1)))
=> equivalent forward existential formula: [((Init * !(EG(!(EG((u13.p44!=1)))))) * !(E(!(EG((u13.p44!=1))) U (!(EG(((u13.p44==1)||((i7.u5.p12==1)&&(i7.u15.p52==1))))) * !(EG((u13.p44!=1)))))))] != FALSE
Using saturation style SCC detection
(forward)formula 8,1,0.448776,23804,1,0,41572,3052,1277,43357,543,9069,84228
FORMULA Parking-PT-104-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG(EX(((i0.u8.p20!=1)&&((u13.p45==1)||((u17.p24==1)&&(u17.p59==1))))))
=> equivalent forward existential formula: [FwdG(Init,EX(((i0.u8.p20!=1)&&((u13.p45==1)||((u17.p24==1)&&(u17.p59==1))))))] != FALSE
(forward)formula 9,0,0.454164,23804,1,0,42122,3052,1290,43779,546,9069,85936
FORMULA Parking-PT-104-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(EG((((u18.p61==1)||(i1.u3.p8==1))||((u18.p30==1)&&(u18.p63==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(((u18.p61==1)||(i1.u3.p8==1))||((u18.p30==1)&&(u18.p63==1))))] != FALSE
(forward)formula 10,1,0.464097,24068,1,0,42838,3079,1332,44682,552,9380,87846
FORMULA Parking-PT-104-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG((u11.p36!=1))
=> equivalent forward existential formula: [FwdG(Init,(u11.p36!=1))] != FALSE
(forward)formula 11,1,0.467146,24332,1,0,42957,3079,1345,44820,552,9390,88184
FORMULA Parking-PT-104-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (!(EG((u13.p45!=1))) + AG((i0.u8.p20==1)))
=> equivalent forward existential formula: [(FwdU((Init * !(!(EG((u13.p45!=1))))),TRUE) * !((i0.u8.p20==1)))] = FALSE
(forward)formula 12,0,0.478703,24596,1,0,43803,3080,1354,45568,552,9393,90040
FORMULA Parking-PT-104-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: E((AG((i0.u8.p20==1)) + ((u13.p44!=1)&&((i7.u7.p15!=1)||(u17.p47!=1)))) U !(AF((i0.u8.p20==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,(!(E(TRUE U !((i0.u8.p20==1)))) + ((u13.p44!=1)&&((i7.u7.p15!=1)||(u17.p47!=1))))),!((i0.u8.p20==1)))] != FALSE
(forward)formula 13,1,0.525464,26180,1,0,47798,3100,1366,49296,554,9683,98085
FORMULA Parking-PT-104-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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


BK_STOP 1590000667926

--------------------
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="Parking-PT-104"
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 Parking-PT-104, 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 r111-csrt-158961257800516"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Parking-PT-104.tgz
mv Parking-PT-104 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 ;