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.r498-tall-171640617500256.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 GPPP-PT-C0100N0000000100, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r498-tall-171640617500256
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K 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 3.5K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 09:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 186K Apr 12 09:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 09:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Apr 12 09:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 17 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1 May 18 16:42 large_marking
-rw-r--r-- 1 mcc users 21K 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

FORMULA_NAME ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1717193271142

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=GPPP-PT-C0100N0000000100
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:07:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2024-05-31 22:07:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:07:52] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2024-05-31 22:07:52] [INFO ] Transformed 33 places.
[2024-05-31 22:07:52] [INFO ] Transformed 22 transitions.
[2024-05-31 22:07:52] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 122 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 4 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 3 ms.18632KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 30 transition count 19
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 27 transition count 17
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 25 transition count 16
Computed a total of 0 stabilizing places and 0 stable transitions
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 2 with 2 rules applied. Total rules applied 15 place count 24 transition count 15
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 15 rules in 51 ms. Remains 24 /33 variables (removed 9) and now considering 15/22 (removed 7) transitions.
Running 14 sub problems to find dead transitions.
// Phase 1: matrix 15 rows 24 cols
[2024-05-31 22:07:52] [INFO ] Computed 10 invariants in 9 ms
[2024-05-31 22:07:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 1/24 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem TDEAD14 is UNSAT
At refinement iteration 5 (OVERLAPS) 14/38 variables, 24/34 constraints. Problems are: Problem set: 1 solved, 13 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/34 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 1/39 variables, 1/35 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/35 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 0/39 variables, 0/35 constraints. Problems are: Problem set: 1 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 35 constraints, problems are : Problem set: 1 solved, 13 unsolved in 387 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 24/24 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 3/6 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 1/23 variables, 1/7 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 2/9 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 1/24 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 14/38 variables, 24/34 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/38 variables, 13/47 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/38 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 1/39 variables, 1/48 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/39 variables, 0/48 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 0/39 variables, 0/48 constraints. Problems are: Problem set: 1 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 48 constraints, problems are : Problem set: 1 solved, 13 unsolved in 7284 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 24/24 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 7720ms problems are : Problem set: 1 solved, 13 unsolved
Search for dead transitions found 1 dead transitions in 7733ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
Starting structural reductions in DEADLOCK mode, iteration 1 : 24/33 places, 14/22 transitions.
Computed a total of 24 stabilizing places and 13 stable transitions
Graph (complete) has 63 edges and 24 vertex of which 23 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Computed a total of 23 stabilizing places and 13 stable transitions
Computed a total of 23 stabilizing places and 13 stable transitions
Applied a total of 1 rules in 6 ms. Remains 23 /24 variables (removed 1) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 2 iterations and 7830 ms. Remains : 23/33 places, 14/22 transitions.
Finished random walk after 1261 steps, including 0 resets, run found a deadlock after 3 ms. (steps per millisecond=420 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 8012 ms.
ITS solved all properties within timeout

BK_STOP 1717193280297

--------------------
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="GPPP-PT-C0100N0000000100"
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 GPPP-PT-C0100N0000000100, 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 r498-tall-171640617500256"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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