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.r579-smll-171734921200101.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 ltsminxred
Input is MedleyA-PT-13, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r579-smll-171734921200101
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 6.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 39K Jun 2 16:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717357414851

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-13
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 19:43:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-02 19:43:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:43:37] [INFO ] Load time of PNML (sax parser for PT used): 184 ms
[2024-06-02 19:43:37] [INFO ] Transformed 173 places.
[2024-06-02 19:43:37] [INFO ] Transformed 159 transitions.
[2024-06-02 19:43:37] [INFO ] Found NUPN structural information;
[2024-06-02 19:43:37] [INFO ] Parsed PT model containing 173 places and 159 transitions and 401 arcs in 353 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 159 rows 173 cols
[2024-06-02 19:43:37] [INFO ] Computed 21 invariants in 21 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (285 resets) in 46 ms. (212 steps per ms)
FORMULA MedleyA-PT-13-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-13-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-13-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-13-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-13-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-13-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-13-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-13-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-13-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-13-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-13-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-13-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-13-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30003 steps (211 resets) in 45 ms. (652 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-06-02 19:43:37] [INFO ] Invariant cache hit.
[2024-06-02 19:43:38] [INFO ] [Real]Absence check using 9 positive place invariants in 12 ms returned sat
[2024-06-02 19:43:38] [INFO ] [Real]Absence check using 9 positive and 12 generalized place invariants in 11 ms returned sat
[2024-06-02 19:43:38] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2024-06-02 19:43:38] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 15 ms to minimize.
[2024-06-02 19:43:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:43:38] [INFO ] [Nat]Absence check using 9 positive place invariants in 9 ms returned sat
[2024-06-02 19:43:38] [INFO ] [Nat]Absence check using 9 positive and 12 generalized place invariants in 5 ms returned sat
[2024-06-02 19:43:38] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2024-06-02 19:43:38] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 3 ms to minimize.
[2024-06-02 19:43:39] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 5 ms to minimize.
[2024-06-02 19:43:39] [INFO ] Deduced a trap composed of 56 places in 91 ms of which 2 ms to minimize.
[2024-06-02 19:43:39] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 2 ms to minimize.
[2024-06-02 19:43:39] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 2 ms to minimize.
[2024-06-02 19:43:39] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 2 ms to minimize.
[2024-06-02 19:43:39] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 3 ms to minimize.
[2024-06-02 19:43:39] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 822 ms
[2024-06-02 19:43:39] [INFO ] Computed and/alt/rep : 158/250/158 causal constraints (skipped 0 transitions) in 22 ms.
[2024-06-02 19:43:40] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 2 ms to minimize.
[2024-06-02 19:43:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2024-06-02 19:43:40] [INFO ] Added : 149 causal constraints over 30 iterations in 663 ms. Result :sat
Minimization took 105 ms.
[2024-06-02 19:43:40] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-06-02 19:43:40] [INFO ] [Real]Absence check using 9 positive and 12 generalized place invariants in 6 ms returned sat
[2024-06-02 19:43:40] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2024-06-02 19:43:40] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 2 ms to minimize.
[2024-06-02 19:43:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:43:40] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 19:43:40] [INFO ] [Nat]Absence check using 9 positive and 12 generalized place invariants in 5 ms returned sat
[2024-06-02 19:43:40] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2024-06-02 19:43:41] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 3 ms to minimize.
[2024-06-02 19:43:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2024-06-02 19:43:41] [INFO ] Computed and/alt/rep : 158/250/158 causal constraints (skipped 0 transitions) in 17 ms.
[2024-06-02 19:43:41] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 2 ms to minimize.
[2024-06-02 19:43:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2024-06-02 19:43:41] [INFO ] Added : 145 causal constraints over 30 iterations in 603 ms. Result :sat
Minimization took 101 ms.
[2024-06-02 19:43:41] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2024-06-02 19:43:41] [INFO ] [Real]Absence check using 9 positive and 12 generalized place invariants in 6 ms returned sat
[2024-06-02 19:43:41] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2024-06-02 19:43:41] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 2 ms to minimize.
[2024-06-02 19:43:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:43:42] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 19:43:42] [INFO ] [Nat]Absence check using 9 positive and 12 generalized place invariants in 5 ms returned sat
[2024-06-02 19:43:42] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2024-06-02 19:43:42] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 3 ms to minimize.
[2024-06-02 19:43:42] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 2 ms to minimize.
[2024-06-02 19:43:42] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-06-02 19:43:42] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-02 19:43:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 341 ms
[2024-06-02 19:43:42] [INFO ] Computed and/alt/rep : 158/250/158 causal constraints (skipped 0 transitions) in 16 ms.
[2024-06-02 19:43:43] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-06-02 19:43:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2024-06-02 19:43:43] [INFO ] Added : 142 causal constraints over 29 iterations in 558 ms. Result :sat
Minimization took 101 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
FORMULA MedleyA-PT-13-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-13-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 173 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p90) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 158/158 transitions.
Graph (complete) has 268 edges and 173 vertex of which 172 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 2 places and 2 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 166 transition count 124
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 73 place count 134 transition count 122
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 133 transition count 122
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 74 place count 133 transition count 95
Deduced a syphon composed of 27 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 55 rules applied. Total rules applied 129 place count 105 transition count 95
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 131 place count 104 transition count 94
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 132 place count 103 transition count 94
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 147 place count 88 transition count 79
Iterating global reduction 5 with 15 rules applied. Total rules applied 162 place count 88 transition count 79
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 162 place count 88 transition count 74
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 172 place count 83 transition count 74
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 173 place count 82 transition count 73
Iterating global reduction 5 with 1 rules applied. Total rules applied 174 place count 82 transition count 73
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 175 place count 81 transition count 72
Iterating global reduction 5 with 1 rules applied. Total rules applied 176 place count 81 transition count 72
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 177 place count 80 transition count 71
Iterating global reduction 5 with 1 rules applied. Total rules applied 178 place count 80 transition count 71
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 222 place count 58 transition count 49
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 236 place count 51 transition count 64
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 237 place count 51 transition count 63
Free-agglomeration rule applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 242 place count 51 transition count 58
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 247 place count 46 transition count 58
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 250 place count 46 transition count 55
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 254 place count 43 transition count 54
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 7 with 11 rules applied. Total rules applied 265 place count 43 transition count 43
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 266 place count 42 transition count 42
Iterating global reduction 7 with 1 rules applied. Total rules applied 267 place count 42 transition count 42
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 268 place count 41 transition count 41
Iterating global reduction 7 with 1 rules applied. Total rules applied 269 place count 41 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 270 place count 41 transition count 40
Applied a total of 270 rules in 128 ms. Remains 41 /173 variables (removed 132) and now considering 40/158 (removed 118) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 41/173 places, 40/158 transitions.
// Phase 1: matrix 40 rows 41 cols
[2024-06-02 19:43:43] [INFO ] Computed 14 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (138223 resets) in 958 ms. (1042 steps per ms)
FORMULA MedleyA-PT-13-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (54527 resets) in 490 ms. (2036 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
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 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 7843 ms.
ITS solved all properties within timeout

BK_STOP 1717357425119

--------------------
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 UpperBounds -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="MedleyA-PT-13"
export BK_EXAMINATION="UpperBounds"
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 MedleyA-PT-13, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r579-smll-171734921200101"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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