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.r311-tall-171662336100206.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 RERS17pb114-PT-3, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-171662336100206
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 73M
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 19 07:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 18:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 73M May 18 16:43 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 RERS17pb114-PT-3-ReachabilityCardinality-2024-00
FORMULA_NAME RERS17pb114-PT-3-ReachabilityCardinality-2024-01
FORMULA_NAME RERS17pb114-PT-3-ReachabilityCardinality-2024-02
FORMULA_NAME RERS17pb114-PT-3-ReachabilityCardinality-2024-03
FORMULA_NAME RERS17pb114-PT-3-ReachabilityCardinality-2024-04
FORMULA_NAME RERS17pb114-PT-3-ReachabilityCardinality-2024-05
FORMULA_NAME RERS17pb114-PT-3-ReachabilityCardinality-2024-06
FORMULA_NAME RERS17pb114-PT-3-ReachabilityCardinality-2024-07
FORMULA_NAME RERS17pb114-PT-3-ReachabilityCardinality-2024-08
FORMULA_NAME RERS17pb114-PT-3-ReachabilityCardinality-2023-09
FORMULA_NAME RERS17pb114-PT-3-ReachabilityCardinality-2024-10
FORMULA_NAME RERS17pb114-PT-3-ReachabilityCardinality-2023-11
FORMULA_NAME RERS17pb114-PT-3-ReachabilityCardinality-2024-12
FORMULA_NAME RERS17pb114-PT-3-ReachabilityCardinality-2023-13
FORMULA_NAME RERS17pb114-PT-3-ReachabilityCardinality-2023-14
FORMULA_NAME RERS17pb114-PT-3-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716707308520

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RERS17pb114-PT-3
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 07:08:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-26 07:08:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 07:08:31] [INFO ] Load time of PNML (sax parser for PT used): 2087 ms
[2024-05-26 07:08:32] [INFO ] Transformed 1446 places.
[2024-05-26 07:08:32] [INFO ] Transformed 151085 transitions.
[2024-05-26 07:08:32] [INFO ] Parsed PT model containing 1446 places and 151085 transitions and 604252 arcs in 2673 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 7685 ms. (5 steps per ms) remains 7/16 properties
FORMULA RERS17pb114-PT-3-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb114-PT-3-ReachabilityCardinality-2023-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb114-PT-3-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb114-PT-3-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb114-PT-3-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb114-PT-3-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb114-PT-3-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb114-PT-3-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb114-PT-3-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 538 ms. (74 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 518 ms. (77 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 663 ms. (60 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 372 ms. (107 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 352 ms. (113 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 840 ms. (47 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 397 ms. (100 steps per ms) remains 7/7 properties
[2024-05-26 07:08:36] [INFO ] Flow matrix only has 84691 transitions (discarded 66394 similar events)
// Phase 1: matrix 84691 rows 1446 cols
[2024-05-26 07:08:37] [INFO ] Computed 35 invariants in 509 ms
[2024-05-26 07:08:42] [INFO ] State equation strengthened by 2342 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 139/221 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem RERS17pb114-PT-3-ReachabilityCardinality-2023-14 is UNSAT
FORMULA RERS17pb114-PT-3-ReachabilityCardinality-2023-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 1225/1446 variables, 17/35 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1446 variables, 0/35 constraints. Problems are: Problem set: 1 solved, 6 unsolved
SMT process timed out in 11462ms, After SMT, problems are : Problem set: 1 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 60 out of 1446 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1446/1446 places, 151085/151085 transitions.
Ensure Unique test removed 17 places
Drop transitions (Empty/Sink Transition effects.) removed 512 transitions
Reduce isomorphic transitions removed 512 transitions.
Iterating post reduction 0 with 529 rules applied. Total rules applied 529 place count 1429 transition count 150573
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 530 place count 1428 transition count 150572
Applied a total of 530 rules in 3315 ms. Remains 1428 /1446 variables (removed 18) and now considering 150572/151085 (removed 513) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3340 ms. Remains : 1428/1446 places, 150572/151085 transitions.
RANDOM walk for 40000 steps (8 resets) in 5366 ms. (7 steps per ms) remains 4/6 properties
FORMULA RERS17pb114-PT-3-ReachabilityCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb114-PT-3-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 551 ms. (72 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 610 ms. (65 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 432 ms. (92 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 508 ms. (78 steps per ms) remains 4/4 properties
[2024-05-26 07:08:54] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
// Phase 1: matrix 84689 rows 1428 cols
[2024-05-26 07:08:54] [INFO ] Computed 18 invariants in 396 ms
[2024-05-26 07:08:57] [INFO ] State equation strengthened by 773 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1366/1424 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1424 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 86112/86117 variables, and 1441 constraints, problems are : Problem set: 0 solved, 4 unsolved in 45096 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, State Equation: 1424/1428 constraints, ReadFeed: 0/773 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1366/1424 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-26 07:09:52] [INFO ] Deduced a trap composed of 40 places in 9072 ms of which 49 ms to minimize.
[2024-05-26 07:10:00] [INFO ] Deduced a trap composed of 64 places in 8262 ms of which 5 ms to minimize.
[2024-05-26 07:10:08] [INFO ] Deduced a trap composed of 64 places in 7349 ms of which 4 ms to minimize.
[2024-05-26 07:10:15] [INFO ] Deduced a trap composed of 128 places in 7400 ms of which 3 ms to minimize.
[2024-05-26 07:10:21] [INFO ] Deduced a trap composed of 128 places in 6288 ms of which 3 ms to minimize.
[2024-05-26 07:10:26] [INFO ] Deduced a trap composed of 96 places in 5150 ms of which 1 ms to minimize.
[2024-05-26 07:10:32] [INFO ] Deduced a trap composed of 128 places in 5458 ms of which 2 ms to minimize.
SMT process timed out in 98357ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 58 out of 1428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1251 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1253 ms. Remains : 1428/1428 places, 150572/150572 transitions.
RANDOM walk for 40000 steps (8 resets) in 5154 ms. (7 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 340 ms. (117 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 337 ms. (118 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 720 ms. (55 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 565 ms. (70 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 3469 steps, run timeout after 3003 ms. (steps per millisecond=1 ) properties seen :0 out of 4
Probabilistic random walk after 3469 steps, saw 3077 distinct states, run finished after 3008 ms. (steps per millisecond=1 ) properties seen :0
[2024-05-26 07:10:39] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2024-05-26 07:10:39] [INFO ] Invariant cache hit.
[2024-05-26 07:10:42] [INFO ] State equation strengthened by 773 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1366/1424 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1424 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 86112/86117 variables, and 1441 constraints, problems are : Problem set: 0 solved, 4 unsolved in 75116 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, State Equation: 1424/1428 constraints, ReadFeed: 0/773 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1366/1424 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-26 07:12:05] [INFO ] Deduced a trap composed of 64 places in 7919 ms of which 5 ms to minimize.
[2024-05-26 07:12:13] [INFO ] Deduced a trap composed of 40 places in 7835 ms of which 4 ms to minimize.
[2024-05-26 07:12:21] [INFO ] Deduced a trap composed of 96 places in 8041 ms of which 5 ms to minimize.
[2024-05-26 07:12:28] [INFO ] Deduced a trap composed of 96 places in 7185 ms of which 3 ms to minimize.
[2024-05-26 07:12:33] [INFO ] Deduced a trap composed of 64 places in 4548 ms of which 1 ms to minimize.
[2024-05-26 07:12:38] [INFO ] Deduced a trap composed of 128 places in 5343 ms of which 2 ms to minimize.
[2024-05-26 07:12:48] [INFO ] Deduced a trap composed of 128 places in 6341 ms of which 3 ms to minimize.
[2024-05-26 07:13:02] [INFO ] Deduced a trap composed of 64 places in 5838 ms of which 2 ms to minimize.
[2024-05-26 07:13:07] [INFO ] Deduced a trap composed of 96 places in 5120 ms of which 1 ms to minimize.
[2024-05-26 07:13:12] [INFO ] Deduced a trap composed of 128 places in 4836 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1424/86117 variables, and 27 constraints, problems are : Problem set: 0 solved, 4 unsolved in 78554 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, State Equation: 0/1428 constraints, ReadFeed: 0/773 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 156983ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 58 out of 1428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1268 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1268 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1244 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
[2024-05-26 07:13:18] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2024-05-26 07:13:18] [INFO ] Invariant cache hit.
[2024-05-26 07:13:28] [INFO ] Implicit Places using invariants in 9687 ms returned []
Implicit Place search using SMT only with invariants took 9698 ms to find 0 implicit places.
Running 150571 sub problems to find dead transitions.
[2024-05-26 07:13:29] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2024-05-26 07:13:29] [INFO ] Invariant cache hit.
[2024-05-26 07:13:33] [INFO ] State equation strengthened by 773 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running RERS17pb114-PT-3

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1446
TRANSITIONS: 151085
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 3.448s, Sys 0.288s]


SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.551s, Sys 0.039s]


----------------------------------------------------------------------
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: 673
MODEL NAME: /home/mcc/execution/model
1446 places, 151085 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1716708172383

--------------------
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 ReachabilityCardinality -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

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="RERS17pb114-PT-3"
export BK_EXAMINATION="ReachabilityCardinality"
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 RERS17pb114-PT-3, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r311-tall-171662336100206"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RERS17pb114-PT-3.tgz
mv RERS17pb114-PT-3 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;