fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r484-smll-171624275400143
Last Updated
July 7, 2024

About the Execution of LTSMin+red for DLCround-PT-04b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
433.987 15532.00 35560.00 435.20 TTTFFTFFTTFTFTTT normal

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.r484-smll-171624275400143.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 DLCround-PT-04b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r484-smll-171624275400143
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 924K
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.6K Apr 13 13:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 48K Apr 13 13:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 13 13:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 13 13:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 547K 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 DLCround-PT-04b-ReachabilityFireability-2024-00
FORMULA_NAME DLCround-PT-04b-ReachabilityFireability-2024-01
FORMULA_NAME DLCround-PT-04b-ReachabilityFireability-2024-02
FORMULA_NAME DLCround-PT-04b-ReachabilityFireability-2024-03
FORMULA_NAME DLCround-PT-04b-ReachabilityFireability-2024-04
FORMULA_NAME DLCround-PT-04b-ReachabilityFireability-2024-05
FORMULA_NAME DLCround-PT-04b-ReachabilityFireability-2024-06
FORMULA_NAME DLCround-PT-04b-ReachabilityFireability-2024-07
FORMULA_NAME DLCround-PT-04b-ReachabilityFireability-2024-08
FORMULA_NAME DLCround-PT-04b-ReachabilityFireability-2024-09
FORMULA_NAME DLCround-PT-04b-ReachabilityFireability-2024-10
FORMULA_NAME DLCround-PT-04b-ReachabilityFireability-2024-11
FORMULA_NAME DLCround-PT-04b-ReachabilityFireability-2024-12
FORMULA_NAME DLCround-PT-04b-ReachabilityFireability-2024-13
FORMULA_NAME DLCround-PT-04b-ReachabilityFireability-2024-14
FORMULA_NAME DLCround-PT-04b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717221829812

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-04b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:03:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 06:03:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:03:53] [INFO ] Load time of PNML (sax parser for PT used): 501 ms
[2024-06-01 06:03:53] [INFO ] Transformed 1680 places.
[2024-06-01 06:03:53] [INFO ] Transformed 2364 transitions.
[2024-06-01 06:03:53] [INFO ] Found NUPN structural information;
[2024-06-01 06:03:53] [INFO ] Parsed PT model containing 1680 places and 2364 transitions and 6156 arcs in 805 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 38 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 3142 ms. (12 steps per ms) remains 4/16 properties
FORMULA DLCround-PT-04b-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-04b-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-04b-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-04b-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-04b-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-04b-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-04b-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-04b-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-04b-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-04b-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-04b-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-04b-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 229 ms. (173 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 384 ms. (103 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 376 ms. (106 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 730 ms. (54 steps per ms) remains 4/4 properties
// Phase 1: matrix 2364 rows 1680 cols
[2024-06-01 06:03:55] [INFO ] Computed 69 invariants in 63 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 69/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1211/1280 variables, 29/98 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1280 variables, 1211/1309 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1280 variables, 0/1309 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 400/1680 variables, 40/1349 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1680 variables, 400/1749 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1680 variables, 0/1749 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2364/4044 variables, 1680/3429 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4044 variables, 0/3429 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/4044 variables, 0/3429 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4044/4044 variables, and 3429 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3089 ms.
Refiners :[Domain max(s): 1680/1680 constraints, Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 1680/1680 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 69/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1211/1280 variables, 29/98 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1280 variables, 1211/1309 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 06:04:00] [INFO ] Deduced a trap composed of 131 places in 311 ms of which 42 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1280 variables, 1/1310 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1280 variables, 0/1310 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 400/1680 variables, 40/1350 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1680 variables, 400/1750 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 06:04:01] [INFO ] Deduced a trap composed of 135 places in 377 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1680 variables, 1/1751 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1680 variables, 0/1751 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2364/4044 variables, 1680/3431 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4044 variables, 4/3435 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4044/4044 variables, and 3435 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5011 ms.
Refiners :[Domain max(s): 1680/1680 constraints, Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 1680/1680 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 8344ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 69 out of 1680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1680/1680 places, 2364/2364 transitions.
Graph (trivial) has 1450 edges and 1680 vertex of which 180 / 1680 are part of one of the 21 SCC in 10 ms
Free SCC test removed 159 places
Drop transitions (Empty/Sink Transition effects.) removed 183 transitions
Reduce isomorphic transitions removed 183 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 659 transitions
Trivial Post-agglo rules discarded 659 transitions
Performed 659 trivial Post agglomeration. Transition count delta: 659
Iterating post reduction 0 with 659 rules applied. Total rules applied 660 place count 1521 transition count 1522
Reduce places removed 659 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 691 rules applied. Total rules applied 1351 place count 862 transition count 1490
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 20 rules applied. Total rules applied 1371 place count 846 transition count 1486
Reduce places removed 2 places and 0 transitions.
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Iterating post reduction 3 with 30 rules applied. Total rules applied 1401 place count 844 transition count 1458
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 1429 place count 816 transition count 1458
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 36 Pre rules applied. Total rules applied 1429 place count 816 transition count 1422
Deduced a syphon composed of 36 places in 3 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 5 with 72 rules applied. Total rules applied 1501 place count 780 transition count 1422
Discarding 190 places :
Symmetric choice reduction at 5 with 190 rule applications. Total rules 1691 place count 590 transition count 1232
Iterating global reduction 5 with 190 rules applied. Total rules applied 1881 place count 590 transition count 1232
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 5 with 13 rules applied. Total rules applied 1894 place count 590 transition count 1219
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1900 place count 586 transition count 1217
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 66 Pre rules applied. Total rules applied 1900 place count 586 transition count 1151
Deduced a syphon composed of 66 places in 8 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 7 with 132 rules applied. Total rules applied 2032 place count 520 transition count 1151
Discarding 17 places :
Symmetric choice reduction at 7 with 17 rule applications. Total rules 2049 place count 503 transition count 1034
Iterating global reduction 7 with 17 rules applied. Total rules applied 2066 place count 503 transition count 1034
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 2071 place count 503 transition count 1029
Performed 126 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 126 places in 1 ms
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 8 with 252 rules applied. Total rules applied 2323 place count 377 transition count 901
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 2325 place count 377 transition count 899
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 2329 place count 373 transition count 867
Iterating global reduction 9 with 4 rules applied. Total rules applied 2333 place count 373 transition count 867
Performed 39 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 9 with 78 rules applied. Total rules applied 2411 place count 334 transition count 1132
Drop transitions (Empty/Sink Transition effects.) removed 29 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 9 with 33 rules applied. Total rules applied 2444 place count 334 transition count 1099
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 2449 place count 329 transition count 1030
Iterating global reduction 10 with 5 rules applied. Total rules applied 2454 place count 329 transition count 1030
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 2457 place count 329 transition count 1027
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 2459 place count 328 transition count 1040
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 2461 place count 328 transition count 1038
Drop transitions (Redundant composition of simpler transitions.) removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 12 with 39 rules applied. Total rules applied 2500 place count 328 transition count 999
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 2501 place count 327 transition count 990
Iterating global reduction 12 with 1 rules applied. Total rules applied 2502 place count 327 transition count 990
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 2503 place count 327 transition count 989
Free-agglomeration rule applied 103 times with reduction of 21 identical transitions.
Iterating global reduction 13 with 103 rules applied. Total rules applied 2606 place count 327 transition count 865
Reduce places removed 103 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 97 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 13 with 202 rules applied. Total rules applied 2808 place count 224 transition count 766
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 14 with 25 rules applied. Total rules applied 2833 place count 224 transition count 741
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 14 with 1 rules applied. Total rules applied 2834 place count 224 transition count 748
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 2835 place count 223 transition count 748
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 15 with 9 rules applied. Total rules applied 2844 place count 223 transition count 739
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 15 with 6 rules applied. Total rules applied 2850 place count 223 transition count 739
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 2851 place count 223 transition count 738
Applied a total of 2851 rules in 603 ms. Remains 223 /1680 variables (removed 1457) and now considering 738/2364 (removed 1626) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 621 ms. Remains : 223/1680 places, 738/2364 transitions.
RANDOM walk for 40000 steps (8 resets) in 914 ms. (43 steps per ms) remains 3/4 properties
FORMULA DLCround-PT-04b-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 2/3 properties
FORMULA DLCround-PT-04b-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 1/2 properties
FORMULA DLCround-PT-04b-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 33213 steps (6 resets) in 194 ms. (170 steps per ms) remains 0/1 properties
FORMULA DLCround-PT-04b-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 12256 ms.
ITS solved all properties within timeout

BK_STOP 1717221845344

--------------------
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="DLCround-PT-04b"
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 DLCround-PT-04b, 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 r484-smll-171624275400143"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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