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.r538-tall-171690548500546.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 Szymanski-PT-b06, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r538-tall-171690548500546
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 15:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 11 15:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.7M May 18 16:43 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 1717231615196

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Szymanski-PT-b06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:46:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2024-06-01 08:46:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:46:56] [INFO ] Load time of PNML (sax parser for PT used): 323 ms
[2024-06-01 08:46:56] [INFO ] Transformed 568 places.
[2024-06-01 08:46:56] [INFO ] Transformed 8320 transitions.
[2024-06-01 08:46:56] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 475 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 4 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 260 places in 18 ms
Reduce places removed 260 places and 256 transitions.
Built sparse matrix representations for Structural reductions in 16 ms.28634KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Computed a total of 12 stabilizing places and 2432 stable transitions
Graph (complete) has 12652 edges and 308 vertex of which 306 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.53 ms
Discarding 2 places :
Also discarding 0 output transitions
Computed a total of 12 stabilizing places and 2432 stable transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 305 transition count 7936
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Applied a total of 3 rules in 691 ms. Remains 305 /308 variables (removed 3) and now considering 7936/8064 (removed 128) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 705 ms. Remains : 305/308 places, 7936/8064 transitions.
Random walk for 1250002 steps, including 0 resets, run took 1566 ms (no deadlock found). (steps per millisecond=798 )
Random directed walk for 1250002 steps, including 0 resets, run took 2509 ms (no deadlock found). (steps per millisecond=498 )
[2024-06-01 08:47:01] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2024-06-01 08:47:01] [INFO ] Computed 1 invariants in 44 ms
[2024-06-01 08:47:02] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 10 ms returned sat
[2024-06-01 08:47:03] [INFO ] [Real]Absence check using state equation in 474 ms returned sat
[2024-06-01 08:47:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:47:03] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 7 ms returned sat
[2024-06-01 08:47:04] [INFO ] [Nat]Absence check using state equation in 578 ms returned sat
[2024-06-01 08:47:04] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 08:47:07] [INFO ] [Nat]Added 147 Read/Feed constraints in 2622 ms returned sat
[2024-06-01 08:47:07] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2721 transitions) in 566 ms.
[2024-06-01 08:47:08] [INFO ] Added : 0 causal constraints over 0 iterations in 782 ms. Result :sat
Parikh directed walk for 4000 steps, including 295 resets, run took 198 ms. (steps per millisecond=20 )
Random directed walk for 500005 steps, including 0 resets, run took 979 ms (no deadlock found). (steps per millisecond=510 )
Random walk for 500003 steps, including 0 resets, run took 547 ms (no deadlock found). (steps per millisecond=914 )
Random directed walk for 500003 steps, including 0 resets, run took 917 ms (no deadlock found). (steps per millisecond=545 )
Random walk for 500002 steps, including 0 resets, run took 710 ms (no deadlock found). (steps per millisecond=704 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Applied a total of 0 rules in 214 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2024-06-01 08:47:11] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-06-01 08:47:11] [INFO ] Invariant cache hit.
[2024-06-01 08:47:12] [INFO ] Implicit Places using invariants in 487 ms returned []
[2024-06-01 08:47:12] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-06-01 08:47:12] [INFO ] Invariant cache hit.
[2024-06-01 08:47:13] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 08:47:29] [INFO ] Implicit Places using invariants and state equation in 16934 ms returned []
Implicit Place search using SMT with State Equation took 17423 ms to find 0 implicit places.
[2024-06-01 08:47:30] [INFO ] Redundant transitions in 952 ms returned []
Running 7934 sub problems to find dead transitions.
[2024-06-01 08:47:30] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-06-01 08:47:30] [INFO ] Invariant cache hit.
[2024-06-01 08:47:30] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30200 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7934/7934 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7934 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30099 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7934 constraints, Known Traps: 0/0 constraints]
After SMT, in 89342ms problems are : Problem set: 0 solved, 7934 unsolved
Search for dead transitions found 0 dead transitions in 89444ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 108080 ms. Remains : 305/305 places, 7936/7936 transitions.
Random walk for 1250001 steps, including 0 resets, run took 1507 ms (no deadlock found). (steps per millisecond=829 )
Random directed walk for 1250000 steps, including 0 resets, run took 2461 ms (no deadlock found). (steps per millisecond=507 )
[2024-06-01 08:49:03] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-06-01 08:49:03] [INFO ] Invariant cache hit.
[2024-06-01 08:49:04] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 5 ms returned sat
[2024-06-01 08:49:04] [INFO ] [Real]Absence check using state equation in 392 ms returned sat
[2024-06-01 08:49:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:49:05] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 5 ms returned sat
[2024-06-01 08:49:05] [INFO ] [Nat]Absence check using state equation in 536 ms returned sat
[2024-06-01 08:49:05] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 08:49:08] [INFO ] [Nat]Added 147 Read/Feed constraints in 2445 ms returned sat
[2024-06-01 08:49:09] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2721 transitions) in 910 ms.
[2024-06-01 08:49:09] [INFO ] Added : 0 causal constraints over 0 iterations in 1092 ms. Result :sat
Parikh directed walk for 4000 steps, including 309 resets, run took 143 ms. (steps per millisecond=27 )
Random directed walk for 500000 steps, including 0 resets, run took 918 ms (no deadlock found). (steps per millisecond=544 )
Finished random walk after 588 steps, including 0 resets, run found a deadlock after 4 ms. (steps per millisecond=147 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 134284 ms.
ITS solved all properties within timeout

BK_STOP 1717231750649

--------------------
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 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="Szymanski-PT-b06"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is Szymanski-PT-b06, 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 r538-tall-171690548500546"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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