Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r139-tall-165271827700266.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is LamportFastMutEx-PT-6, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r139-tall-165271827700266
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 672K
-rw-r--r-- 1 mcc users 16K Apr 29 19:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Apr 29 19:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 25K Apr 29 19:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 139K Apr 29 19:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 13K May 9 08:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 9 08:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 9 08:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 9 08:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 9 08:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.0K May 9 08:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 208K May 10 09:34 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 1652743502737

Running Version 202205111006
[2022-05-16 23:25:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2022-05-16 23:25:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 23:25:04] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2022-05-16 23:25:04] [INFO ] Transformed 217 places.
[2022-05-16 23:25:04] [INFO ] Transformed 420 transitions.
[2022-05-16 23:25:04] [INFO ] Found NUPN structural information;
[2022-05-16 23:25:04] [INFO ] Completing missing partition info from NUPN : creating a component with [P_start_1_0, P_start_1_1, P_start_1_2, P_start_1_3, P_start_1_4, P_start_1_5, P_start_1_6, P_b_0_false, P_b_0_true, P_b_1_false, P_b_1_true, P_b_2_false, P_b_2_true, P_b_3_false, P_b_3_true, P_b_4_false, P_b_4_true, P_b_5_false, P_b_5_true, P_b_6_false, P_b_6_true, P_setx_3_0, P_setx_3_1, P_setx_3_2, P_setx_3_3, P_setx_3_4, P_setx_3_5, P_setx_3_6, P_setbi_5_0, P_setbi_5_1, P_setbi_5_2, P_setbi_5_3, P_setbi_5_4, P_setbi_5_5, P_setbi_5_6, P_ify0_4_0, P_ify0_4_1, P_ify0_4_2, P_ify0_4_3, P_ify0_4_4, P_ify0_4_5, P_ify0_4_6, P_sety_9_0, P_sety_9_1, P_sety_9_2, P_sety_9_3, P_sety_9_4, P_sety_9_5, P_sety_9_6, P_ifxi_10_0, P_ifxi_10_1, P_ifxi_10_2, P_ifxi_10_3, P_ifxi_10_4, P_ifxi_10_5, P_ifxi_10_6, P_setbi_11_0, P_setbi_11_1, P_setbi_11_2, P_setbi_11_3, P_setbi_11_4, P_setbi_11_5, P_setbi_11_6, P_fordo_12_0, P_fordo_12_1, P_fordo_12_2, P_fordo_12_3, P_fordo_12_4, P_fordo_12_5, P_fordo_12_6, P_wait_0_0, P_wait_0_1, P_wait_0_2, P_wait_0_3, P_wait_0_4, P_wait_0_5, P_wait_0_6, P_wait_1_0, P_wait_1_1, P_wait_1_2, P_wait_1_3, P_wait_1_4, P_wait_1_5, P_wait_1_6, P_wait_2_0, P_wait_2_1, P_wait_2_2, P_wait_2_3, P_wait_2_4, P_wait_2_5, P_wait_2_6, P_wait_3_0, P_wait_3_1, P_wait_3_2, P_wait_3_3, P_wait_3_4, P_wait_3_5, P_wait_3_6, P_wait_4_0, P_wait_4_1, P_wait_4_2, P_wait_4_3, P_wait_4_4, P_wait_4_5, P_wait_4_6, P_wait_5_0, P_wait_5_1, P_wait_5_2, P_wait_5_3, P_wait_5_4, P_wait_5_5, P_wait_5_6, P_wait_6_0, P_wait_6_1, P_wait_6_2, P_wait_6_3, P_wait_6_4, P_wait_6_5, P_wait_6_6, P_await_13_0, P_await_13_1, P_await_13_2, P_await_13_3, P_await_13_4, P_await_13_5, P_await_13_6, P_done_0_0, P_done_0_1, P_done_0_2, P_done_0_3, P_done_0_4, P_done_0_5, P_done_0_6, P_done_1_0, P_done_1_1, P_done_1_2, P_done_1_3, P_done_1_4, P_done_1_5, P_done_1_6, P_done_2_0, P_done_2_1, P_done_2_2, P_done_2_3, P_done_2_4, P_done_2_5, P_done_2_6, P_done_3_0, P_done_3_1, P_done_3_2, P_done_3_3, P_done_3_4, P_done_3_5, P_done_3_6, P_done_4_0, P_done_4_1, P_done_4_2, P_done_4_3, P_done_4_4, P_done_4_5, P_done_4_6, P_done_5_0, P_done_5_1, P_done_5_2, P_done_5_3, P_done_5_4, P_done_5_5, P_done_5_6, P_done_6_0, P_done_6_1, P_done_6_2, P_done_6_3, P_done_6_4, P_done_6_5, P_done_6_6, P_ifyi_15_0, P_ifyi_15_1, P_ifyi_15_2, P_ifyi_15_3, P_ifyi_15_4, P_ifyi_15_5, P_ifyi_15_6, P_awaity_0, P_awaity_1, P_awaity_2, P_awaity_3, P_awaity_4, P_awaity_5, P_awaity_6, P_CS_21_0, P_CS_21_1, P_CS_21_2, P_CS_21_3, P_CS_21_4, P_CS_21_5, P_CS_21_6, P_setbi_24_0, P_setbi_24_1, P_setbi_24_2, P_setbi_24_3, P_setbi_24_4, P_setbi_24_5, P_setbi_24_6]
[2022-05-16 23:25:04] [INFO ] Parsed PT model containing 217 places and 420 transitions in 213 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 3 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 66 transitions.
Built sparse matrix representations for Structural reductions in 4 ms.9594KB memory used
Starting structural reductions in DEADLOCKS mode, iteration 0 : 176/176 places, 354/354 transitions.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 170 transition count 348
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Applied a total of 12 rules in 59 ms. Remains 170 /176 variables (removed 6) and now considering 348/354 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 170/176 places, 348/354 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2160 ms (no deadlock found). (steps per millisecond=578 )
Random directed walk for 1250004 steps, including 0 resets, run took 1804 ms (no deadlock found). (steps per millisecond=692 )
[2022-05-16 23:25:08] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
// Phase 1: matrix 258 rows 170 cols
[2022-05-16 23:25:08] [INFO ] Computed 50 place invariants in 9 ms
[2022-05-16 23:25:08] [INFO ] [Real]Absence check using 50 positive place invariants in 19 ms returned sat
[2022-05-16 23:25:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:25:08] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2022-05-16 23:25:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 23:25:08] [INFO ] [Nat]Absence check using 50 positive place invariants in 12 ms returned sat
[2022-05-16 23:25:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 23:25:08] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2022-05-16 23:25:08] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-16 23:25:08] [INFO ] [Nat]Added 72 Read/Feed constraints in 11 ms returned sat
[2022-05-16 23:25:08] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 2 ms to minimize.
[2022-05-16 23:25:09] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2022-05-16 23:25:09] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2022-05-16 23:25:09] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 2 ms to minimize.
[2022-05-16 23:25:09] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 1 ms to minimize.
[2022-05-16 23:25:09] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2022-05-16 23:25:09] [INFO ] Deduced a trap composed of 11 places in 348 ms of which 0 ms to minimize.
[2022-05-16 23:25:09] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2022-05-16 23:25:09] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
[2022-05-16 23:25:09] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2022-05-16 23:25:10] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2022-05-16 23:25:10] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2022-05-16 23:25:10] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2022-05-16 23:25:10] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
[2022-05-16 23:25:10] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2022-05-16 23:25:10] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2022-05-16 23:25:10] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2022-05-16 23:25:10] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2022-05-16 23:25:10] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2022-05-16 23:25:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 19 trap constraints in 1580 ms
FORMULA ReachabilityDeadlock FALSE TECHNIQUES TOPOLOGICAL SAT_SMT STRUCTURAL_REDUCTION
Total runtime 6563 ms.

BK_STOP 1652743510523

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityDeadlock = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityDeadlock -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-PT-6"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is LamportFastMutEx-PT-6, 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 r139-tall-165271827700266"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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