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.r223-tall-171649611700538.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 Medical-PT-08, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-171649611700538
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 13 15:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 13 15:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.1M 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 Medical-PT-08-CTLFireability-2024-00
FORMULA_NAME Medical-PT-08-CTLFireability-2024-01
FORMULA_NAME Medical-PT-08-CTLFireability-2024-02
FORMULA_NAME Medical-PT-08-CTLFireability-2024-03
FORMULA_NAME Medical-PT-08-CTLFireability-2024-04
FORMULA_NAME Medical-PT-08-CTLFireability-2024-05
FORMULA_NAME Medical-PT-08-CTLFireability-2024-06
FORMULA_NAME Medical-PT-08-CTLFireability-2024-07
FORMULA_NAME Medical-PT-08-CTLFireability-2024-08
FORMULA_NAME Medical-PT-08-CTLFireability-2024-09
FORMULA_NAME Medical-PT-08-CTLFireability-2024-10
FORMULA_NAME Medical-PT-08-CTLFireability-2024-11
FORMULA_NAME Medical-PT-08-CTLFireability-2023-12
FORMULA_NAME Medical-PT-08-CTLFireability-2023-13
FORMULA_NAME Medical-PT-08-CTLFireability-2023-14
FORMULA_NAME Medical-PT-08-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716567186003

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Medical-PT-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 16:13:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-24 16:13:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 16:13:07] [INFO ] Load time of PNML (sax parser for PT used): 311 ms
[2024-05-24 16:13:07] [INFO ] Transformed 312 places.
[2024-05-24 16:13:07] [INFO ] Transformed 5431 transitions.
[2024-05-24 16:13:07] [INFO ] Parsed PT model containing 312 places and 5431 transitions and 28790 arcs in 449 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Deduced a syphon composed of 242 places in 23 ms
Reduce places removed 242 places and 5204 transitions.
Reduce places removed 1 places and 0 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA Medical-PT-08-CTLFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-08-CTLFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-08-CTLFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-08-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-08-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-08-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-08-CTLFireability-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 0 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 227/227 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 67 transition count 227
Applied a total of 2 rules in 16 ms. Remains 67 /69 variables (removed 2) and now considering 227/227 (removed 0) transitions.
[2024-05-24 16:13:07] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
// Phase 1: matrix 182 rows 67 cols
[2024-05-24 16:13:07] [INFO ] Computed 8 invariants in 13 ms
[2024-05-24 16:13:07] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-05-24 16:13:07] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
[2024-05-24 16:13:07] [INFO ] Invariant cache hit.
[2024-05-24 16:13:08] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-24 16:13:08] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
Running 222 sub problems to find dead transitions.
[2024-05-24 16:13:08] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
[2024-05-24 16:13:08] [INFO ] Invariant cache hit.
[2024-05-24 16:13:08] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-24 16:13:09] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 11 ms to minimize.
Problem TDEAD213 is UNSAT
Problem TDEAD218 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/7 constraints. Problems are: Problem set: 2 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 220 unsolved
At refinement iteration 3 (OVERLAPS) 2/65 variables, 2/9 constraints. Problems are: Problem set: 2 solved, 220 unsolved
[2024-05-24 16:13:10] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 2 ms to minimize.
[2024-05-24 16:13:10] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 3 ms to minimize.
Problem TDEAD203 is UNSAT
Problem TDEAD208 is UNSAT
[2024-05-24 16:13:11] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 3/12 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/12 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 6 (OVERLAPS) 182/247 variables, 65/77 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 56/133 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 0/133 constraints. Problems are: Problem set: 6 solved, 216 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/249 variables, 2/135 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 0/135 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 11 (OVERLAPS) 0/249 variables, 0/135 constraints. Problems are: Problem set: 6 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 135 constraints, problems are : Problem set: 6 solved, 216 unsolved in 6776 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 67/67 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 6 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 6/6 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 2/8 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/8 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 3 (OVERLAPS) 2/65 variables, 2/10 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 2/12 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/12 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 6 (OVERLAPS) 182/247 variables, 65/77 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 56/133 constraints. Problems are: Problem set: 6 solved, 216 unsolved
Problem TDEAD8 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD128 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 133/266 constraints. Problems are: Problem set: 9 solved, 213 unsolved
[2024-05-24 16:13:17] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 2 ms to minimize.
[2024-05-24 16:13:17] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
Problem TDEAD156 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD170 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/247 variables, 2/268 constraints. Problems are: Problem set: 12 solved, 210 unsolved
[2024-05-24 16:13:18] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-24 16:13:18] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 2/270 constraints. Problems are: Problem set: 12 solved, 210 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 0/270 constraints. Problems are: Problem set: 12 solved, 210 unsolved
At refinement iteration 12 (OVERLAPS) 2/249 variables, 2/272 constraints. Problems are: Problem set: 12 solved, 210 unsolved
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD177 is UNSAT
At refinement iteration 13 (INCLUDED_ONLY) 0/249 variables, 83/355 constraints. Problems are: Problem set: 17 solved, 205 unsolved
[2024-05-24 16:13:24] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
Problem TDEAD149 is UNSAT
At refinement iteration 14 (INCLUDED_ONLY) 0/249 variables, 1/356 constraints. Problems are: Problem set: 18 solved, 204 unsolved
[2024-05-24 16:13:26] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-05-24 16:13:26] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/249 variables, 2/358 constraints. Problems are: Problem set: 18 solved, 204 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/249 variables, 0/358 constraints. Problems are: Problem set: 18 solved, 204 unsolved
At refinement iteration 17 (OVERLAPS) 0/249 variables, 0/358 constraints. Problems are: Problem set: 18 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 358 constraints, problems are : Problem set: 18 solved, 204 unsolved in 16342 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 67/67 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 216/222 constraints, Known Traps: 11/11 constraints]
After SMT, in 23381ms problems are : Problem set: 18 solved, 204 unsolved
Search for dead transitions found 18 dead transitions in 23403ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in LTL mode, iteration 1 : 67/69 places, 209/227 transitions.
Reduce places removed 6 places and 43 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 61 transition count 166
Reduce places removed 4 places and 31 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 57 transition count 135
Reduce places removed 2 places and 14 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 55 transition count 121
Reduce places removed 3 places and 19 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 15 place count 52 transition count 102
Applied a total of 15 rules in 4 ms. Remains 52 /67 variables (removed 15) and now considering 102/209 (removed 107) transitions.
[2024-05-24 16:13:31] [INFO ] Flow matrix only has 90 transitions (discarded 12 similar events)
// Phase 1: matrix 90 rows 52 cols
[2024-05-24 16:13:31] [INFO ] Computed 8 invariants in 2 ms
[2024-05-24 16:13:31] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-24 16:13:31] [INFO ] Flow matrix only has 90 transitions (discarded 12 similar events)
[2024-05-24 16:13:31] [INFO ] Invariant cache hit.
[2024-05-24 16:13:31] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-24 16:13:31] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 52/69 places, 102/227 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 23999 ms. Remains : 52/69 places, 102/227 transitions.
Support contains 0 out of 52 places after structural reductions.
[2024-05-24 16:13:31] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-24 16:13:31] [INFO ] Flatten gal took : 35 ms
[2024-05-24 16:13:31] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA Medical-PT-08-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-08-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-08-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-08-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-08-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 16:13:31] [INFO ] Flatten gal took : 14 ms
[2024-05-24 16:13:31] [INFO ] Input system was already deterministic with 102 transitions.
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2024-05-24 16:13:32] [INFO ] Flatten gal took : 10 ms
[2024-05-24 16:13:32] [INFO ] Flatten gal took : 10 ms
[2024-05-24 16:13:32] [INFO ] Input system was already deterministic with 102 transitions.
Computed a total of 7 stabilizing places and 22 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 52/52 places, 102/102 transitions.
[2024-05-24 16:13:32] [INFO ] Flatten gal took : 9 ms
[2024-05-24 16:13:32] [INFO ] Flatten gal took : 9 ms
[2024-05-24 16:13:32] [INFO ] Input system was already deterministic with 102 transitions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 102/102 transitions.
Applied a total of 0 rules in 0 ms. Remains 52 /52 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 52/52 places, 102/102 transitions.
[2024-05-24 16:13:32] [INFO ] Flatten gal took : 8 ms
[2024-05-24 16:13:32] [INFO ] Flatten gal took : 9 ms
[2024-05-24 16:13:32] [INFO ] Input system was already deterministic with 102 transitions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 52/52 places, 102/102 transitions.
[2024-05-24 16:13:32] [INFO ] Flatten gal took : 8 ms
[2024-05-24 16:13:32] [INFO ] Flatten gal took : 9 ms
[2024-05-24 16:13:32] [INFO ] Input system was already deterministic with 102 transitions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 52/52 places, 102/102 transitions.
[2024-05-24 16:13:32] [INFO ] Flatten gal took : 8 ms
[2024-05-24 16:13:32] [INFO ] Flatten gal took : 9 ms
[2024-05-24 16:13:32] [INFO ] Input system was already deterministic with 102 transitions.
[2024-05-24 16:13:32] [INFO ] Flatten gal took : 8 ms
[2024-05-24 16:13:32] [INFO ] Flatten gal took : 8 ms
[2024-05-24 16:13:32] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/CTLFireability.sr.xml took 1 ms.
[2024-05-24 16:13:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 52 places, 102 transitions and 502 arcs took 4 ms.
Total runtime 25128 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Medical-PT-08

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/410/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 52
TRANSITIONS: 102
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, Sys 0.003s]


SAVING FILE /home/mcc/execution/410/model (.net / .def) ...
EXPORT TIME: [User 0.000s, 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: 581
MODEL NAME: /home/mcc/execution/410/model
52 places, 102 transitions.
Enabling coverability test.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Start RS construction.
coverability test failed!!
Convergence in 5 steps.
coverability test failed!!
Convergence in 5 steps.
The state space is infinite.
The state space is infinite.
CANNOT_COMPUTE
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716567212873

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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

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="Medical-PT-08"
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 Medical-PT-08, 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 r223-tall-171649611700538"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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