fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r484-smll-171624275400142
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
491.411 12783.00 30916.00 607.20 TTFTTFTFTFTFTFFF 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-171624275400142.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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r484-smll-171624275400142
=====================================================================

--------------------
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-ReachabilityCardinality-2024-00
FORMULA_NAME DLCround-PT-04b-ReachabilityCardinality-2024-01
FORMULA_NAME DLCround-PT-04b-ReachabilityCardinality-2024-02
FORMULA_NAME DLCround-PT-04b-ReachabilityCardinality-2024-03
FORMULA_NAME DLCround-PT-04b-ReachabilityCardinality-2024-04
FORMULA_NAME DLCround-PT-04b-ReachabilityCardinality-2024-05
FORMULA_NAME DLCround-PT-04b-ReachabilityCardinality-2024-06
FORMULA_NAME DLCround-PT-04b-ReachabilityCardinality-2024-07
FORMULA_NAME DLCround-PT-04b-ReachabilityCardinality-2024-08
FORMULA_NAME DLCround-PT-04b-ReachabilityCardinality-2024-09
FORMULA_NAME DLCround-PT-04b-ReachabilityCardinality-2024-10
FORMULA_NAME DLCround-PT-04b-ReachabilityCardinality-2024-11
FORMULA_NAME DLCround-PT-04b-ReachabilityCardinality-2024-12
FORMULA_NAME DLCround-PT-04b-ReachabilityCardinality-2024-13
FORMULA_NAME DLCround-PT-04b-ReachabilityCardinality-2024-14
FORMULA_NAME DLCround-PT-04b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717221802342

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
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:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 06:03:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:03:25] [INFO ] Load time of PNML (sax parser for PT used): 532 ms
[2024-06-01 06:03:25] [INFO ] Transformed 1680 places.
[2024-06-01 06:03:25] [INFO ] Transformed 2364 transitions.
[2024-06-01 06:03:25] [INFO ] Found NUPN structural information;
[2024-06-01 06:03:25] [INFO ] Parsed PT model containing 1680 places and 2364 transitions and 6156 arcs in 823 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 60 ms.
Working with output stream class java.io.PrintStream
FORMULA DLCround-PT-04b-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-04b-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-04b-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-04b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2253 ms. (17 steps per ms) remains 1/12 properties
FORMULA DLCround-PT-04b-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-04b-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-04b-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-04b-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-04b-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-04b-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-04b-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-04b-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-04b-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-04b-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-04b-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 606 ms. (65 steps per ms) remains 1/1 properties
// Phase 1: matrix 2364 rows 1680 cols
[2024-06-01 06:03:27] [INFO ] Computed 69 invariants in 61 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 755/765 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 755/773 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 0/773 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1680/4044 variables, and 834 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1927 ms.
Refiners :[Domain max(s): 765/1680 constraints, Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 0/1680 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 755/765 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 755/773 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 0/773 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 915/1680 variables, 61/834 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1680 variables, 915/1749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:03:30] [INFO ] Deduced a trap composed of 131 places in 444 ms of which 30 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1680 variables, 1/1750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1680 variables, 0/1750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2364/4044 variables, 1680/3430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4044 variables, 1/3431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:03:33] [INFO ] Deduced a trap composed of 128 places in 619 ms of which 86 ms to minimize.
[2024-06-01 06:03:33] [INFO ] Deduced a trap composed of 126 places in 517 ms of which 9 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/4044 variables, 2/3433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4044 variables, 0/3433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/4044 variables, 0/3433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4044/4044 variables, and 3433 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5006 ms.
Refiners :[Domain max(s): 1680/1680 constraints, Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 1680/1680 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 7163ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 10 out of 1680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1680/1680 places, 2364/2364 transitions.
Graph (trivial) has 1598 edges and 1680 vertex of which 321 / 1680 are part of one of the 25 SCC in 18 ms
Free SCC test removed 296 places
Drop transitions (Empty/Sink Transition effects.) removed 333 transitions
Reduce isomorphic transitions removed 333 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 664 transitions
Trivial Post-agglo rules discarded 664 transitions
Performed 664 trivial Post agglomeration. Transition count delta: 664
Iterating post reduction 0 with 664 rules applied. Total rules applied 665 place count 1384 transition count 1367
Reduce places removed 664 places and 0 transitions.
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 713 rules applied. Total rules applied 1378 place count 720 transition count 1318
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 2 with 30 rules applied. Total rules applied 1408 place count 698 transition count 1310
Reduce places removed 4 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 3 with 8 rules applied. Total rules applied 1416 place count 694 transition count 1306
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1420 place count 690 transition count 1306
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 1420 place count 690 transition count 1300
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 1432 place count 684 transition count 1300
Discarding 190 places :
Symmetric choice reduction at 5 with 190 rule applications. Total rules 1622 place count 494 transition count 1110
Iterating global reduction 5 with 190 rules applied. Total rules applied 1812 place count 494 transition count 1110
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 76 Pre rules applied. Total rules applied 1812 place count 494 transition count 1034
Deduced a syphon composed of 76 places in 8 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 5 with 152 rules applied. Total rules applied 1964 place count 418 transition count 1034
Discarding 36 places :
Symmetric choice reduction at 5 with 36 rule applications. Total rules 2000 place count 382 transition count 770
Iterating global reduction 5 with 36 rules applied. Total rules applied 2036 place count 382 transition count 770
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 2051 place count 382 transition count 755
Performed 98 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 6 with 196 rules applied. Total rules applied 2247 place count 284 transition count 653
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 2250 place count 284 transition count 650
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2251 place count 283 transition count 642
Iterating global reduction 7 with 1 rules applied. Total rules applied 2252 place count 283 transition count 642
Performed 30 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 7 with 60 rules applied. Total rules applied 2312 place count 253 transition count 830
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 2326 place count 253 transition count 816
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 2337 place count 242 transition count 656
Iterating global reduction 8 with 11 rules applied. Total rules applied 2348 place count 242 transition count 656
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 8 with 21 rules applied. Total rules applied 2369 place count 242 transition count 635
Drop transitions (Redundant composition of simpler transitions.) removed 73 transitions
Redundant transition composition rules discarded 73 transitions
Iterating global reduction 9 with 73 rules applied. Total rules applied 2442 place count 242 transition count 562
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 2447 place count 237 transition count 522
Iterating global reduction 9 with 5 rules applied. Total rules applied 2452 place count 237 transition count 522
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 2457 place count 237 transition count 517
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 2465 place count 233 transition count 549
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 2470 place count 233 transition count 544
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 11 with 15 rules applied. Total rules applied 2485 place count 233 transition count 529
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 2487 place count 232 transition count 540
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 2489 place count 232 transition count 538
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 12 with 9 rules applied. Total rules applied 2498 place count 232 transition count 529
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 2500 place count 231 transition count 541
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 2501 place count 231 transition count 540
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 2503 place count 231 transition count 538
Free-agglomeration rule applied 130 times with reduction of 66 identical transitions.
Iterating global reduction 13 with 130 rules applied. Total rules applied 2633 place count 231 transition count 342
Reduce places removed 130 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 154 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 156 transitions.
Graph (complete) has 264 edges and 101 vertex of which 98 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Iterating post reduction 13 with 287 rules applied. Total rules applied 2920 place count 98 transition count 186
Discarding 16 places :
Symmetric choice reduction at 14 with 16 rule applications. Total rules 2936 place count 82 transition count 159
Iterating global reduction 14 with 16 rules applied. Total rules applied 2952 place count 82 transition count 159
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 2954 place count 81 transition count 158
Drop transitions (Redundant composition of simpler transitions.) removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 14 with 29 rules applied. Total rules applied 2983 place count 81 transition count 129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 2984 place count 80 transition count 129
Discarding 7 places :
Symmetric choice reduction at 15 with 7 rule applications. Total rules 2991 place count 73 transition count 121
Iterating global reduction 15 with 7 rules applied. Total rules applied 2998 place count 73 transition count 121
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 2999 place count 73 transition count 121
Applied a total of 2999 rules in 641 ms. Remains 73 /1680 variables (removed 1607) and now considering 121/2364 (removed 2243) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 660 ms. Remains : 73/1680 places, 121/2364 transitions.
RANDOM walk for 3456 steps (1 resets) in 50 ms. (67 steps per ms) remains 0/1 properties
FORMULA DLCround-PT-04b-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 10103 ms.
ITS solved all properties within timeout

BK_STOP 1717221815125

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DLCround-PT-04b"
export BK_EXAMINATION="ReachabilityCardinality"
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 ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r484-smll-171624275400142"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;