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.r504-tall-171649612600375.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 LeafsetExtension-PT-S32C3, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r504-tall-171649612600375
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 19 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 19 18:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Apr 12 13:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Apr 12 13:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Apr 12 13:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Apr 12 13:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.4M 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 LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-00
FORMULA_NAME LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-01
FORMULA_NAME LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-02
FORMULA_NAME LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-03
FORMULA_NAME LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-04
FORMULA_NAME LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-05
FORMULA_NAME LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-06
FORMULA_NAME LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-07
FORMULA_NAME LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-08
FORMULA_NAME LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-09
FORMULA_NAME LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-10
FORMULA_NAME LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-11
FORMULA_NAME LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-12
FORMULA_NAME LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-13
FORMULA_NAME LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-14
FORMULA_NAME LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717228653206

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S32C3
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:57:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:57:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:57:34] [INFO ] Load time of PNML (sax parser for PT used): 293 ms
[2024-06-01 07:57:34] [INFO ] Transformed 5622 places.
[2024-06-01 07:57:34] [INFO ] Transformed 5449 transitions.
[2024-06-01 07:57:34] [INFO ] Parsed PT model containing 5622 places and 5449 transitions and 17500 arcs in 449 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1537 resets) in 1786 ms. (22 steps per ms) remains 11/16 properties
FORMULA LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (118 resets) in 447 ms. (89 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (102 resets) in 225 ms. (177 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (119 resets) in 731 ms. (54 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (99 resets) in 184 ms. (216 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (101 resets) in 325 ms. (122 steps per ms) remains 10/11 properties
FORMULA LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (103 resets) in 158 ms. (251 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (48 resets) in 88 ms. (449 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (102 resets) in 59 ms. (666 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (65 resets) in 219 ms. (181 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (48 resets) in 107 ms. (370 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (116 resets) in 62 ms. (634 steps per ms) remains 10/10 properties
// Phase 1: matrix 5449 rows 5622 cols
[2024-06-01 07:57:36] [INFO ] Computed 173 invariants in 368 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 19/271 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 1/272 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-03 is UNSAT
FORMULA LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-07 is UNSAT
FORMULA LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-10 is UNSAT
FORMULA LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-14 is UNSAT
FORMULA LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 5230/5502 variables, 97/117 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5502 variables, 0/117 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 15/5517 variables, 15/132 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5517 variables, 0/132 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 105/5622 variables, 41/173 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5622 variables, 0/173 constraints. Problems are: Problem set: 4 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 11071/11071 variables, and 5795 constraints, problems are : Problem set: 4 solved, 6 unsolved in 5066 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 138/138 constraints, State Equation: 5622/5622 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 3/62 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 5005/5067 variables, 44/47 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5067 variables, 0/47 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 32/5099 variables, 32/79 constraints. Problems are: Problem set: 4 solved, 6 unsolved
[2024-06-01 07:57:49] [INFO ] Deduced a trap composed of 200 places in 5472 ms of which 243 ms to minimize.
SMT process timed out in 12763ms, After SMT, problems are : Problem set: 4 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 59 out of 5622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5622/5622 places, 5449/5449 transitions.
Graph (complete) has 11001 edges and 5622 vertex of which 2790 are kept as prefixes of interest. Removing 2832 places using SCC suffix rule.13 ms
Discarding 2832 places :
Also discarding 1379 output transitions
Drop transitions (Output transitions of discarded places.) removed 1379 transitions
Drop transitions (Empty/Sink Transition effects.) removed 334 transitions
Reduce isomorphic transitions removed 334 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 525 transitions
Trivial Post-agglo rules discarded 525 transitions
Performed 525 trivial Post agglomeration. Transition count delta: 525
Iterating post reduction 0 with 859 rules applied. Total rules applied 860 place count 2790 transition count 3211
Reduce places removed 526 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 529 rules applied. Total rules applied 1389 place count 2264 transition count 3208
Reduce places removed 3 places and 0 transitions.
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Iterating post reduction 2 with 105 rules applied. Total rules applied 1494 place count 2261 transition count 3106
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 3 with 102 rules applied. Total rules applied 1596 place count 2159 transition count 3106
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 38 Pre rules applied. Total rules applied 1596 place count 2159 transition count 3068
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 1672 place count 2121 transition count 3068
Discarding 708 places :
Symmetric choice reduction at 4 with 708 rule applications. Total rules 2380 place count 1413 transition count 2360
Iterating global reduction 4 with 708 rules applied. Total rules applied 3088 place count 1413 transition count 2360
Discarding 484 places :
Symmetric choice reduction at 4 with 484 rule applications. Total rules 3572 place count 929 transition count 1876
Iterating global reduction 4 with 484 rules applied. Total rules applied 4056 place count 929 transition count 1876
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 4060 place count 929 transition count 1872
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 4064 place count 925 transition count 1872
Partial Free-agglomeration rule applied 49 times.
Drop transitions (Partial Free agglomeration) removed 49 transitions
Iterating global reduction 5 with 49 rules applied. Total rules applied 4113 place count 925 transition count 1872
Applied a total of 4113 rules in 832 ms. Remains 925 /5622 variables (removed 4697) and now considering 1872/5449 (removed 3577) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 842 ms. Remains : 925/5622 places, 1872/5449 transitions.
RANDOM walk for 40000 steps (2689 resets) in 767 ms. (52 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (163 resets) in 141 ms. (281 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (139 resets) in 147 ms. (270 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (144 resets) in 74 ms. (533 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (135 resets) in 87 ms. (454 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (144 resets) in 72 ms. (548 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (163 resets) in 93 ms. (425 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 114294 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :0 out of 6
Probabilistic random walk after 114294 steps, saw 34764 distinct states, run finished after 3004 ms. (steps per millisecond=38 ) properties seen :0
[2024-06-01 07:57:53] [INFO ] Flow matrix only has 1486 transitions (discarded 386 similar events)
// Phase 1: matrix 1486 rows 925 cols
[2024-06-01 07:57:53] [INFO ] Computed 61 invariants in 15 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 166/225 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/226 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 465/691 variables, 226/242 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/691 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1278/1969 variables, 257/499 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1969 variables, 31/530 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1969 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 416/2385 variables, 14/544 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2385 variables, 416/960 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2385 variables, 0/960 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 26/2411 variables, 26/986 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2411 variables, 0/986 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/2411 variables, 0/986 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2411/2411 variables, and 986 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1424 ms.
Refiners :[Generalized P Invariants (flows): 61/61 constraints, State Equation: 925/925 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 166/225 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/226 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 465/691 variables, 226/242 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/691 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/691 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1278/1969 variables, 257/500 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1969 variables, 31/531 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1969 variables, 5/536 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1969 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 416/2385 variables, 14/550 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2385 variables, 416/966 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2385 variables, 0/966 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 26/2411 variables, 26/992 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2411 variables, 0/992 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/2411 variables, 0/992 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2411/2411 variables, and 992 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2194 ms.
Refiners :[Generalized P Invariants (flows): 61/61 constraints, State Equation: 925/925 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 3660ms problems are : Problem set: 0 solved, 6 unsolved
FORMULA LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-00 FALSE TECHNIQUES PARIKH_WALK
FORMULA LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-01 FALSE TECHNIQUES PARIKH_WALK
FORMULA LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-04 FALSE TECHNIQUES PARIKH_WALK
FORMULA LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-08 FALSE TECHNIQUES PARIKH_WALK
FORMULA LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-09 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
FORMULA LeafsetExtension-PT-S32C3-ReachabilityFireability-2024-15 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 6 properties in 64 ms.
All properties solved without resorting to model-checking.
Total runtime 22807 ms.
ITS solved all properties within timeout

BK_STOP 1717228677232

--------------------
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="LeafsetExtension-PT-S32C3"
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 LeafsetExtension-PT-S32C3, 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 r504-tall-171649612600375"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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