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.r245-tall-167856432400236.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 LamportFastMutEx-COL-7, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-167856432400236
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 9.5K Feb 25 13:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 13:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 13:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 13:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 13:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Feb 25 13:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 13:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 25 13:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 43K Mar 5 18:22 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 1678706892441

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=LamportFastMutEx-COL-7
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-13 11:28:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2023-03-13 11:28:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 11:28:15] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-13 11:28:15] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-13 11:28:16] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 797 ms
[2023-03-13 11:28:16] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 264 PT places and 672.0 transition bindings in 28 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 3 ms.
Working with output stream class java.io.PrintStream
[2023-03-13 11:28:16] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 9 ms.
[2023-03-13 11:28:16] [INFO ] Skeletonized 1 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Prefix of Interest using HLPN skeleton for deadlock discarded 0 places and 0 transitions.
Domain [pid(8), pid(8)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-13 11:28:16] [INFO ] Unfolded HLPN to a Petri net with 264 places and 536 transitions 2352 arcs in 55 ms.
[2023-03-13 11:28:16] [INFO ] Unfolded 1 HLPN properties in 0 ms.
Deduced a syphon composed of 45 places in 6 ms
Reduce places removed 45 places and 74 transitions.
Built sparse matrix representations for Structural reductions in 1 ms.20166KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 219/219 places, 462/462 transitions.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 212 transition count 455
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Applied a total of 14 rules in 137 ms. Remains 212 /219 variables (removed 7) and now considering 455/462 (removed 7) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 138 ms. Remains : 212/219 places, 455/462 transitions.
Random walk for 1250000 steps, including 0 resets, run took 3114 ms (no deadlock found). (steps per millisecond=401 )
Random directed walk for 1250001 steps, including 0 resets, run took 2449 ms (no deadlock found). (steps per millisecond=510 )
[2023-03-13 11:28:22] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 212 cols
[2023-03-13 11:28:22] [INFO ] Computed 65 place invariants in 21 ms
[2023-03-13 11:28:22] [INFO ] [Real]Absence check using 65 positive place invariants in 71 ms returned sat
[2023-03-13 11:28:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 11:28:23] [INFO ] [Real]Absence check using state equation in 302 ms returned sat
[2023-03-13 11:28:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 11:28:23] [INFO ] [Nat]Absence check using 65 positive place invariants in 69 ms returned sat
[2023-03-13 11:28:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 11:28:24] [INFO ] [Nat]Absence check using state equation in 337 ms returned sat
[2023-03-13 11:28:24] [INFO ] State equation strengthened by 91 read => feed constraints.
[2023-03-13 11:28:24] [INFO ] [Nat]Added 91 Read/Feed constraints in 61 ms returned sat
[2023-03-13 11:28:24] [INFO ] Deduced a trap composed of 22 places in 275 ms of which 6 ms to minimize.
[2023-03-13 11:28:25] [INFO ] Deduced a trap composed of 11 places in 790 ms of which 1 ms to minimize.
[2023-03-13 11:28:25] [INFO ] Deduced a trap composed of 17 places in 424 ms of which 2 ms to minimize.
[2023-03-13 11:28:26] [INFO ] Deduced a trap composed of 14 places in 400 ms of which 1 ms to minimize.
[2023-03-13 11:28:26] [INFO ] Deduced a trap composed of 9 places in 439 ms of which 29 ms to minimize.
[2023-03-13 11:28:26] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 1 ms to minimize.
[2023-03-13 11:28:27] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 1 ms to minimize.
[2023-03-13 11:28:27] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 2 ms to minimize.
[2023-03-13 11:28:27] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 1 ms to minimize.
[2023-03-13 11:28:27] [INFO ] Deduced a trap composed of 13 places in 208 ms of which 4 ms to minimize.
[2023-03-13 11:28:27] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2023-03-13 11:28:27] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 1 ms to minimize.
[2023-03-13 11:28:27] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 8 ms to minimize.
[2023-03-13 11:28:28] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 2 ms to minimize.
[2023-03-13 11:28:28] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2023-03-13 11:28:28] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
[2023-03-13 11:28:28] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 1 ms to minimize.
[2023-03-13 11:28:28] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
[2023-03-13 11:28:28] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2023-03-13 11:28:28] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2023-03-13 11:28:28] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 0 ms to minimize.
[2023-03-13 11:28:28] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 4 ms to minimize.
[2023-03-13 11:28:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 22 trap constraints in 4749 ms
FORMULA ReachabilityDeadlock FALSE TECHNIQUES TOPOLOGICAL SAT_SMT STRUCTURAL_REDUCTION
Total runtime 13545 ms.
ITS solved all properties within timeout

BK_STOP 1678706915223

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="LamportFastMutEx-COL-7"
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 LamportFastMutEx-COL-7, 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 r245-tall-167856432400236"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-7.tgz
mv LamportFastMutEx-COL-7 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 ;