Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r047-tajo-171620397800234.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is BridgeAndVehicles-PT-V50P20N20, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620397800234
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.2M
-rw-r--r-- 1 mcc users 25K Apr 13 00:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 153K Apr 13 00:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 226K Apr 13 00:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 875K Apr 13 00:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 11K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 68K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 195K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 13 01:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 13 01:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 723K Apr 13 01:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.8M Apr 13 01:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.9M 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

here is the order used to build the result vector(from text file)
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-00
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-01
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-02
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-03
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-04
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-05
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-06
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-07
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-08
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-09
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-10
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-11
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-12
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-13
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-14
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716287132214

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V50P20N20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 10:25:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 10:25:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 10:25:34] [INFO ] Load time of PNML (sax parser for PT used): 249 ms
[2024-05-21 10:25:34] [INFO ] Transformed 138 places.
[2024-05-21 10:25:34] [INFO ] Transformed 2348 transitions.
[2024-05-21 10:25:34] [INFO ] Parsed PT model containing 138 places and 2348 transitions and 18090 arcs in 421 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 64 ms.
Support contains 136 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 136 transition count 2348
Applied a total of 2 rules in 83 ms. Remains 136 /138 variables (removed 2) and now considering 2348/2348 (removed 0) transitions.
Running 2345 sub problems to find dead transitions.
[2024-05-21 10:25:34] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2024-05-21 10:25:34] [INFO ] Computed 5 invariants in 13 ms
[2024-05-21 10:25:34] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
[2024-05-21 10:26:03] [INFO ] Deduced a trap composed of 5 places in 448 ms of which 13 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/426 variables, and 6 constraints, problems are : Problem set: 0 solved, 2345 unsolved in 20108 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2345/2345 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
[2024-05-21 10:26:32] [INFO ] Deduced a trap composed of 25 places in 216 ms of which 3 ms to minimize.
Problem TDEAD1248 is UNSAT
Problem TDEAD1269 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/426 variables, and 7 constraints, problems are : Problem set: 2 solved, 2343 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2345 constraints, Known Traps: 2/2 constraints]
After SMT, in 58452ms problems are : Problem set: 2 solved, 2343 unsolved
Search for dead transitions found 2 dead transitions in 58569ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2024-05-21 10:26:33] [INFO ] Flow matrix only has 290 transitions (discarded 2056 similar events)
// Phase 1: matrix 290 rows 136 cols
[2024-05-21 10:26:33] [INFO ] Computed 5 invariants in 6 ms
[2024-05-21 10:26:33] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-21 10:26:33] [INFO ] Flow matrix only has 290 transitions (discarded 2056 similar events)
[2024-05-21 10:26:33] [INFO ] Invariant cache hit.
[2024-05-21 10:26:33] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 10:26:33] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 136/138 places, 2346/2348 transitions.
Applied a total of 0 rules in 19 ms. Remains 136 /136 variables (removed 0) and now considering 2346/2346 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58933 ms. Remains : 136/138 places, 2346/2348 transitions.
Support contains 136 out of 136 places after structural reductions.
[2024-05-21 10:26:34] [INFO ] Flatten gal took : 338 ms
[2024-05-21 10:26:36] [INFO ] Flatten gal took : 311 ms
[2024-05-21 10:26:38] [INFO ] Input system was already deterministic with 2346 transitions.
Reduction of identical properties reduced properties to check from 52 to 51
RANDOM walk for 40000 steps (92 resets) in 5917 ms. (6 steps per ms) remains 26/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 189 ms. (21 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 192 ms. (20 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (8 resets) in 17 ms. (222 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 50 ms. (78 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 22/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
[2024-05-21 10:26:40] [INFO ] Flow matrix only has 290 transitions (discarded 2056 similar events)
[2024-05-21 10:26:40] [INFO ] Invariant cache hit.
[2024-05-21 10:26:40] [INFO ] State equation strengthened by 42 read => feed constraints.
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp50 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 17 unsolved
Problem AtomicPropp12 is UNSAT
At refinement iteration 2 (OVERLAPS) 10/135 variables, 3/5 constraints. Problems are: Problem set: 5 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/5 constraints. Problems are: Problem set: 5 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 290/425 variables, 135/140 constraints. Problems are: Problem set: 5 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 42/182 constraints. Problems are: Problem set: 5 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 0/182 constraints. Problems are: Problem set: 5 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 1/426 variables, 1/183 constraints. Problems are: Problem set: 5 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 0/183 constraints. Problems are: Problem set: 5 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/426 variables, 0/183 constraints. Problems are: Problem set: 5 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 183 constraints, problems are : Problem set: 5 solved, 16 unsolved in 2474 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 136/136 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 55/133 variables, 4/5 constraints. Problems are: Problem set: 5 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/5 constraints. Problems are: Problem set: 5 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 290/423 variables, 133/138 constraints. Problems are: Problem set: 5 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/423 variables, 42/180 constraints. Problems are: Problem set: 5 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 1/181 constraints. Problems are: Problem set: 5 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 0/181 constraints. Problems are: Problem set: 5 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 3/426 variables, 3/184 constraints. Problems are: Problem set: 5 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 15/199 constraints. Problems are: Problem set: 5 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 0/199 constraints. Problems are: Problem set: 5 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 0/426 variables, 0/199 constraints. Problems are: Problem set: 5 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 426/426 variables, and 199 constraints, problems are : Problem set: 5 solved, 16 unsolved in 4508 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 136/136 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 16/21 constraints, Known Traps: 0/0 constraints]
After SMT, in 7262ms problems are : Problem set: 5 solved, 16 unsolved
Parikh walk visited 0 properties in 2092 ms.
Support contains 78 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 2346/2346 transitions.
Applied a total of 0 rules in 310 ms. Remains 136 /136 variables (removed 0) and now considering 2346/2346 (removed 0) transitions.
Running 2343 sub problems to find dead transitions.
[2024-05-21 10:26:50] [INFO ] Flow matrix only has 290 transitions (discarded 2056 similar events)
[2024-05-21 10:26:50] [INFO ] Invariant cache hit.
[2024-05-21 10:26:50] [INFO ] State equation strengthened by 42 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BridgeAndVehicles-PT-V50P20N20

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: 138
TRANSITIONS: 2348
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.079s, Sys 0.011s]


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


----------------------------------------------------------------------
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: 595
MODEL NAME: /home/mcc/execution/model
138 places, 2348 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.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-00 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-01 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-02 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-03 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-04 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-05 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-06 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-07 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-09 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-10 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-13 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-14 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716289225589

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 CTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 8388608 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="BridgeAndVehicles-PT-V50P20N20"
export BK_EXAMINATION="CTLFireability"
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 BridgeAndVehicles-PT-V50P20N20, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r047-tajo-171620397800234"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V50P20N20.tgz
mv BridgeAndVehicles-PT-V50P20N20 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;