About the Execution of 2023-gold for CloudDeployment-PT-5a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
569.415 | 21290.00 | 29641.00 | 380.50 | T | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r088-tall-171620523000366.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is CloudDeployment-PT-5a, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-tall-171620523000366
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 16:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Apr 11 16:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 11 16:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 11 16:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 230K May 18 16:42 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 ReachabilityDeadlock
=== Now, execution of the tool begins
BK_START 1716217401167
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=gold2023
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=CloudDeployment-PT-5a
Not applying reductions.
Model is PT
ReachabilityDeadlock PT
Running Version 202304061127
[2024-05-20 15:03:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-05-20 15:03:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 15:03:22] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2024-05-20 15:03:23] [INFO ] Transformed 180 places.
[2024-05-20 15:03:23] [INFO ] Transformed 675 transitions.
[2024-05-20 15:03:23] [INFO ] Found NUPN structural information;
[2024-05-20 15:03:23] [INFO ] Parsed PT model containing 180 places and 675 transitions and 3959 arcs in 370 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 3 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 80 transitions
Reduce redundant transitions removed 80 transitions.
Built sparse matrix representations for Structural reductions in 5 ms.26761KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 180/180 places, 595/595 transitions.
Graph (trivial) has 201 edges and 180 vertex of which 50 / 180 are part of one of the 15 SCC in 4 ms
Free SCC test removed 35 places
Ensure Unique test removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Computed a total of 100 stabilizing places and 345 stable transitions
Graph (complete) has 1567 edges and 145 vertex of which 134 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.7 ms
Discarding 11 places :
Also discarding 0 output transitions
Computed a total of 89 stabilizing places and 344 stable transitions
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 10 place count 126 transition count 457
Iterating global reduction 0 with 8 rules applied. Total rules applied 18 place count 126 transition count 457
Computed a total of 81 stabilizing places and 311 stable transitions
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 124 transition count 455
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 124 transition count 455
Computed a total of 79 stabilizing places and 309 stable transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 123 transition count 454
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 123 transition count 454
Computed a total of 78 stabilizing places and 308 stable transitions
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 54 place count 108 transition count 499
Computed a total of 63 stabilizing places and 353 stable transitions
Computed a total of 63 stabilizing places and 353 stable transitions
Drop transitions removed 130 transitions
Redundant transition composition rules discarded 130 transitions
Iterating global reduction 0 with 130 rules applied. Total rules applied 184 place count 108 transition count 369
Computed a total of 63 stabilizing places and 278 stable transitions
Computed a total of 63 stabilizing places and 278 stable transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 185 place count 107 transition count 368
Computed a total of 62 stabilizing places and 278 stable transitions
Computed a total of 62 stabilizing places and 278 stable transitions
Applied a total of 185 rules in 144 ms. Remains 107 /180 variables (removed 73) and now considering 368/595 (removed 227) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 144 ms. Remains : 107/180 places, 368/595 transitions.
Random walk for 1250000 steps, including 24516 resets, run took 2247 ms (no deadlock found). (steps per millisecond=556 )
Random directed walk for 1250000 steps, including 7503 resets, run took 2183 ms (no deadlock found). (steps per millisecond=572 )
[2024-05-20 15:03:27] [INFO ] Flow matrix only has 154 transitions (discarded 214 similar events)
// Phase 1: matrix 154 rows 107 cols
[2024-05-20 15:03:27] [INFO ] Computed 19 invariants in 5 ms
[2024-05-20 15:03:27] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 10 ms returned sat
[2024-05-20 15:03:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 15:03:27] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-05-20 15:03:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 15:03:28] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-20 15:03:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-20 15:03:28] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-05-20 15:03:28] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-20 15:03:28] [INFO ] [Nat]Added 6 Read/Feed constraints in 6 ms returned sat
[2024-05-20 15:03:28] [INFO ] Computed and/alt/rep : 114/207/114 causal constraints (skipped 13 transitions) in 14 ms.
[2024-05-20 15:03:28] [INFO ] Added : 64 causal constraints over 13 iterations in 204 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
Parikh directed walk for 7400 steps, including 170 resets, run took 23 ms. (steps per millisecond=321 )
Random directed walk for 500001 steps, including 3001 resets, run took 858 ms (no deadlock found). (steps per millisecond=582 )
Random walk for 500000 steps, including 9814 resets, run took 805 ms (no deadlock found). (steps per millisecond=621 )
Random directed walk for 500002 steps, including 3007 resets, run took 877 ms (no deadlock found). (steps per millisecond=570 )
Random walk for 500000 steps, including 9813 resets, run took 798 ms (no deadlock found). (steps per millisecond=626 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 107/107 places, 368/368 transitions.
Computed a total of 62 stabilizing places and 278 stable transitions
Computed a total of 62 stabilizing places and 278 stable transitions
Computed a total of 62 stabilizing places and 278 stable transitions
Applied a total of 0 rules in 13 ms. Remains 107 /107 variables (removed 0) and now considering 368/368 (removed 0) transitions.
[2024-05-20 15:03:31] [INFO ] Flow matrix only has 154 transitions (discarded 214 similar events)
[2024-05-20 15:03:31] [INFO ] Invariant cache hit.
[2024-05-20 15:03:31] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-20 15:03:31] [INFO ] Flow matrix only has 154 transitions (discarded 214 similar events)
[2024-05-20 15:03:31] [INFO ] Invariant cache hit.
[2024-05-20 15:03:31] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-20 15:03:32] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
[2024-05-20 15:03:32] [INFO ] Redundant transitions in 228 ms returned []
[2024-05-20 15:03:32] [INFO ] Flow matrix only has 154 transitions (discarded 214 similar events)
[2024-05-20 15:03:32] [INFO ] Invariant cache hit.
[2024-05-20 15:03:32] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 733 ms. Remains : 107/107 places, 368/368 transitions.
Random walk for 1250000 steps, including 24487 resets, run took 1986 ms (no deadlock found). (steps per millisecond=629 )
Random directed walk for 1250003 steps, including 7484 resets, run took 2009 ms (no deadlock found). (steps per millisecond=622 )
[2024-05-20 15:03:36] [INFO ] Flow matrix only has 154 transitions (discarded 214 similar events)
[2024-05-20 15:03:36] [INFO ] Invariant cache hit.
[2024-05-20 15:03:36] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-20 15:03:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 15:03:36] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-20 15:03:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 15:03:36] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-20 15:03:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-20 15:03:36] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-05-20 15:03:36] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-20 15:03:36] [INFO ] [Nat]Added 6 Read/Feed constraints in 6 ms returned sat
[2024-05-20 15:03:36] [INFO ] Computed and/alt/rep : 114/207/114 causal constraints (skipped 13 transitions) in 22 ms.
[2024-05-20 15:03:36] [INFO ] Added : 65 causal constraints over 13 iterations in 162 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
Parikh directed walk for 7400 steps, including 133 resets, run took 22 ms. (steps per millisecond=336 )
Random directed walk for 500000 steps, including 3003 resets, run took 878 ms (no deadlock found). (steps per millisecond=569 )
Random walk for 500000 steps, including 9788 resets, run took 821 ms (no deadlock found). (steps per millisecond=609 )
Random directed walk for 500000 steps, including 3008 resets, run took 884 ms (no deadlock found). (steps per millisecond=565 )
Random walk for 500000 steps, including 9777 resets, run took 830 ms (no deadlock found). (steps per millisecond=602 )
[2024-05-20 15:03:40] [INFO ] Flatten gal took : 80 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1479596046218155654
[2024-05-20 15:03:40] [INFO ] Applying decomposition
[2024-05-20 15:03:40] [INFO ] Computing symmetric may disable matrix : 595 transitions.
[2024-05-20 15:03:40] [INFO ] Flatten gal took : 40 ms
[2024-05-20 15:03:40] [INFO ] Computation of Complete disable matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 15:03:40] [INFO ] Computing symmetric may enable matrix : 595 transitions.
[2024-05-20 15:03:40] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph9005192474423517199.txt' '-o' '/tmp/graph9005192474423517199.bin' '-w' '/tmp/graph9005192474423517199.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9005192474423517199.bin' '-l' '-1' '-v' '-w' '/tmp/graph9005192474423517199.weights' '-q' '0' '-e' '0.001'
[2024-05-20 15:03:40] [INFO ] Decomposing Gal with order
[2024-05-20 15:03:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 15:03:40] [INFO ] Computing Do-Not-Accords matrix : 595 transitions.
[2024-05-20 15:03:40] [INFO ] Computation of Completed DNA matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 15:03:40] [INFO ] Built C files in 297ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1479596046218155654
Running compilation step : cd /tmp/ltsmin1479596046218155654;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-20 15:03:40] [INFO ] Removed a total of 614 redundant transitions.
[2024-05-20 15:03:40] [INFO ] Flatten gal took : 116 ms
[2024-05-20 15:03:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 143 labels/synchronizations in 16 ms.
[2024-05-20 15:03:40] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock10021609939908668183.gal : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityDeadlock10021609939908668183.gal' '-t' 'CGAL' '-ctl' 'DEADLOCK'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...235
No direction supplied, using forward translation only.
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,2.4883e+08,0.170906,10120,303,120,12838,833,868,18925,247,2310,0
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
dead,2,0.199359,10120,65,61,12838,833,2161,18925,1136,2310,7908
System contains 2 deadlocks (shown below if less than --print-limit option) !
FORMULA ReachabilityDeadlock TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[ i9={[ u47={[ ]
} u35={[ ]
} u34={[ ]
} ]
} i8={[ u33={[ ]
} u32={[ ]
} u31={[ ]
} u29={[ ]
} u30={[ ]
} ]
} i7={[ u46={[ ]
} u28={[ ]
} u27={[ ]
} ]
} i10={[ i1={[ u42={[ ]
} u41={[ ]
} ]
} i0={[ i1={[ u43={[ ]
} u40={[ ]
} u37={[ ]
} u36={[ ]
} ]
} i0={[ u39={[ ]
} u38={[ ]
} ]
} ]
} ]
} i6={[ u26={[ ]
} u25={[ ]
} u24={[ ]
} u22={[ ]
} u23={[ ]
} ]
} i5={[ u21={[ ]
} u20={[ ]
} u19={[ ]
} ]
} i3={[ u48={[ ]
} u45={[ ]
} u44={[ ]
} u14={[ ]
} u13={[ ]
} u7={[ ]
} ]
} i0={[ u6={[ ]
} u5={[ ]
} u0={[ ]
} ]
} i4={[ u18={[ ]
} u17={[ ]
} u15={[ ]
} u16={[ ]
} ]
} i2={[ u12={[ ]
} u11={[ ]
} u10={[ ]
} u8={[ ]
} u9={[ ]
} ]
} i1={[ u4={[ ]
} u3={[ ]
} u1={[ ]
} u2={[ ]
} ]
} ]
[ i9={[ u47={[ ]
} u35={[ p140=1 ]
} u34={[ ]
} ]
} i8={[ u33={[ ]
} u32={[ ]
} u31={[ ]
} u29={[ ]
} u30={[ ]
} ]
} i7={[ u46={[ ]
} u28={[ p112=1 ]
} u27={[ ]
} ]
} i10={[ i1={[ u42={[ ]
} u41={[ ]
} ]
} i0={[ i1={[ u43={[ p85=1 p87=1 p59=1 p113=1 p57=1 p115=1 p31=1 p141=1 p29=1 p3=1 p1=1 ]
} u40={[ ]
} u37={[ ]
} u36={[ ]
} ]
} i0={[ u39={[ ]
} u38={[ ]
} ]
} ]
} ]
} i6={[ u26={[ ]
} u25={[ ]
} u24={[ ]
} u22={[ ]
} u23={[ ]
} ]
} i5={[ u21={[ p84=1 ]
} u20={[ ]
} u19={[ ]
} ]
} i3={[ u48={[ ]
} u45={[ ]
} u44={[ ]
} u14={[ p56=1 ]
} u13={[ ]
} u7={[ ]
} ]
} i0={[ u6={[ p28=1 ]
} u5={[ ]
} u0={[ ]
} ]
} i4={[ u18={[ ]
} u17={[ ]
} u15={[ ]
} u16={[ ]
} ]
} i2={[ u12={[ ]
} u11={[ ]
} u10={[ ]
} u8={[ ]
} u9={[ ]
} ]
} i1={[ u4={[ ]
} u3={[ ]
} u1={[ ]
} u2={[ ]
} ]
} ]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 18554 ms.
BK_STOP 1716217422457
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityDeadlock = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityDeadlock -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
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="CloudDeployment-PT-5a"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is CloudDeployment-PT-5a, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r088-tall-171620523000366"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CloudDeployment-PT-5a.tgz
mv CloudDeployment-PT-5a execution
cd execution
if [ "ReachabilityDeadlock" = "ReachabilityDeadlock" ] || [ "ReachabilityDeadlock" = "UpperBounds" ] || [ "ReachabilityDeadlock" = "QuasiLiveness" ] || [ "ReachabilityDeadlock" = "StableMarking" ] || [ "ReachabilityDeadlock" = "Liveness" ] || [ "ReachabilityDeadlock" = "OneSafe" ] || [ "ReachabilityDeadlock" = "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 [ "ReachabilityDeadlock" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityDeadlock" != "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 "ReachabilityDeadlock.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityDeadlock.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityDeadlock.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 '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityDeadlock" = "ReachabilityDeadlock" ] || [ "ReachabilityDeadlock" = "QuasiLiveness" ] || [ "ReachabilityDeadlock" = "StableMarking" ] || [ "ReachabilityDeadlock" = "Liveness" ] || [ "ReachabilityDeadlock" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityDeadlock"
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 ;