Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r518-tajo-171654455800206.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBLF-PT-S06J04T08, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r518-tajo-171654455800206
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 18K Apr 11 17:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 11 17:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 443K Apr 11 17:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.9M Apr 11 17:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 17K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K Apr 11 17:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 11 17:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 268K Apr 11 17:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.1M Apr 11 17:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.7K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 14M 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 1717269863720

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-PT-S06J04T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:24:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2024-06-01 19:24:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:24:25] [INFO ] Load time of PNML (sax parser for PT used): 835 ms
[2024-06-01 19:24:25] [INFO ] Transformed 810 places.
[2024-06-01 19:24:26] [INFO ] Transformed 14014 transitions.
[2024-06-01 19:24:26] [INFO ] Parsed PT model containing 810 places and 14014 transitions and 118428 arcs in 1131 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 5 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 10760 transitions
Reduce redundant transitions removed 10760 transitions.
Built sparse matrix representations for Structural reductions in 9 ms.57047KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 810/810 places, 3254/3254 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Ensure Unique test removed 6 places
Computed a total of 0 stabilizing places and 0 stable transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 804 transition count 3182
Reduce places removed 72 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Iterating post reduction 1 with 72 rules applied. Total rules applied 150 place count 732 transition count 3182
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 150 place count 732 transition count 3086
Deduced a syphon composed of 96 places in 3 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 342 place count 636 transition count 3086
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 5 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 534 place count 540 transition count 2990
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 534 rules in 549 ms. Remains 540 /810 variables (removed 270) and now considering 2990/3254 (removed 264) transitions.
Running 2984 sub problems to find dead transitions.
[2024-06-01 19:24:27] [INFO ] Flow matrix only has 2942 transitions (discarded 48 similar events)
// Phase 1: matrix 2942 rows 540 cols
[2024-06-01 19:24:27] [INFO ] Computed 52 invariants in 151 ms
[2024-06-01 19:24:27] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2984 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 534/3482 variables, and 45 constraints, problems are : Problem set: 0 solved, 2984 unsolved in 20130 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 32/37 constraints, State Equation: 0/540 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 1304/1304 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2984 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2984 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/534 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 2984 unsolved
[2024-06-01 19:25:17] [INFO ] Deduced a trap composed of 52 places in 455 ms of which 17 ms to minimize.
[2024-06-01 19:25:17] [INFO ] Deduced a trap composed of 52 places in 219 ms of which 3 ms to minimize.
[2024-06-01 19:25:17] [INFO ] Deduced a trap composed of 52 places in 153 ms of which 1 ms to minimize.
[2024-06-01 19:25:18] [INFO ] Deduced a trap composed of 53 places in 96 ms of which 0 ms to minimize.
[2024-06-01 19:25:18] [INFO ] Deduced a trap composed of 53 places in 179 ms of which 1 ms to minimize.
[2024-06-01 19:25:23] [INFO ] Deduced a trap composed of 19 places in 386 ms of which 2 ms to minimize.
[2024-06-01 19:25:24] [INFO ] Deduced a trap composed of 184 places in 331 ms of which 3 ms to minimize.
[2024-06-01 19:25:25] [INFO ] Deduced a trap composed of 193 places in 448 ms of which 4 ms to minimize.
[2024-06-01 19:25:25] [INFO ] Deduced a trap composed of 188 places in 471 ms of which 3 ms to minimize.
[2024-06-01 19:25:26] [INFO ] Deduced a trap composed of 174 places in 436 ms of which 2 ms to minimize.
[2024-06-01 19:25:29] [INFO ] Deduced a trap composed of 55 places in 470 ms of which 2 ms to minimize.
[2024-06-01 19:25:30] [INFO ] Deduced a trap composed of 90 places in 425 ms of which 3 ms to minimize.
[2024-06-01 19:25:30] [INFO ] Deduced a trap composed of 34 places in 534 ms of which 3 ms to minimize.
[2024-06-01 19:25:31] [INFO ] Deduced a trap composed of 72 places in 519 ms of which 3 ms to minimize.
[2024-06-01 19:25:31] [INFO ] Deduced a trap composed of 71 places in 505 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/3482 variables, and 60 constraints, problems are : Problem set: 0 solved, 2984 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 32/37 constraints, State Equation: 0/540 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 1680/1304 constraints, Known Traps: 15/15 constraints]
After SMT, in 67522ms problems are : Problem set: 0 solved, 2984 unsolved
Search for dead transitions found 0 dead transitions in 67657ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 68282 ms. Remains : 540/810 places, 2990/3254 transitions.
Finished random walk after 47 steps, including 0 resets, run found a deadlock after 4 ms. (steps per millisecond=11 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 69747 ms.
ITS solved all properties within timeout

BK_STOP 1717269934776

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="PolyORBLF-PT-S06J04T08"
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 PolyORBLF-PT-S06J04T08, 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 r518-tajo-171654455800206"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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