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.r144-tall-165271830700086.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 gold2021
Input is JoinFreeModules-PT-0003, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r144-tall-165271830700086
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 220K
-rw-r--r-- 1 mcc users 6.0K Apr 30 02:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 30 02:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 30 02:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 30 02:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 9 08:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 9.4K 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 1652739705988

Running Version 0
[2022-05-16 22:21:47] [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 22:21:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 22:21:47] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2022-05-16 22:21:47] [INFO ] Transformed 16 places.
[2022-05-16 22:21:47] [INFO ] Transformed 25 transitions.
[2022-05-16 22:21:47] [INFO ] Parsed PT model containing 16 places and 25 transitions in 59 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 5 ms.
Working with output stream class java.io.PrintStream
Reduce places removed 1 places and 0 transitions.
Built sparse matrix representations for Structural reductions in 5 ms.14552KB memory used
Starting structural reductions, iteration 0 : 15/15 places, 25/25 transitions.
Applied a total of 0 rules in 15 ms. Remains 15 /15 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 15 cols
[2022-05-16 22:21:47] [INFO ] Computed 3 place invariants in 8 ms
[2022-05-16 22:21:47] [INFO ] Dead Transitions using invariants and state equation in 123 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/15 places, 25/25 transitions.
Starting structural reductions, iteration 0 : 15/15 places, 25/25 transitions.
Applied a total of 0 rules in 2 ms. Remains 15 /15 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 15 cols
[2022-05-16 22:21:48] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 22:21:48] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 25 rows 15 cols
[2022-05-16 22:21:48] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-16 22:21:48] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2022-05-16 22:21:48] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 25 rows 15 cols
[2022-05-16 22:21:48] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 22:21:48] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/15 places, 25/25 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1106 ms (no deadlock found). (steps per millisecond=1130 )
Random directed walk for 1250000 steps, including 0 resets, run took 777 ms (no deadlock found). (steps per millisecond=1608 )
// Phase 1: matrix 25 rows 15 cols
[2022-05-16 22:21:50] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-16 22:21:50] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 22:21:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:21:50] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-16 22:21:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:21:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 22:21:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:21:50] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-05-16 22:21:50] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 22:21:50] [INFO ] Added : 17 causal constraints over 4 iterations in 330 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
Parikh directed walk for 84600 steps, including 120 resets, run took 87 ms. (steps per millisecond=972 )
Random directed walk for 500000 steps, including 0 resets, run took 322 ms (no deadlock found). (steps per millisecond=1552 )
Random walk for 500000 steps, including 0 resets, run took 344 ms (no deadlock found). (steps per millisecond=1453 )
Random directed walk for 500004 steps, including 0 resets, run took 287 ms (no deadlock found). (steps per millisecond=1742 )
Random walk for 500000 steps, including 0 resets, run took 338 ms (no deadlock found). (steps per millisecond=1479 )
Starting structural reductions, iteration 0 : 15/15 places, 25/25 transitions.
Applied a total of 0 rules in 2 ms. Remains 15 /15 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 15 cols
[2022-05-16 22:21:51] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 22:21:51] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 25 rows 15 cols
[2022-05-16 22:21:51] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 22:21:51] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2022-05-16 22:21:51] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 25 rows 15 cols
[2022-05-16 22:21:51] [INFO ] Computed 3 place invariants in 7 ms
[2022-05-16 22:21:51] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/15 places, 25/25 transitions.
Random walk for 1250000 steps, including 0 resets, run took 850 ms (no deadlock found). (steps per millisecond=1470 )
Random directed walk for 1250000 steps, including 0 resets, run took 711 ms (no deadlock found). (steps per millisecond=1758 )
// Phase 1: matrix 25 rows 15 cols
[2022-05-16 22:21:53] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-16 22:21:53] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-16 22:21:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:21:53] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-16 22:21:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:21:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-16 22:21:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:21:53] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-05-16 22:21:53] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 22:21:53] [INFO ] Added : 17 causal constraints over 4 iterations in 335 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
Parikh directed walk for 84600 steps, including 121 resets, run took 44 ms. (steps per millisecond=1922 )
Random directed walk for 500001 steps, including 0 resets, run took 287 ms (no deadlock found). (steps per millisecond=1742 )
Random walk for 500000 steps, including 0 resets, run took 350 ms (no deadlock found). (steps per millisecond=1428 )
Random directed walk for 500000 steps, including 0 resets, run took 300 ms (no deadlock found). (steps per millisecond=1666 )
Random walk for 500000 steps, including 0 resets, run took 346 ms (no deadlock found). (steps per millisecond=1445 )
[2022-05-16 22:21:55] [INFO ] Flatten gal took : 23 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6869914283407454177
[2022-05-16 22:21:55] [INFO ] Applying decomposition
[2022-05-16 22:21:55] [INFO ] Flatten gal took : 6 ms
[2022-05-16 22:21:55] [INFO ] Computing symmetric may disable matrix : 25 transitions.
[2022-05-16 22:21:55] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 22:21:55] [INFO ] Computing symmetric may enable matrix : 25 transitions.
[2022-05-16 22:21:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 22:21:55] [INFO ] Computing Do-Not-Accords matrix : 25 transitions.
[2022-05-16 22:21:55] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 22:21:55] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6869914283407454177
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6869914283407454177]
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph14666007277659151996.txt, -o, /tmp/graph14666007277659151996.bin, -w, /tmp/graph14666007277659151996.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph14666007277659151996.bin, -l, -1, -v, -w, /tmp/graph14666007277659151996.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-16 22:21:55] [INFO ] Decomposing Gal with order
[2022-05-16 22:21:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 22:21:55] [INFO ] Flatten gal took : 27 ms
[2022-05-16 22:21:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-16 22:21:55] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock4365788431231952003.gal : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityDeadlock4365788431231952003.gal, -t, CGAL, -ctl, DEADLOCK], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityDeadlock4365788431231952003.gal -t CGAL -ctl DEADLOCK
No direction supplied, using forward translation only.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,35937,0.012223,4344,32,29,227,190,76,261,45,398,0


Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
dead,0,0.014539,4344,1,0,227,305,147,356,152,572,212

System contains 0 deadlocks (shown below if less than --print-limit option) !
FORMULA ReachabilityDeadlock FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[ 0 ]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1652739716567

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="JoinFreeModules-PT-0003"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is JoinFreeModules-PT-0003, 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 r144-tall-165271830700086"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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