About the Execution of 2024-gold for BlocksWorld-PT-13
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15707.710 | 1800000.00 | 3602372.00 | 9104.80 | [undef] | Time out reached |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r028-smll-174853774500064.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is BlocksWorld-PT-13, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-smll-174853774500064
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.5M
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 406K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.2M May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 70K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 169K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 4.4M May 29 14:32 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 1748550199997
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=BlocksWorld-PT-13
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-29 20:23:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2025-05-29 20:23:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 20:23:23] [INFO ] Load time of PNML (sax parser for PT used): 937 ms
[2025-05-29 20:23:23] [INFO ] Transformed 4691 places.
[2025-05-29 20:23:23] [INFO ] Transformed 9113 transitions.
[2025-05-29 20:23:23] [INFO ] Found NUPN structural information;
[2025-05-29 20:23:23] [INFO ] Completing missing partition info from NUPN : creating a component with [pred_on_table_0, pred_arm_empty_0, pred_on_table_1, pred_on_table_2, pred_on_table_3, pred_on_table_4, pred_on_table_5, pred_on_table_6, pred_on_table_7, pred_on_table_8, pred_on_table_9, pred_on_table_10, pred_on_table_11, pred_on_table_12, pred_on_table_13, pred_on_table_14, pred_on_table_15, pred_on_table_16, pred_on_table_17, pred_on_table_18, pred_on_table_19, pred_on_table_20, pred_on_table_21, pred_on_table_22, pred_on_table_23, pred_on_table_24, pred_on_table_25, pred_on_table_26, pred_on_table_27, pred_on_table_28, pred_on_table_29, pred_on_table_30, pred_on_table_31, pred_on_table_32, pred_on_table_33, pred_on_table_34, pred_on_table_35, pred_on_table_36, pred_on_table_37, pred_on_table_38, pred_on_table_39, pred_on_table_40, pred_on_table_41, pred_on_table_42, pred_on_table_43, pred_on_table_44, pred_on_table_45, pred_on_table_46, pred_on_table_47, pred_on_table_48, pred_on_table_49, pred_on_table_50, pred_on_table_51, pred_on_table_52, pred_on_table_53, pred_on_table_54, pred_on_table_55, pred_on_table_56, pred_on_table_57, pred_on_table_58, pred_on_table_59, pred_on_table_60, pred_on_table_61, pred_on_table_62, pred_on_table_63, pred_on_table_64, pred_on_table_65, pred_on_table_66]
[2025-05-29 20:23:23] [INFO ] Parsed PT model containing 4691 places and 9113 transitions and 45542 arcs in 1248 ms.
Discarding 67 transitions out of 9113. Remains 9046
Built sparse matrix representations for Structural reductions in 48 ms.42328KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 4691/4691 places, 9113/9113 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 2474 ms. Remains 4691 /4691 variables (removed 0) and now considering 9113/9113 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 2516 ms. Remains : 4691/4691 places, 9113/9113 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 4691/4691 places, 9113/9113 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 1836 ms. Remains 4691 /4691 variables (removed 0) and now considering 9113/9113 (removed 0) transitions.
// Phase 1: matrix 9113 rows 4691 cols
[2025-05-29 20:23:29] [INFO ] Computed 135 invariants in 234 ms
[2025-05-29 20:23:31] [INFO ] Implicit Places using invariants in 1984 ms returned []
[2025-05-29 20:23:31] [INFO ] Invariant cache hit.
[2025-05-29 20:23:41] [INFO ] State equation strengthened by 119 read => feed constraints.
[2025-05-29 20:23:42] [INFO ] Implicit Places using invariants and state equation in 10920 ms returned []
Implicit Place search using SMT with State Equation took 12965 ms to find 0 implicit places.
[2025-05-29 20:23:44] [INFO ] Redundant transitions in 1670 ms returned []
Running 9105 sub problems to find dead transitions.
[2025-05-29 20:23:44] [INFO ] Invariant cache hit.
[2025-05-29 20:23:44] [INFO ] State equation strengthened by 119 read => feed constraints.
Problem TDEAD1 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1426 is UNSAT
Problem TDEAD1494 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1630 is UNSAT
Problem TDEAD1766 is UNSAT
Problem TDEAD1834 is UNSAT
Problem TDEAD1902 is UNSAT
Problem TDEAD1970 is UNSAT
Problem TDEAD2106 is UNSAT
Problem TDEAD2174 is UNSAT
Problem TDEAD2242 is UNSAT
Problem TDEAD2378 is UNSAT
Problem TDEAD2446 is UNSAT
Problem TDEAD2514 is UNSAT
Problem TDEAD2582 is UNSAT
Problem TDEAD2650 is UNSAT
Problem TDEAD2718 is UNSAT
Problem TDEAD2786 is UNSAT
Problem TDEAD2854 is UNSAT
Problem TDEAD2922 is UNSAT
Problem TDEAD2990 is UNSAT
Problem TDEAD3058 is UNSAT
Problem TDEAD3126 is UNSAT
Problem TDEAD3194 is UNSAT
Problem TDEAD3262 is UNSAT
Problem TDEAD3398 is UNSAT
Problem TDEAD3534 is UNSAT
Problem TDEAD3602 is UNSAT
Problem TDEAD3670 is UNSAT
Problem TDEAD3738 is UNSAT
Problem TDEAD3806 is UNSAT
Problem TDEAD3874 is UNSAT
Problem TDEAD3942 is UNSAT
Problem TDEAD4010 is UNSAT
Problem TDEAD4078 is UNSAT
Problem TDEAD4214 is UNSAT
Problem TDEAD4350 is UNSAT
Problem TDEAD4418 is UNSAT
Problem TDEAD4486 is UNSAT
Problem TDEAD4554 is UNSAT
Problem TDEAD4622 is UNSAT
Problem TDEAD4690 is UNSAT
Problem TDEAD4822 is UNSAT
Problem TDEAD4952 is UNSAT
Problem TDEAD5080 is UNSAT
Problem TDEAD5206 is UNSAT
Problem TDEAD5330 is UNSAT
Problem TDEAD5572 is UNSAT
Problem TDEAD5690 is UNSAT
Problem TDEAD5806 is UNSAT
Problem TDEAD5920 is UNSAT
Problem TDEAD6032 is UNSAT
Problem TDEAD6142 is UNSAT
Problem TDEAD6250 is UNSAT
Problem TDEAD6356 is UNSAT
Problem TDEAD6460 is UNSAT
Problem TDEAD6562 is UNSAT
Problem TDEAD6662 is UNSAT
Problem TDEAD6760 is UNSAT
Problem TDEAD6856 is UNSAT
Problem TDEAD6950 is UNSAT
Problem TDEAD7042 is UNSAT
Problem TDEAD7220 is UNSAT
Problem TDEAD7306 is UNSAT
Problem TDEAD7390 is UNSAT
Problem TDEAD7472 is UNSAT
Problem TDEAD7630 is UNSAT
Problem TDEAD7706 is UNSAT
Problem TDEAD7780 is UNSAT
Problem TDEAD7922 is UNSAT
Problem TDEAD7990 is UNSAT
Problem TDEAD8056 is UNSAT
Problem TDEAD8120 is UNSAT
Problem TDEAD8182 is UNSAT
Problem TDEAD8242 is UNSAT
Problem TDEAD8300 is UNSAT
Problem TDEAD8356 is UNSAT
Problem TDEAD8410 is UNSAT
Problem TDEAD8462 is UNSAT
Problem TDEAD8512 is UNSAT
Problem TDEAD8560 is UNSAT
Problem TDEAD8606 is UNSAT
Problem TDEAD8650 is UNSAT
Problem TDEAD8732 is UNSAT
Problem TDEAD8806 is UNSAT
Problem TDEAD8840 is UNSAT
Problem TDEAD8872 is UNSAT
Problem TDEAD8902 is UNSAT
Problem TDEAD8930 is UNSAT
Problem TDEAD8956 is UNSAT
Problem TDEAD8980 is UNSAT
Problem TDEAD9002 is UNSAT
Problem TDEAD9022 is UNSAT
Problem TDEAD9056 is UNSAT
Problem TDEAD9082 is UNSAT
Problem TDEAD9092 is UNSAT
Problem TDEAD9100 is UNSAT
Problem TDEAD9106 is UNSAT
Problem TDEAD9110 is UNSAT
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/4683 variables, 119/119 constraints. Problems are: Problem set: 118 solved, 8987 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4683/13804 variables, and 119 constraints, problems are : Problem set: 118 solved, 8987 unsolved in 30530 ms.
Refiners :[Positive P Invariants (semi-flows): 119/135 constraints, State Equation: 0/4691 constraints, ReadFeed: 0/119 constraints, PredecessorRefiner: 9046/4557 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 118 solved, 8987 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4624 variables, 9/9 constraints. Problems are: Problem set: 118 solved, 8987 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4624/13804 variables, and 9 constraints, problems are : Problem set: 118 solved, 8987 unsolved in 30312 ms.
Refiners :[Positive P Invariants (semi-flows): 9/135 constraints, State Equation: 0/4691 constraints, ReadFeed: 0/119 constraints, PredecessorRefiner: 4489/4557 constraints, Known Traps: 0/0 constraints]
After SMT, in 171121ms problems are : Problem set: 118 solved, 8987 unsolved
Search for dead transitions found 118 dead transitions in 171308ms
Found 118 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 118 transitions
Dead transitions reduction (with SMT) removed 118 transitions
Starting structural reductions in DEADLOCK mode, iteration 1 : 4691/4691 places, 8995/9113 transitions.
Computed a total of 59 stabilizing places and 0 stable transitions
Graph (complete) has 26050 edges and 4691 vertex of which 4632 are kept as prefixes of interest. Removing 59 places using SCC suffix rule.50 ms
Discarding 59 places :
Also discarding 0 output transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 1 rules in 2181 ms. Remains 4632 /4691 variables (removed 59) and now considering 8995/8995 (removed 0) transitions.
// Phase 1: matrix 8995 rows 4632 cols
[2025-05-29 20:26:37] [INFO ] Computed 135 invariants in 75 ms
[2025-05-29 20:26:38] [INFO ] Implicit Places using invariants in 1158 ms returned []
[2025-05-29 20:26:38] [INFO ] Invariant cache hit.
[2025-05-29 20:26:48] [INFO ] State equation strengthened by 17 read => feed constraints.
[2025-05-29 20:26:49] [INFO ] Implicit Places using invariants and state equation in 10092 ms returned []
Implicit Place search using SMT with State Equation took 11254 ms to find 0 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 2 : 4632/4691 places, 8995/9113 transitions.
Finished structural reductions in DEADLOCK mode , in 2 iterations and 201314 ms. Remains : 4632/4691 places, 8995/9113 transitions.
Interrupted Random walk after 276583 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=9 )
Interrupted Random directed walk after 353999 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=11 )
[2025-05-29 20:27:49] [INFO ] Invariant cache hit.
[2025-05-29 20:28:00] [INFO ] [Real]Absence check using 135 positive place invariants in 5253 ms returned sat
[2025-05-29 20:30:16] [INFO ] [Real]Absence check using state equation in 135991 ms returned sat
[2025-05-29 20:30:17] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:30:27] [INFO ] [Nat]Absence check using 135 positive place invariants in 2758 ms returned sat
[2025-05-29 20:34:48] [INFO ] [Nat]Absence check using state equation in 261454 ms returned sat
[2025-05-29 20:34:48] [INFO ] State equation strengthened by 17 read => feed constraints.
[2025-05-29 20:34:49] [INFO ] [Nat]Added 17 Read/Feed constraints in 236 ms returned sat
[2025-05-29 20:35:03] [INFO ] Deduced a trap composed of 134 places in 14516 ms of which 405 ms to minimize.
[2025-05-29 20:35:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 16881 ms
Starting structural reductions in LIVENESS mode, iteration 0 : 4691/4691 places, 9113/9113 transitions.
Applied a total of 0 rules in 85 ms. Remains 4691 /4691 variables (removed 0) and now considering 9113/9113 (removed 0) transitions.
// Phase 1: matrix 9113 rows 4691 cols
[2025-05-29 20:35:06] [INFO ] Computed 135 invariants in 86 ms
[2025-05-29 20:35:15] [INFO ] Implicit Places using invariants in 9449 ms returned []
[2025-05-29 20:35:15] [INFO ] Invariant cache hit.
[2025-05-29 20:35:24] [INFO ] State equation strengthened by 119 read => feed constraints.
[2025-05-29 20:35:56] [INFO ] Performed 3618/4691 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-05-29 20:36:02] [INFO ] Implicit Places using invariants and state equation in 46657 ms returned []
Implicit Place search using SMT with State Equation took 56111 ms to find 0 implicit places.
Running 9105 sub problems to find dead transitions.
[2025-05-29 20:36:02] [INFO ] Invariant cache hit.
[2025-05-29 20:36:02] [INFO ] State equation strengthened by 119 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running BlocksWorld-PT-13
IS_COLORED=
IS_NUPN=1
LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 4691
TRANSITIONS: 9113
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 45542
NUPN UNITS: 136
LOADING TIME: 59.313
SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.418
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 61.564
OK.
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 602
MODEL NAME: /home/mcc/execution/model
4691 places, 9113 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination Liveness -timeout 180 -rebuildPNML
Error in allocating array of size 16777216 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
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="BlocksWorld-PT-13"
export BK_EXAMINATION="Liveness"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is BlocksWorld-PT-13, 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 r028-smll-174853774500064"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BlocksWorld-PT-13.tgz
mv BlocksWorld-PT-13 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.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 [ "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 ;