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.r533-tall-167987253100146.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 lolaxred
Input is EisenbergMcGuire-PT-05, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r533-tall-167987253100146
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 968K
-rw-r--r-- 1 mcc users 9.1K Mar 23 15:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Mar 23 15:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 14K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 23 15:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Mar 23 15:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 460K Mar 31 16:48 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 1680811706788

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=lolaxred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=EisenbergMcGuire-PT-05
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2023-04-06 20:08:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2023-04-06 20:08:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 20:08:28] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2023-04-06 20:08:28] [INFO ] Transformed 295 places.
[2023-04-06 20:08:28] [INFO ] Transformed 800 transitions.
[2023-04-06 20:08:28] [INFO ] Found NUPN structural information;
[2023-04-06 20:08:28] [INFO ] Parsed PT model containing 295 places and 800 transitions and 3600 arcs in 143 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 1 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 5 ms.28066KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 295/295 places, 800/800 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 removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 295 transition count 795
Reduce places removed 5 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 290 transition count 795
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 10 place count 290 transition count 715
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 170 place count 210 transition count 715
Computed a total of 0 stabilizing places and 0 stable transitions
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 190 place count 190 transition count 615
Iterating global reduction 2 with 20 rules applied. Total rules applied 210 place count 190 transition count 615
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 250 place count 170 transition count 595
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 250 rules in 127 ms. Remains 170 /295 variables (removed 125) and now considering 595/800 (removed 205) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 128 ms. Remains : 170/295 places, 595/800 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1569 ms (no deadlock found). (steps per millisecond=796 )
Random directed walk for 1250005 steps, including 0 resets, run took 1448 ms (no deadlock found). (steps per millisecond=863 )
[2023-04-06 20:08:31] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
// Phase 1: matrix 260 rows 170 cols
[2023-04-06 20:08:31] [INFO ] Computed 16 invariants in 16 ms
[2023-04-06 20:08:31] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-04-06 20:08:31] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 5 ms returned sat
[2023-04-06 20:08:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 20:08:31] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2023-04-06 20:08:31] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 20:08:31] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-04-06 20:08:31] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 4 ms returned sat
[2023-04-06 20:08:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 20:08:32] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2023-04-06 20:08:32] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 20:08:32] [INFO ] [Nat]Added 116 Read/Feed constraints in 31 ms returned sat
[2023-04-06 20:08:32] [INFO ] Deduced a trap composed of 47 places in 89 ms of which 3 ms to minimize.
[2023-04-06 20:08:32] [INFO ] Deduced a trap composed of 48 places in 81 ms of which 1 ms to minimize.
[2023-04-06 20:08:32] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 4 ms to minimize.
[2023-04-06 20:08:32] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 0 ms to minimize.
[2023-04-06 20:08:32] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2023-04-06 20:08:32] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 0 ms to minimize.
[2023-04-06 20:08:32] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 0 ms to minimize.
[2023-04-06 20:08:32] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 0 ms to minimize.
[2023-04-06 20:08:32] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 2 ms to minimize.
[2023-04-06 20:08:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 782 ms
FORMULA ReachabilityDeadlock FALSE TECHNIQUES TOPOLOGICAL SAT_SMT STRUCTURAL_REDUCTION
Total runtime 4768 ms.
ITS solved all properties within timeout

BK_STOP 1680811713861

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="EisenbergMcGuire-PT-05"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is EisenbergMcGuire-PT-05, 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 r533-tall-167987253100146"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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