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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 73M
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K 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.4K Apr 23 07:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 19 07:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K 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 76K 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-6-ReachabilityCardinality-2024-00
FORMULA_NAME RERS17pb114-PT-6-ReachabilityCardinality-2024-01
FORMULA_NAME RERS17pb114-PT-6-ReachabilityCardinality-2024-02
FORMULA_NAME RERS17pb114-PT-6-ReachabilityCardinality-2024-03
FORMULA_NAME RERS17pb114-PT-6-ReachabilityCardinality-2024-04
FORMULA_NAME RERS17pb114-PT-6-ReachabilityCardinality-2024-05
FORMULA_NAME RERS17pb114-PT-6-ReachabilityCardinality-2024-06
FORMULA_NAME RERS17pb114-PT-6-ReachabilityCardinality-2024-07
FORMULA_NAME RERS17pb114-PT-6-ReachabilityCardinality-2024-08
FORMULA_NAME RERS17pb114-PT-6-ReachabilityCardinality-2023-09
FORMULA_NAME RERS17pb114-PT-6-ReachabilityCardinality-2024-10
FORMULA_NAME RERS17pb114-PT-6-ReachabilityCardinality-2024-11
FORMULA_NAME RERS17pb114-PT-6-ReachabilityCardinality-2023-12
FORMULA_NAME RERS17pb114-PT-6-ReachabilityCardinality-2024-13
FORMULA_NAME RERS17pb114-PT-6-ReachabilityCardinality-2023-14
FORMULA_NAME RERS17pb114-PT-6-ReachabilityCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716710131633

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-6
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 07:55:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-26 07:55:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 07:55:35] [INFO ] Load time of PNML (sax parser for PT used): 2191 ms
[2024-05-26 07:55:35] [INFO ] Transformed 1446 places.
[2024-05-26 07:55:35] [INFO ] Transformed 151085 transitions.
[2024-05-26 07:55:35] [INFO ] Parsed PT model containing 1446 places and 151085 transitions and 604252 arcs in 2683 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 6517 ms. (6 steps per ms) remains 13/16 properties
FORMULA RERS17pb114-PT-6-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb114-PT-6-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb114-PT-6-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 491 ms. (81 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 434 ms. (91 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 470 ms. (84 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 369 ms. (108 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 911 ms. (43 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 372 ms. (107 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 512 ms. (77 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 441 ms. (90 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 353 ms. (113 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 370 ms. (107 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 370 ms. (107 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 350 ms. (113 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 829 ms. (48 steps per ms) remains 13/13 properties
[2024-05-26 07:55:40] [INFO ] Flow matrix only has 84691 transitions (discarded 66394 similar events)
// Phase 1: matrix 84691 rows 1446 cols
[2024-05-26 07:55:41] [INFO ] Computed 35 invariants in 476 ms
[2024-05-26 07:55:46] [INFO ] State equation strengthened by 2342 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 121/386 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem RERS17pb114-PT-6-ReachabilityCardinality-2024-00 is UNSAT
FORMULA RERS17pb114-PT-6-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem RERS17pb114-PT-6-ReachabilityCardinality-2023-09 is UNSAT
FORMULA RERS17pb114-PT-6-ReachabilityCardinality-2023-09 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 1060/1446 variables, 17/35 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1446 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 11 unsolved
SMT process timed out in 11550ms, After SMT, problems are : Problem set: 2 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 243 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 15 places
Drop transitions (Empty/Sink Transition effects.) removed 512 transitions
Reduce isomorphic transitions removed 512 transitions.
Iterating post reduction 0 with 527 rules applied. Total rules applied 527 place count 1431 transition count 150573
Applied a total of 527 rules in 2055 ms. Remains 1431 /1446 variables (removed 15) and now considering 150573/151085 (removed 512) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2080 ms. Remains : 1431/1446 places, 150573/151085 transitions.
RANDOM walk for 40000 steps (8 resets) in 4109 ms. (9 steps per ms) remains 9/11 properties
FORMULA RERS17pb114-PT-6-ReachabilityCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb114-PT-6-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 391 ms. (102 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 525 ms. (76 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 397 ms. (100 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 371 ms. (107 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 403 ms. (99 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 296 ms. (134 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 344 ms. (115 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 340 ms. (117 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 314 ms. (126 steps per ms) remains 9/9 properties
[2024-05-26 07:55:56] [INFO ] Flow matrix only has 84690 transitions (discarded 65883 similar events)
// Phase 1: matrix 84690 rows 1431 cols
[2024-05-26 07:55:57] [INFO ] Computed 20 invariants in 313 ms
[2024-05-26 07:56:02] [INFO ] State equation strengthened by 2341 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 104/316 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1115/1431 variables, 17/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1431 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 86121/86121 variables, and 1451 constraints, problems are : Problem set: 0 solved, 9 unsolved in 45105 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 1431/1431 constraints, ReadFeed: 0/2341 constraints, PredecessorRefiner: 9/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 104/316 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1115/1431 variables, 17/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-26 07:56:58] [INFO ] Deduced a trap composed of 65 places in 5176 ms of which 14 ms to minimize.
[2024-05-26 07:57:02] [INFO ] Deduced a trap composed of 67 places in 4314 ms of which 1 ms to minimize.
[2024-05-26 07:57:22] [INFO ] Deduced a trap composed of 97 places in 4201 ms of which 1 ms to minimize.
[2024-05-26 07:57:32] [INFO ] Deduced a trap composed of 129 places in 5633 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1431/86121 variables, and 24 constraints, problems are : Problem set: 0 solved, 9 unsolved in 47532 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 0/1431 constraints, ReadFeed: 0/2341 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 4/4 constraints]
After SMT, in 98700ms problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 212 out of 1431 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1431/1431 places, 150573/150573 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1430 transition count 150573
Applied a total of 1 rules in 1542 ms. Remains 1430 /1431 variables (removed 1) and now considering 150573/150573 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1544 ms. Remains : 1430/1431 places, 150573/150573 transitions.
RANDOM walk for 40000 steps (8 resets) in 5276 ms. (7 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 566 ms. (70 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 290 ms. (137 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 290 ms. (137 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 328 ms. (121 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 411 ms. (97 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 296 ms. (134 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 346 ms. (115 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 349 ms. (114 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 314 ms. (126 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 6252 steps, run timeout after 6006 ms. (steps per millisecond=1 ) properties seen :0 out of 9
Probabilistic random walk after 6252 steps, saw 5653 distinct states, run finished after 6012 ms. (steps per millisecond=1 ) properties seen :0
[2024-05-26 07:57:46] [INFO ] Flow matrix only has 84690 transitions (discarded 65883 similar events)
// Phase 1: matrix 84690 rows 1430 cols
[2024-05-26 07:57:46] [INFO ] Computed 19 invariants in 397 ms
[2024-05-26 07:57:51] [INFO ] State equation strengthened by 2341 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 57/269 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1161/1430 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1430 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 86120/86120 variables, and 1449 constraints, problems are : Problem set: 0 solved, 9 unsolved in 75102 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 1430/1430 constraints, ReadFeed: 0/2341 constraints, PredecessorRefiner: 9/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 57/269 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1161/1430 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-26 07:59:15] [INFO ] Deduced a trap composed of 67 places in 4513 ms of which 2 ms to minimize.
[2024-05-26 07:59:34] [INFO ] Deduced a trap composed of 129 places in 6056 ms of which 3 ms to minimize.
[2024-05-26 07:59:40] [INFO ] Deduced a trap composed of 129 places in 5069 ms of which 6 ms to minimize.
[2024-05-26 07:59:44] [INFO ] Deduced a trap composed of 97 places in 4060 ms of which 2 ms to minimize.
[2024-05-26 07:59:51] [INFO ] Deduced a trap composed of 97 places in 3866 ms of which 1 ms to minimize.
[2024-05-26 07:59:58] [INFO ] Deduced a trap composed of 97 places in 4577 ms of which 1 ms to minimize.
[2024-05-26 08:00:06] [INFO ] Deduced a trap composed of 65 places in 4079 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1430 variables, 7/26 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1430/86120 variables, and 26 constraints, problems are : Problem set: 0 solved, 9 unsolved in 76413 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 0/1430 constraints, ReadFeed: 0/2341 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 7/7 constraints]
After SMT, in 156934ms problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 212 out of 1430 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1430/1430 places, 150573/150573 transitions.
Applied a total of 0 rules in 1248 ms. Remains 1430 /1430 variables (removed 0) and now considering 150573/150573 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1250 ms. Remains : 1430/1430 places, 150573/150573 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1430/1430 places, 150573/150573 transitions.
Applied a total of 0 rules in 1229 ms. Remains 1430 /1430 variables (removed 0) and now considering 150573/150573 (removed 0) transitions.
[2024-05-26 08:00:25] [INFO ] Flow matrix only has 84690 transitions (discarded 65883 similar events)
[2024-05-26 08:00:25] [INFO ] Invariant cache hit.
[2024-05-26 08:00:33] [INFO ] Implicit Places using invariants in 8161 ms returned []
Implicit Place search using SMT only with invariants took 8167 ms to find 0 implicit places.
Running 150572 sub problems to find dead transitions.
[2024-05-26 08:00:35] [INFO ] Flow matrix only has 84690 transitions (discarded 65883 similar events)
[2024-05-26 08:00:35] [INFO ] Invariant cache hit.
[2024-05-26 08:00:40] [INFO ] State equation strengthened by 2341 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running RERS17pb114-PT-6

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.471s, Sys 0.209s]


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


----------------------------------------------------------------------
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: 608
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 1716710986001

--------------------
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
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="RERS17pb114-PT-6"
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-6, 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-171662336100230"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RERS17pb114-PT-6.tgz
mv RERS17pb114-PT-6 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 ;