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-171624275500190.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-07b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r484-smll-171624275500190
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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.9K Apr 22 14:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 12:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 154K Apr 13 12:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 13 12:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 13 12:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:38 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 963K 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-07b-ReachabilityCardinality-2024-00
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-2024-01
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-2024-02
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-2024-03
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-2024-04
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-2024-05
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-2024-06
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-2024-07
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-2024-08
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-2024-09
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-2024-10
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-2024-11
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-2024-12
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-2024-13
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-2024-14
FORMULA_NAME DLCround-PT-07b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717225905535

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-07b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:11:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:11:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:11:49] [INFO ] Load time of PNML (sax parser for PT used): 571 ms
[2024-06-01 07:11:49] [INFO ] Transformed 2703 places.
[2024-06-01 07:11:49] [INFO ] Transformed 4071 transitions.
[2024-06-01 07:11:49] [INFO ] Found NUPN structural information;
[2024-06-01 07:11:49] [INFO ] Parsed PT model containing 2703 places and 4071 transitions and 11073 arcs in 944 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 40 ms.
Working with output stream class java.io.PrintStream
FORMULA DLCround-PT-07b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-07b-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-07b-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2553 ms. (15 steps per ms) remains 4/13 properties
FORMULA DLCround-PT-07b-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 616 ms. (64 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1327 ms. (30 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 4/4 properties
// Phase 1: matrix 4071 rows 2703 cols
[2024-06-01 07:11:52] [INFO ] Computed 132 invariants in 85 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 78/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 2355/2433 variables, 105/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2433 variables, 2355/2538 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2433 variables, 0/2538 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 270/2703 variables, 27/2565 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2703 variables, 270/2835 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2703 variables, 0/2835 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 4071/6774 variables, 2703/5538 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6774/6774 variables, and 5538 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5114 ms.
Refiners :[Domain max(s): 2703/2703 constraints, Positive P Invariants (semi-flows): 132/132 constraints, State Equation: 2703/2703 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/78 variables, 78/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 2355/2433 variables, 105/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2433 variables, 2355/2538 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 166 places in 521 ms of which 83 ms to minimize.
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 174 places in 588 ms of which 9 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 182 places in 377 ms of which 7 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 190 places in 316 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2433 variables, 4/2542 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2433 variables, 0/2542 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 270/2703 variables, 27/2569 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2703 variables, 270/2839 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2703/6774 variables, and 2839 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5010 ms.
Refiners :[Domain max(s): 2703/2703 constraints, Positive P Invariants (semi-flows): 132/132 constraints, State Equation: 0/2703 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 4/4 constraints]
After SMT, in 10472ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 78 out of 2703 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2703/2703 places, 4071/4071 transitions.
Graph (trivial) has 2406 edges and 2703 vertex of which 410 / 2703 are part of one of the 38 SCC in 15 ms
Free SCC test removed 372 places
Drop transitions (Empty/Sink Transition effects.) removed 420 transitions
Reduce isomorphic transitions removed 420 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 963 transitions
Trivial Post-agglo rules discarded 963 transitions
Performed 963 trivial Post agglomeration. Transition count delta: 963
Iterating post reduction 0 with 963 rules applied. Total rules applied 964 place count 2331 transition count 2688
Reduce places removed 963 places and 0 transitions.
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 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 1016 rules applied. Total rules applied 1980 place count 1368 transition count 2635
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 27 rules applied. Total rules applied 2007 place count 1346 transition count 2630
Reduce places removed 2 places and 0 transitions.
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Iterating post reduction 3 with 39 rules applied. Total rules applied 2046 place count 1344 transition count 2593
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 38 rules applied. Total rules applied 2084 place count 1307 transition count 2592
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 25 Pre rules applied. Total rules applied 2084 place count 1307 transition count 2567
Deduced a syphon composed of 25 places in 11 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 2134 place count 1282 transition count 2567
Discarding 297 places :
Symmetric choice reduction at 5 with 297 rule applications. Total rules 2431 place count 985 transition count 2270
Iterating global reduction 5 with 297 rules applied. Total rules applied 2728 place count 985 transition count 2270
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2729 place count 985 transition count 2269
Performed 116 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 116 Pre rules applied. Total rules applied 2729 place count 985 transition count 2153
Deduced a syphon composed of 116 places in 50 ms
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 6 with 232 rules applied. Total rules applied 2961 place count 869 transition count 2153
Discarding 41 places :
Symmetric choice reduction at 6 with 41 rule applications. Total rules 3002 place count 828 transition count 1711
Iterating global reduction 6 with 41 rules applied. Total rules applied 3043 place count 828 transition count 1711
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 3053 place count 828 transition count 1701
Performed 212 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 212 places in 3 ms
Reduce places removed 212 places and 0 transitions.
Iterating global reduction 7 with 424 rules applied. Total rules applied 3477 place count 616 transition count 1483
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 3482 place count 616 transition count 1478
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 3487 place count 611 transition count 1423
Iterating global reduction 8 with 5 rules applied. Total rules applied 3492 place count 611 transition count 1423
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 3493 place count 611 transition count 1422
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: -644
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 9 with 148 rules applied. Total rules applied 3641 place count 537 transition count 2066
Drop transitions (Empty/Sink Transition effects.) removed 107 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 109 transitions.
Iterating post reduction 9 with 109 rules applied. Total rules applied 3750 place count 537 transition count 1957
Discarding 17 places :
Symmetric choice reduction at 10 with 17 rule applications. Total rules 3767 place count 520 transition count 1564
Iterating global reduction 10 with 17 rules applied. Total rules applied 3784 place count 520 transition count 1564
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 3792 place count 520 transition count 1556
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 3796 place count 518 transition count 1582
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 3800 place count 518 transition count 1578
Drop transitions (Redundant composition of simpler transitions.) removed 128 transitions
Redundant transition composition rules discarded 128 transitions
Iterating global reduction 12 with 128 rules applied. Total rules applied 3928 place count 518 transition count 1450
Discarding 6 places :
Symmetric choice reduction at 12 with 6 rule applications. Total rules 3934 place count 512 transition count 1366
Iterating global reduction 12 with 6 rules applied. Total rules applied 3940 place count 512 transition count 1366
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 3946 place count 512 transition count 1360
Free-agglomeration rule applied 198 times with reduction of 78 identical transitions.
Iterating global reduction 13 with 198 rules applied. Total rules applied 4144 place count 512 transition count 1084
Reduce places removed 198 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 268 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 281 transitions.
Graph (complete) has 921 edges and 314 vertex of which 301 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 0 output transitions
Iterating post reduction 13 with 480 rules applied. Total rules applied 4624 place count 301 transition count 803
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 14 with 21 rules applied. Total rules applied 4645 place count 301 transition count 782
Discarding 18 places :
Symmetric choice reduction at 15 with 18 rule applications. Total rules 4663 place count 283 transition count 731
Iterating global reduction 15 with 18 rules applied. Total rules applied 4681 place count 283 transition count 731
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 4682 place count 283 transition count 730
Drop transitions (Redundant composition of simpler transitions.) removed 80 transitions
Redundant transition composition rules discarded 80 transitions
Iterating global reduction 16 with 80 rules applied. Total rules applied 4762 place count 283 transition count 650
Reduce places removed 3 places and 0 transitions.
Graph (complete) has 791 edges and 280 vertex of which 278 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 16 with 4 rules applied. Total rules applied 4766 place count 278 transition count 650
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 17 with 6 rules applied. Total rules applied 4772 place count 278 transition count 644
Discarding 15 places :
Symmetric choice reduction at 18 with 15 rule applications. Total rules 4787 place count 263 transition count 614
Iterating global reduction 18 with 15 rules applied. Total rules applied 4802 place count 263 transition count 614
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 4804 place count 262 transition count 620
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 4805 place count 262 transition count 619
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 18 with 3 rules applied. Total rules applied 4808 place count 262 transition count 619
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 4809 place count 262 transition count 618
Applied a total of 4809 rules in 1226 ms. Remains 262 /2703 variables (removed 2441) and now considering 618/4071 (removed 3453) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1242 ms. Remains : 262/2703 places, 618/4071 transitions.
RANDOM walk for 40000 steps (8 resets) in 1526 ms. (26 steps per ms) remains 1/4 properties
FORMULA DLCround-PT-07b-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-07b-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 36580 steps (7 resets) in 183 ms. (198 steps per ms) remains 0/1 properties
FORMULA DLCround-PT-07b-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 15874 ms.
ITS solved all properties within timeout

BK_STOP 1717225924496

--------------------
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-07b"
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-07b, 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-171624275500190"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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