Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r522-tall-171662353300111.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 RERS17pb113-PT-9, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-171662353300111
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 19 07:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 15M 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 1717218970243

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=RERS17pb113-PT-9
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:16:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2024-06-01 05:16:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:16:12] [INFO ] Load time of PNML (sax parser for PT used): 688 ms
[2024-06-01 05:16:12] [INFO ] Transformed 639 places.
[2024-06-01 05:16:12] [INFO ] Transformed 31353 transitions.
[2024-06-01 05:16:12] [INFO ] Parsed PT model containing 639 places and 31353 transitions and 125418 arcs in 930 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 20 ms.82978KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 639/639 places, 31353/31353 transitions.
Computed a total of 13 stabilizing places and 1 stable transitions
Ensure Unique test removed 12 places
Computed a total of 1 stabilizing places and 1 stable transitions
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 627 transition count 31353
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 626 transition count 31352
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 13 rules in 770 ms. Remains 626 /639 variables (removed 13) and now considering 31352/31353 (removed 1) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 789 ms. Remains : 626/639 places, 31352/31353 transitions.
Interrupted Random walk after 917110 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=30 )
[2024-06-01 05:16:43] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2024-06-01 05:16:43] [INFO ] Computed 13 invariants in 107 ms
[2024-06-01 05:16:47] [INFO ] [Real]Absence check using 13 positive place invariants in 37 ms returned sat
[2024-06-01 05:16:58] [INFO ] [Real]Absence check using state equation in 11128 ms returned sat
[2024-06-01 05:16:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:17:03] [INFO ] [Nat]Absence check using 13 positive place invariants in 28 ms returned sat
[2024-06-01 05:17:20] [INFO ] [Nat]Absence check using state equation in 17623 ms returned sat
[2024-06-01 05:17:20] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-06-01 05:17:29] [INFO ] [Nat]Added 268 Read/Feed constraints in 8590 ms returned sat
[2024-06-01 05:17:31] [INFO ] Deduced a trap composed of 65 places in 2018 ms of which 23 ms to minimize.
[2024-06-01 05:17:35] [INFO ] Deduced a trap composed of 40 places in 2666 ms of which 2 ms to minimize.
[2024-06-01 05:17:37] [INFO ] Deduced a trap composed of 40 places in 2027 ms of which 3 ms to minimize.
[2024-06-01 05:17:39] [INFO ] Deduced a trap composed of 64 places in 1678 ms of which 3 ms to minimize.
[2024-06-01 05:17:41] [INFO ] Deduced a trap composed of 64 places in 1207 ms of which 11 ms to minimize.
[2024-06-01 05:17:42] [INFO ] Deduced a trap composed of 64 places in 767 ms of which 1 ms to minimize.
[2024-06-01 05:17:44] [INFO ] Deduced a trap composed of 48 places in 1275 ms of which 2 ms to minimize.
[2024-06-01 05:17:45] [INFO ] Deduced a trap composed of 48 places in 1248 ms of which 3 ms to minimize.
[2024-06-01 05:17:47] [INFO ] Deduced a trap composed of 40 places in 1043 ms of which 2 ms to minimize.
[2024-06-01 05:17:48] [INFO ] Deduced a trap composed of 48 places in 972 ms of which 1 ms to minimize.
[2024-06-01 05:17:50] [INFO ] Deduced a trap composed of 24 places in 1124 ms of which 2 ms to minimize.
[2024-06-01 05:17:51] [INFO ] Deduced a trap composed of 40 places in 1035 ms of which 1 ms to minimize.
[2024-06-01 05:17:53] [INFO ] Deduced a trap composed of 64 places in 1276 ms of which 2 ms to minimize.
[2024-06-01 05:17:54] [INFO ] Deduced a trap composed of 48 places in 1074 ms of which 1 ms to minimize.
[2024-06-01 05:17:55] [INFO ] Deduced a trap composed of 40 places in 771 ms of which 1 ms to minimize.
[2024-06-01 05:17:58] [INFO ] Deduced a trap composed of 64 places in 1037 ms of which 3 ms to minimize.
[2024-06-01 05:17:59] [INFO ] Deduced a trap composed of 40 places in 1385 ms of which 3 ms to minimize.
[2024-06-01 05:18:02] [INFO ] Deduced a trap composed of 48 places in 1031 ms of which 1 ms to minimize.
[2024-06-01 05:18:03] [INFO ] Deduced a trap composed of 64 places in 914 ms of which 1 ms to minimize.
[2024-06-01 05:18:05] [INFO ] Deduced a trap composed of 64 places in 915 ms of which 2 ms to minimize.
[2024-06-01 05:18:06] [INFO ] Deduced a trap composed of 64 places in 612 ms of which 4 ms to minimize.
[2024-06-01 05:18:07] [INFO ] Deduced a trap composed of 48 places in 601 ms of which 1 ms to minimize.
[2024-06-01 05:18:08] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 38824 ms
[2024-06-01 05:18:11] [INFO ] Computed and/alt/rep : 1/9/1 causal constraints (skipped 18323 transitions) in 2620 ms.
[2024-06-01 05:18:12] [INFO ] Added : 0 causal constraints over 0 iterations in 3853 ms. Result :sat
Interrupted Parikh directed walk after 924601 steps, including 1000 resets, run timeout after 30001 ms. (steps per millisecond=30 )
Parikh directed walk for 924601 steps, including 1000 resets, run took 30004 ms. (steps per millisecond=30 )
Random directed walk for 500005 steps, including 0 resets, run took 21921 ms (no deadlock found). (steps per millisecond=22 )
Random walk for 500000 steps, including 0 resets, run took 15916 ms (no deadlock found). (steps per millisecond=31 )
Random directed walk for 500004 steps, including 0 resets, run took 22145 ms (no deadlock found). (steps per millisecond=22 )
Random walk for 500000 steps, including 0 resets, run took 16624 ms (no deadlock found). (steps per millisecond=30 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
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 0 rules in 273 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2024-06-01 05:19:59] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2024-06-01 05:19:59] [INFO ] Invariant cache hit.
[2024-06-01 05:20:02] [INFO ] Implicit Places using invariants in 2423 ms returned []
Implicit Place search using SMT only with invariants took 2431 ms to find 0 implicit places.
Running 31351 sub problems to find dead transitions.
[2024-06-01 05:20:02] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2024-06-01 05:20:02] [INFO ] Invariant cache hit.
[2024-06-01 05:20:02] [INFO ] State equation strengthened by 268 read => feed constraints.
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : ReachabilityDeadlock

BK_STOP 1717219286927

--------------------
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
mcc2024
property name is ReachabilityDeadlock
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="RERS17pb113-PT-9"
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 RERS17pb113-PT-9, 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 r522-tall-171662353300111"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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