About the Execution of GreatSPN+red for BlocksWorld-PT-16
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16100.844 | 3600000.00 | 4318374.00 | 9773.30 | ?????F?????F???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.r601-tall-171774424100284.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 greatspnxred
Input is BlocksWorld-PT-16, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r601-tall-171774424100284
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 86M
-rw-r--r-- 1 mcc users 2.2M Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 11M Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4M Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 18M Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 62K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 194K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 997K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 3.8M Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 1.9M Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 8.0M Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.1M Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 26M Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 8.7K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 19K Jun 7 06:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jun 7 06:26 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 7 06:26 instance
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 iscolored
-rw-r--r-- 1 mcc users 6.6M Jun 7 06:26 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 BlocksWorld-PT-16-LTLFireability-00
FORMULA_NAME BlocksWorld-PT-16-LTLFireability-01
FORMULA_NAME BlocksWorld-PT-16-LTLFireability-02
FORMULA_NAME BlocksWorld-PT-16-LTLFireability-03
FORMULA_NAME BlocksWorld-PT-16-LTLFireability-04
FORMULA_NAME BlocksWorld-PT-16-LTLFireability-05
FORMULA_NAME BlocksWorld-PT-16-LTLFireability-06
FORMULA_NAME BlocksWorld-PT-16-LTLFireability-07
FORMULA_NAME BlocksWorld-PT-16-LTLFireability-08
FORMULA_NAME BlocksWorld-PT-16-LTLFireability-09
FORMULA_NAME BlocksWorld-PT-16-LTLFireability-10
FORMULA_NAME BlocksWorld-PT-16-LTLFireability-11
FORMULA_NAME BlocksWorld-PT-16-LTLFireability-12
FORMULA_NAME BlocksWorld-PT-16-LTLFireability-13
FORMULA_NAME BlocksWorld-PT-16-LTLFireability-14
FORMULA_NAME BlocksWorld-PT-16-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717790260629
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BlocksWorld-PT-16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-07 19:57:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-07 19:57:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 19:57:42] [INFO ] Load time of PNML (sax parser for PT used): 550 ms
[2024-06-07 19:57:42] [INFO ] Transformed 6971 places.
[2024-06-07 19:57:42] [INFO ] Transformed 13613 transitions.
[2024-06-07 19:57:42] [INFO ] Found NUPN structural information;
[2024-06-07 19:57:42] [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, pred_on_table_67, pred_on_table_68, pred_on_table_69, pred_on_table_70, pred_on_table_71, pred_on_table_72, pred_on_table_73, pred_on_table_74, pred_on_table_75, pred_on_table_76, pred_on_table_77, pred_on_table_78, pred_on_table_79, pred_on_table_80, pred_on_table_81]
[2024-06-07 19:57:42] [INFO ] Parsed PT model containing 6971 places and 13613 transitions and 68044 arcs in 715 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 159 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA BlocksWorld-PT-16-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-16-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-16-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 6971 out of 6971 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6971/6971 places, 13613/13613 transitions.
Applied a total of 0 rules in 77 ms. Remains 6971 /6971 variables (removed 0) and now considering 13613/13613 (removed 0) transitions.
// Phase 1: matrix 13613 rows 6971 cols
[2024-06-07 19:57:44] [INFO ] Computed 165 invariants in 198 ms
[2024-06-07 19:57:45] [INFO ] Implicit Places using invariants in 1722 ms returned []
Implicit Place search using SMT only with invariants took 1761 ms to find 0 implicit places.
Running 13604 sub problems to find dead transitions.
[2024-06-07 19:57:46] [INFO ] Invariant cache hit.
[2024-06-07 19:57:46] [INFO ] State equation strengthened by 147 read => feed constraints.
Problem TDEAD1 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1326 is UNSAT
Problem TDEAD1409 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1658 is UNSAT
Problem TDEAD1824 is UNSAT
Problem TDEAD1907 is UNSAT
Problem TDEAD1990 is UNSAT
Problem TDEAD2073 is UNSAT
Problem TDEAD2156 is UNSAT
Problem TDEAD2239 is UNSAT
Problem TDEAD2322 is UNSAT
Problem TDEAD2405 is UNSAT
Problem TDEAD2488 is UNSAT
Problem TDEAD2571 is UNSAT
Problem TDEAD2654 is UNSAT
Problem TDEAD2737 is UNSAT
Problem TDEAD2820 is UNSAT
Problem TDEAD2903 is UNSAT
Problem TDEAD2986 is UNSAT
Problem TDEAD3069 is UNSAT
Problem TDEAD3152 is UNSAT
Problem TDEAD3235 is UNSAT
Problem TDEAD3318 is UNSAT
Problem TDEAD3401 is UNSAT
Problem TDEAD3484 is UNSAT
Problem TDEAD3567 is UNSAT
Problem TDEAD3650 is UNSAT
Problem TDEAD3733 is UNSAT
Problem TDEAD3816 is UNSAT
Problem TDEAD3899 is UNSAT
Problem TDEAD3982 is UNSAT
Problem TDEAD4065 is UNSAT
Problem TDEAD4148 is UNSAT
Problem TDEAD4231 is UNSAT
Problem TDEAD4314 is UNSAT
Problem TDEAD4397 is UNSAT
Problem TDEAD4480 is UNSAT
Problem TDEAD4563 is UNSAT
Problem TDEAD4646 is UNSAT
Problem TDEAD4729 is UNSAT
Problem TDEAD4812 is UNSAT
Problem TDEAD4895 is UNSAT
Problem TDEAD4978 is UNSAT
Problem TDEAD5061 is UNSAT
Problem TDEAD5144 is UNSAT
Problem TDEAD5227 is UNSAT
Problem TDEAD5310 is UNSAT
Problem TDEAD5393 is UNSAT
Problem TDEAD5476 is UNSAT
Problem TDEAD5725 is UNSAT
Problem TDEAD5808 is UNSAT
Problem TDEAD5891 is UNSAT
Problem TDEAD5974 is UNSAT
Problem TDEAD6140 is UNSAT
Problem TDEAD6306 is UNSAT
Problem TDEAD6389 is UNSAT
Problem TDEAD6472 is UNSAT
Problem TDEAD6555 is UNSAT
Problem TDEAD6638 is UNSAT
Problem TDEAD6887 is UNSAT
Problem TDEAD6970 is UNSAT
Problem TDEAD7132 is UNSAT
Problem TDEAD7450 is UNSAT
Problem TDEAD7606 is UNSAT
Problem TDEAD7760 is UNSAT
Problem TDEAD7912 is UNSAT
Problem TDEAD8062 is UNSAT
Problem TDEAD8210 is UNSAT
Problem TDEAD8356 is UNSAT
Problem TDEAD8500 is UNSAT
Problem TDEAD8642 is UNSAT
Problem TDEAD8782 is UNSAT
Problem TDEAD8920 is UNSAT
Problem TDEAD9056 is UNSAT
Problem TDEAD9190 is UNSAT
Problem TDEAD9452 is UNSAT
Problem TDEAD9706 is UNSAT
Problem TDEAD9830 is UNSAT
Problem TDEAD9952 is UNSAT
Problem TDEAD10072 is UNSAT
Problem TDEAD10190 is UNSAT
Problem TDEAD10306 is UNSAT
Problem TDEAD10420 is UNSAT
Problem TDEAD10532 is UNSAT
Problem TDEAD10642 is UNSAT
Problem TDEAD10750 is UNSAT
Problem TDEAD10856 is UNSAT
Problem TDEAD10960 is UNSAT
Problem TDEAD11062 is UNSAT
Problem TDEAD11162 is UNSAT
Problem TDEAD11260 is UNSAT
Problem TDEAD11356 is UNSAT
Problem TDEAD11450 is UNSAT
Problem TDEAD11542 is UNSAT
Problem TDEAD11632 is UNSAT
Problem TDEAD11720 is UNSAT
Problem TDEAD11806 is UNSAT
Problem TDEAD11890 is UNSAT
Problem TDEAD11972 is UNSAT
Problem TDEAD12052 is UNSAT
Problem TDEAD12130 is UNSAT
Problem TDEAD12206 is UNSAT
Problem TDEAD12280 is UNSAT
Problem TDEAD12352 is UNSAT
Problem TDEAD12422 is UNSAT
Problem TDEAD12490 is UNSAT
Problem TDEAD12556 is UNSAT
Problem TDEAD12620 is UNSAT
Problem TDEAD12682 is UNSAT
Problem TDEAD12742 is UNSAT
Problem TDEAD12800 is UNSAT
Problem TDEAD12856 is UNSAT
Problem TDEAD12910 is UNSAT
Problem TDEAD12962 is UNSAT
Problem TDEAD13012 is UNSAT
Problem TDEAD13060 is UNSAT
Problem TDEAD13106 is UNSAT
Problem TDEAD13150 is UNSAT
Problem TDEAD13192 is UNSAT
Problem TDEAD13232 is UNSAT
Problem TDEAD13270 is UNSAT
Problem TDEAD13372 is UNSAT
Problem TDEAD13402 is UNSAT
Problem TDEAD13430 is UNSAT
Problem TDEAD13456 is UNSAT
Problem TDEAD13502 is UNSAT
Problem TDEAD13540 is UNSAT
Problem TDEAD13556 is UNSAT
Problem TDEAD13570 is UNSAT
Problem TDEAD13582 is UNSAT
Problem TDEAD13592 is UNSAT
Problem TDEAD13610 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/6962 variables, 147/147 constraints. Problems are: Problem set: 146 solved, 13458 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6962/20584 variables, and 147 constraints, problems are : Problem set: 146 solved, 13458 unsolved in 30452 ms.
Refiners :[Positive P Invariants (semi-flows): 147/165 constraints, State Equation: 0/6971 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 13531/6807 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 146 solved, 13458 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6889 variables, 10/10 constraints. Problems are: Problem set: 146 solved, 13458 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6889/20584 variables, and 10 constraints, problems are : Problem set: 146 solved, 13458 unsolved in 30203 ms.
Refiners :[Positive P Invariants (semi-flows): 10/165 constraints, State Equation: 0/6971 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 6724/6807 constraints, Known Traps: 0/0 constraints]
After SMT, in 204693ms problems are : Problem set: 146 solved, 13458 unsolved
Search for dead transitions found 146 dead transitions in 204862ms
Found 146 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 146 transitions
Dead transitions reduction (with SMT) removed 146 transitions
Starting structural reductions in LTL mode, iteration 1 : 6971/6971 places, 13467/13613 transitions.
Deduced a syphon composed of 73 places in 6 ms
Applied a total of 0 rules in 52 ms. Remains 6971 /6971 variables (removed 0) and now considering 13467/13467 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 206854 ms. Remains : 6971/6971 places, 13467/13613 transitions.
Deduced a syphon composed of 73 places in 17 ms
Reduce places removed 73 places and 0 transitions.
Support contains 6898 out of 6898 places after structural reductions.
[2024-06-07 20:01:13] [INFO ] Flatten gal took : 1229 ms
[2024-06-07 20:01:18] [INFO ] Flatten gal took : 1032 ms
[2024-06-07 20:01:22] [INFO ] Input system was already deterministic with 13467 transitions.
Reduction of identical properties reduced properties to check from 24 to 19
RANDOM walk for 40000 steps (8 resets) in 9471 ms. (4 steps per ms) remains 1/19 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1351 ms. (29 steps per ms) remains 1/1 properties
// Phase 1: matrix 13467 rows 6898 cols
[2024-06-07 20:01:26] [INFO ] Computed 165 invariants in 111 ms
[2024-06-07 20:01:26] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6743/6817 variables, 148/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6817 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 81/6898 variables, 17/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6898 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20364/20365 variables, and 7063 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4667 ms.
Refiners :[Positive P Invariants (semi-flows): 165/165 constraints, State Equation: 6898/6898 constraints, ReadFeed: 0/19 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6743/6817 variables, 148/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6817 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 81/6898 variables, 17/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6898 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 20364/20365 variables, and 7063 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4819 ms.
Refiners :[Positive P Invariants (semi-flows): 165/165 constraints, State Equation: 6898/6898 constraints, ReadFeed: 0/19 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 9664ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 74 out of 6898 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6898/6898 places, 13467/13467 transitions.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running BlocksWorld-PT-16
IS_COLORED=
IS_NUPN=1
LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 6971
TRANSITIONS: 13613
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 68044
NUPN UNITS: 166
LOADING TIME: 97.162
SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.389
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 98.558
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: 575
MODEL NAME: /home/mcc/execution/model
6971 places, 13613 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
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 LTLFireability -timeout 360 -rebuildPNML
Error in allocating array of size 1178103172 at storage/ct_typebased.h, line 1565
MEDDLY ERROR: Insufficient memory
Error in allocating array of size 1178103172 at storage/ct_typebased.h, line 1565
MEDDLY ERROR: Insufficient memory
Error in allocating array of size 1178103172 at storage/ct_typebased.h, line 1565
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-16"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 greatspnxred"
echo " Input is BlocksWorld-PT-16, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r601-tall-171774424100284"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BlocksWorld-PT-16.tgz
mv BlocksWorld-PT-16 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;