Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r343-tall-167889215200166.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is RERS2020-PT-pb107, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r343-tall-167889215200166
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 59M
-rw-r--r-- 1 mcc users 6.9K Feb 26 08:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 08:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 08:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 08:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 16:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 08:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 26 08:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 26 08:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 26 08:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 59M Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1679136286271

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=RERS2020-PT-pb107
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 10:44:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2023-03-18 10:44:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 10:44:49] [INFO ] Load time of PNML (sax parser for PT used): 1856 ms
[2023-03-18 10:44:50] [INFO ] Transformed 1382 places.
[2023-03-18 10:44:50] [INFO ] Transformed 104643 transitions.
[2023-03-18 10:44:50] [INFO ] Found NUPN structural information;
[2023-03-18 10:44:50] [INFO ] Parsed PT model containing 1382 places and 104643 transitions and 417030 arcs in 2296 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 2 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 11427 transitions
Reduce redundant transitions removed 11427 transitions.
Built sparse matrix representations for Structural reductions in 45 ms.285680KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 1382/1382 places, 93216/93216 transitions.
Computed a total of 273 stabilizing places and 30825 stable transitions
Graph (complete) has 95856 edges and 1382 vertex of which 1381 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.463 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 12 places
Computed a total of 261 stabilizing places and 30825 stable transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 1369 transition count 93215
Reduce places removed 1 places and 0 transitions.
Computed a total of 260 stabilizing places and 30824 stable transitions
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 1368 transition count 93215
Computed a total of 260 stabilizing places and 30824 stable transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 15 place count 1368 transition count 93213
Deduced a syphon composed of 2 places in 87 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 1366 transition count 93213
Computed a total of 260 stabilizing places and 30824 stable transitions
Performed 17 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 17 places in 122 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 53 place count 1349 transition count 93193
Ensure Unique test removed 439 transitions
Reduce isomorphic transitions removed 439 transitions.
Computed a total of 258 stabilizing places and 30686 stable transitions
Iterating post reduction 2 with 439 rules applied. Total rules applied 492 place count 1349 transition count 92754
Computed a total of 258 stabilizing places and 30686 stable transitions
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 69 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 500 place count 1345 transition count 92750
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Computed a total of 258 stabilizing places and 30630 stable transitions
Iterating post reduction 3 with 96 rules applied. Total rules applied 596 place count 1345 transition count 92654
Computed a total of 258 stabilizing places and 30630 stable transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 60 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 598 place count 1344 transition count 92655
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Computed a total of 258 stabilizing places and 30630 stable transitions
Iterating post reduction 4 with 3 rules applied. Total rules applied 601 place count 1344 transition count 92652
Computed a total of 258 stabilizing places and 30630 stable transitions
Computed a total of 258 stabilizing places and 30630 stable transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 602 place count 1343 transition count 92651
Computed a total of 257 stabilizing places and 30632 stable transitions
Computed a total of 257 stabilizing places and 30632 stable transitions
Applied a total of 602 rules in 6804 ms. Remains 1343 /1382 variables (removed 39) and now considering 92651/93216 (removed 565) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 6823 ms. Remains : 1343/1382 places, 92651/93216 transitions.
Interrupted Random walk after 575918 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=19 )
[2023-03-18 10:45:28] [INFO ] Flow matrix only has 62309 transitions (discarded 30342 similar events)
// Phase 1: matrix 62309 rows 1343 cols
[2023-03-18 10:45:28] [INFO ] Computed 12 place invariants in 359 ms
[2023-03-18 10:45:38] [INFO ] [Real]Absence check using 12 positive place invariants in 38 ms returned sat
[2023-03-18 10:45:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 10:45:50] [INFO ] [Real]Absence check using state equation in 12273 ms returned sat
[2023-03-18 10:45:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 10:46:01] [INFO ] [Nat]Absence check using 12 positive place invariants in 31 ms returned sat
[2023-03-18 10:46:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 10:46:13] [INFO ] [Nat]Absence check using state equation in 12204 ms returned sat
[2023-03-18 10:46:14] [INFO ] State equation strengthened by 3673 read => feed constraints.
[2023-03-18 10:46:22] [INFO ] [Nat]Added 3673 Read/Feed constraints in 7248 ms returned sat
[2023-03-18 10:46:28] [INFO ] Deduced a trap composed of 20 places in 5229 ms of which 4 ms to minimize.
[2023-03-18 10:46:33] [INFO ] Deduced a trap composed of 16 places in 5027 ms of which 1 ms to minimize.
[2023-03-18 10:46:39] [INFO ] Deduced a trap composed of 40 places in 5053 ms of which 1 ms to minimize.
[2023-03-18 10:46:45] [INFO ] Deduced a trap composed of 84 places in 4662 ms of which 2 ms to minimize.
[2023-03-18 10:46:51] [INFO ] Deduced a trap composed of 69 places in 5408 ms of which 2 ms to minimize.
[2023-03-18 10:46:57] [INFO ] Deduced a trap composed of 66 places in 5482 ms of which 1 ms to minimize.
[2023-03-18 10:47:03] [INFO ] Deduced a trap composed of 47 places in 5242 ms of which 1 ms to minimize.
[2023-03-18 10:47:09] [INFO ] Deduced a trap composed of 138 places in 5424 ms of which 2 ms to minimize.
[2023-03-18 10:47:16] [INFO ] Deduced a trap composed of 28 places in 6047 ms of which 1 ms to minimize.
[2023-03-18 10:47:23] [INFO ] Deduced a trap composed of 54 places in 6130 ms of which 1 ms to minimize.
[2023-03-18 10:47:30] [INFO ] Deduced a trap composed of 171 places in 6204 ms of which 1 ms to minimize.
[2023-03-18 10:47:39] [INFO ] Deduced a trap composed of 208 places in 8083 ms of which 2 ms to minimize.
[2023-03-18 10:47:48] [INFO ] Deduced a trap composed of 64 places in 8428 ms of which 2 ms to minimize.
[2023-03-18 10:47:57] [INFO ] Deduced a trap composed of 122 places in 7856 ms of which 2 ms to minimize.
[2023-03-18 10:48:04] [INFO ] Deduced a trap composed of 209 places in 6572 ms of which 1 ms to minimize.
[2023-03-18 10:48:11] [INFO ] Deduced a trap composed of 68 places in 6269 ms of which 1 ms to minimize.
[2023-03-18 10:48:19] [INFO ] Deduced a trap composed of 176 places in 6268 ms of which 1 ms to minimize.
[2023-03-18 10:48:26] [INFO ] Deduced a trap composed of 51 places in 6306 ms of which 1 ms to minimize.
[2023-03-18 10:48:31] [INFO ] Deduced a trap composed of 73 places in 4846 ms of which 1 ms to minimize.
[2023-03-18 10:48:36] [INFO ] Deduced a trap composed of 96 places in 4128 ms of which 1 ms to minimize.
[2023-03-18 10:48:41] [INFO ] Deduced a trap composed of 76 places in 4383 ms of which 1 ms to minimize.
[2023-03-18 10:48:45] [INFO ] Deduced a trap composed of 204 places in 3102 ms of which 1 ms to minimize.
[2023-03-18 10:48:47] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 145716 ms
[2023-03-18 10:48:57] [INFO ] Computed and/alt/rep : 255/1158/255 causal constraints (skipped 62053 transitions) in 9858 ms.
[2023-03-18 10:49:08] [INFO ] Added : 7 causal constraints over 3 iterations in 20926 ms. Result :sat
Interrupted Parikh directed walk after 8658 steps, including 8658 resets, run timeout after 30002 ms. (steps per millisecond=0 )
Parikh directed walk for 8658 steps, including 8658 resets, run took 30003 ms. (steps per millisecond=0 )
Finished random directed walk after 483 steps, including 0 resets, run found a deadlock after 46 ms. (steps per millisecond=10 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 292054 ms.
ITS solved all properties within timeout

BK_STOP 1679136580914

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -timeout 180 -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="RERS2020-PT-pb107"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is RERS2020-PT-pb107, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r343-tall-167889215200166"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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