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.r472-tajo-171620399500455.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 ltsminxred
Input is BusinessProcesses-PT-01, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399500455
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K 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.7K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Apr 11 16:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 11 16:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 16:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 11 16:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:30 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 47K 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-01-ReachabilityFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-2024-12
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-2024-13
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-2024-14
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717224938554

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-01
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:55:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 06:55:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:55:40] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2024-06-01 06:55:40] [INFO ] Transformed 200 places.
[2024-06-01 06:55:40] [INFO ] Transformed 178 transitions.
[2024-06-01 06:55:40] [INFO ] Found NUPN structural information;
[2024-06-01 06:55:40] [INFO ] Parsed PT model containing 200 places and 178 transitions and 487 arcs in 190 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
RANDOM walk for 40000 steps (451 resets) in 1661 ms. (24 steps per ms) remains 4/16 properties
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (104 resets) in 208 ms. (191 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (98 resets) in 317 ms. (125 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (106 resets) in 415 ms. (96 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (92 resets) in 697 ms. (57 steps per ms) remains 4/4 properties
// Phase 1: matrix 177 rows 199 cols
[2024-06-01 06:55:41] [INFO ] Computed 30 invariants in 19 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 118/176 variables, 19/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 118/195 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3/179 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem BusinessProcesses-PT-01-ReachabilityFireability-2024-02 is UNSAT
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 20/199 variables, 10/209 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 20/229 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 0/229 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 177/376 variables, 199/428 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/376 variables, 0/428 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/376 variables, 0/428 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 428 constraints, problems are : Problem set: 1 solved, 3 unsolved in 464 ms.
Refiners :[Domain max(s): 199/199 constraints, Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 31/31 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem BusinessProcesses-PT-01-ReachabilityFireability-2024-12 is UNSAT
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 133/164 variables, 18/49 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 133/182 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 06:55:42] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 13 ms to minimize.
[2024-06-01 06:55:42] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:55:42] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:55:42] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:55:42] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:55:42] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:55:42] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:55:42] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:55:42] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:55:42] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:55:42] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:55:42] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:55:42] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:55:42] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 2 ms to minimize.
[2024-06-01 06:55:42] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:55:42] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 2 ms to minimize.
[2024-06-01 06:55:42] [INFO ] Deduced a trap composed of 52 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:55:42] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:55:43] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:55:43] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 20/202 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 06:55:43] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:55:43] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:55:43] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:55:43] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:55:43] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:55:43] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:55:43] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:55:43] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:55:43] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 1 ms to minimize.
[2024-06-01 06:55:43] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:55:43] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:55:43] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 2 ms to minimize.
[2024-06-01 06:55:43] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:55:43] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 2 ms to minimize.
[2024-06-01 06:55:44] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 5 ms to minimize.
[2024-06-01 06:55:44] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:55:44] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:55:44] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:55:44] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:55:44] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 20/222 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 06:55:44] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 2 ms to minimize.
[2024-06-01 06:55:44] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 2 ms to minimize.
[2024-06-01 06:55:44] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:55:44] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 2 ms to minimize.
[2024-06-01 06:55:44] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:55:44] [INFO ] Deduced a trap composed of 52 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:55:44] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 2 ms to minimize.
[2024-06-01 06:55:44] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 2 ms to minimize.
[2024-06-01 06:55:44] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:55:44] [INFO ] Deduced a trap composed of 58 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:55:45] [INFO ] Deduced a trap composed of 59 places in 53 ms of which 3 ms to minimize.
[2024-06-01 06:55:45] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 2 ms to minimize.
[2024-06-01 06:55:45] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:55:45] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:55:45] [INFO ] Deduced a trap composed of 58 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:55:45] [INFO ] Deduced a trap composed of 57 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:55:45] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 10 ms to minimize.
[2024-06-01 06:55:45] [INFO ] Deduced a trap composed of 60 places in 56 ms of which 2 ms to minimize.
[2024-06-01 06:55:45] [INFO ] Deduced a trap composed of 60 places in 51 ms of which 2 ms to minimize.
[2024-06-01 06:55:45] [INFO ] Deduced a trap composed of 62 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 20/242 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 06:55:45] [INFO ] Deduced a trap composed of 55 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:55:45] [INFO ] Deduced a trap composed of 63 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:55:45] [INFO ] Deduced a trap composed of 61 places in 57 ms of which 2 ms to minimize.
[2024-06-01 06:55:45] [INFO ] Deduced a trap composed of 60 places in 59 ms of which 2 ms to minimize.
[2024-06-01 06:55:46] [INFO ] Deduced a trap composed of 57 places in 54 ms of which 2 ms to minimize.
[2024-06-01 06:55:46] [INFO ] Deduced a trap composed of 52 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:55:46] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 2 ms to minimize.
Problem BusinessProcesses-PT-01-ReachabilityFireability-2024-15 is UNSAT
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 7/249 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 0/249 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/171 variables, 2/251 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/171 variables, 7/258 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-06-01 06:55:46] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:55:46] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/171 variables, 2/260 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/171 variables, 0/260 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 28/199 variables, 10/270 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/199 variables, 28/298 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-06-01 06:55:46] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 2 ms to minimize.
[2024-06-01 06:55:46] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
Problem BusinessProcesses-PT-01-ReachabilityFireability-2024-01 is UNSAT
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 199/376 variables, and 300 constraints, problems are : Problem set: 4 solved, 0 unsolved in 4562 ms.
Refiners :[Domain max(s): 199/199 constraints, Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/199 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 71/71 constraints]
After SMT, in 5103ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
All properties solved without resorting to model-checking.
Total runtime 6467 ms.
ITS solved all properties within timeout

BK_STOP 1717224946636

--------------------
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 ReachabilityFireability -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-01"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is BusinessProcesses-PT-01, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r472-tajo-171620399500455"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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