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-171620398300462.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 BusinessProcesses-PT-02, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398300462
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 16:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Apr 11 16:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 16:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 16:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:31 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 59K 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 BusinessProcesses-PT-02-ReachabilityCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-2024-12
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-2024-13
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-2024-14
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716302505856

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 14:41:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 14:41:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 14:41:47] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2024-05-21 14:41:47] [INFO ] Transformed 262 places.
[2024-05-21 14:41:47] [INFO ] Transformed 219 transitions.
[2024-05-21 14:41:47] [INFO ] Found NUPN structural information;
[2024-05-21 14:41:47] [INFO ] Parsed PT model containing 262 places and 219 transitions and 576 arcs in 209 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 15 transitions.
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (539 resets) in 1368 ms. (29 steps per ms) remains 3/13 properties
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (107 resets) in 565 ms. (70 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (98 resets) in 102 ms. (388 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (95 resets) in 200 ms. (199 steps per ms) remains 2/3 properties
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 204 rows 245 cols
[2024-05-21 14:41:48] [INFO ] Computed 43 invariants in 12 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 140/167 variables, 19/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 140/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 50/217 variables, 11/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 50/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 28/245 variables, 13/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 28/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 204/449 variables, 245/533 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/449 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/449 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 449/449 variables, and 533 constraints, problems are : Problem set: 0 solved, 2 unsolved in 487 ms.
Refiners :[Domain max(s): 245/245 constraints, Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 140/167 variables, 19/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 140/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 14:41:49] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 7 ms to minimize.
[2024-05-21 14:41:49] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 4 ms to minimize.
[2024-05-21 14:41:49] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 1 ms to minimize.
[2024-05-21 14:41:49] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-21 14:41:49] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 3 ms to minimize.
[2024-05-21 14:41:49] [INFO ] Deduced a trap composed of 66 places in 133 ms of which 1 ms to minimize.
[2024-05-21 14:41:49] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 2 ms to minimize.
[2024-05-21 14:41:49] [INFO ] Deduced a trap composed of 67 places in 42 ms of which 1 ms to minimize.
[2024-05-21 14:41:49] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 0 ms to minimize.
[2024-05-21 14:41:49] [INFO ] Deduced a trap composed of 61 places in 60 ms of which 1 ms to minimize.
[2024-05-21 14:41:49] [INFO ] Deduced a trap composed of 61 places in 60 ms of which 2 ms to minimize.
[2024-05-21 14:41:49] [INFO ] Deduced a trap composed of 68 places in 44 ms of which 2 ms to minimize.
[2024-05-21 14:41:49] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 6 ms to minimize.
[2024-05-21 14:41:49] [INFO ] Deduced a trap composed of 57 places in 38 ms of which 1 ms to minimize.
[2024-05-21 14:41:50] [INFO ] Deduced a trap composed of 62 places in 51 ms of which 1 ms to minimize.
[2024-05-21 14:41:50] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
[2024-05-21 14:41:50] [INFO ] Deduced a trap composed of 60 places in 73 ms of which 1 ms to minimize.
[2024-05-21 14:41:50] [INFO ] Deduced a trap composed of 58 places in 44 ms of which 1 ms to minimize.
[2024-05-21 14:41:50] [INFO ] Deduced a trap composed of 58 places in 43 ms of which 1 ms to minimize.
[2024-05-21 14:41:50] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 20/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 14:41:50] [INFO ] Deduced a trap composed of 63 places in 42 ms of which 1 ms to minimize.
[2024-05-21 14:41:50] [INFO ] Deduced a trap composed of 68 places in 42 ms of which 1 ms to minimize.
[2024-05-21 14:41:50] [INFO ] Deduced a trap composed of 67 places in 44 ms of which 1 ms to minimize.
[2024-05-21 14:41:50] [INFO ] Deduced a trap composed of 59 places in 41 ms of which 1 ms to minimize.
[2024-05-21 14:41:50] [INFO ] Deduced a trap composed of 60 places in 45 ms of which 1 ms to minimize.
[2024-05-21 14:41:50] [INFO ] Deduced a trap composed of 53 places in 51 ms of which 1 ms to minimize.
[2024-05-21 14:41:50] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 1 ms to minimize.
[2024-05-21 14:41:50] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 1 ms to minimize.
[2024-05-21 14:41:50] [INFO ] Deduced a trap composed of 64 places in 41 ms of which 1 ms to minimize.
[2024-05-21 14:41:50] [INFO ] Deduced a trap composed of 55 places in 48 ms of which 1 ms to minimize.
[2024-05-21 14:41:50] [INFO ] Deduced a trap composed of 56 places in 41 ms of which 1 ms to minimize.
[2024-05-21 14:41:51] [INFO ] Deduced a trap composed of 68 places in 36 ms of which 2 ms to minimize.
[2024-05-21 14:41:51] [INFO ] Deduced a trap composed of 59 places in 50 ms of which 1 ms to minimize.
[2024-05-21 14:41:51] [INFO ] Deduced a trap composed of 59 places in 59 ms of which 2 ms to minimize.
[2024-05-21 14:41:51] [INFO ] Deduced a trap composed of 59 places in 44 ms of which 4 ms to minimize.
[2024-05-21 14:41:51] [INFO ] Deduced a trap composed of 61 places in 59 ms of which 2 ms to minimize.
[2024-05-21 14:41:51] [INFO ] Deduced a trap composed of 63 places in 52 ms of which 1 ms to minimize.
Problem BusinessProcesses-PT-02-ReachabilityCardinality-2024-14 is UNSAT
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 17/223 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/223 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 50/217 variables, 11/234 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 50/284 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 14:41:51] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-21 14:41:51] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-21 14:41:51] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-21 14:41:51] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/217 variables, 4/288 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/217 variables, 0/288 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 28/245 variables, 13/301 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/245 variables, 28/329 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/245 variables, 0/329 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 204/449 variables, 245/574 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/449 variables, 1/575 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 14:41:52] [INFO ] Deduced a trap composed of 63 places in 462 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/449 variables, 1/576 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/449 variables, 0/576 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/449 variables, 0/576 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 449/449 variables, and 576 constraints, problems are : Problem set: 1 solved, 1 unsolved in 3461 ms.
Refiners :[Domain max(s): 245/245 constraints, Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 42/42 constraints]
After SMT, in 4025ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 34 ms.
Support contains 21 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 204/204 transitions.
Graph (trivial) has 125 edges and 245 vertex of which 7 / 245 are part of one of the 1 SCC in 2 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 438 edges and 239 vertex of which 230 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Discarding 9 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 230 transition count 151
Reduce places removed 41 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 46 rules applied. Total rules applied 90 place count 189 transition count 146
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 95 place count 184 transition count 146
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 95 place count 184 transition count 113
Deduced a syphon composed of 33 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 71 rules applied. Total rules applied 166 place count 146 transition count 113
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 190 place count 122 transition count 89
Iterating global reduction 3 with 24 rules applied. Total rules applied 214 place count 122 transition count 89
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 276 place count 91 transition count 58
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 277 place count 91 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 278 place count 90 transition count 57
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 279 place count 90 transition count 57
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 280 place count 89 transition count 56
Applied a total of 280 rules in 117 ms. Remains 89 /245 variables (removed 156) and now considering 56/204 (removed 148) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 89/245 places, 56/204 transitions.
RANDOM walk for 40000 steps (946 resets) in 499 ms. (80 steps per ms) remains 1/1 properties
BEST_FIRST walk for 3490 steps (21 resets) in 11 ms. (290 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 5515 ms.
ITS solved all properties within timeout

BK_STOP 1716302512889

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

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="BusinessProcesses-PT-02"
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 BusinessProcesses-PT-02, 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 r047-tajo-171620398300462"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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