fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r072-tajo-158922828100106
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for DNAwalker-PT-12ringLLLarge

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15741.440 24865.00 47025.00 146.00 F normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r072-tajo-158922828100106.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DNAwalker-PT-12ringLLLarge, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r072-tajo-158922828100106
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 316K
-rw-r--r-- 1 mcc users 4.0K Mar 31 04:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 31 04:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 29 20:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 29 20:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K Apr 8 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 28 13:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 28 13:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 06:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 27 06:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 14 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 135K Mar 24 05:37 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 1589583481984

[2020-05-15 22:58:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2020-05-15 22:58:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-15 22:58:03] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2020-05-15 22:58:03] [INFO ] Transformed 33 places.
[2020-05-15 22:58:03] [INFO ] Transformed 312 transitions.
[2020-05-15 22:58:03] [INFO ] Parsed PT model containing 33 places and 312 transitions in 112 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 9 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 4 ms.15856KB memory used
Starting structural reductions, iteration 0 : 33/33 places, 312/312 transitions.
Applied a total of 0 rules in 21 ms. Remains 33 /33 variables (removed 0) and now considering 312/312 (removed 0) transitions.
[2020-05-15 22:58:03] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
// Phase 1: matrix 311 rows 33 cols
[2020-05-15 22:58:03] [INFO ] Computed 0 place invariants in 6 ms
[2020-05-15 22:58:04] [INFO ] Dead Transitions using invariants and state equation in 298 ms returned []
Finished structural reductions, in 1 iterations. Remains : 33/33 places, 312/312 transitions.
Starting structural reductions, iteration 0 : 33/33 places, 312/312 transitions.
Applied a total of 0 rules in 16 ms. Remains 33 /33 variables (removed 0) and now considering 312/312 (removed 0) transitions.
[2020-05-15 22:58:04] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
// Phase 1: matrix 311 rows 33 cols
[2020-05-15 22:58:04] [INFO ] Computed 0 place invariants in 3 ms
[2020-05-15 22:58:04] [INFO ] Implicit Places using invariants in 48 ms returned []
[2020-05-15 22:58:04] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
// Phase 1: matrix 311 rows 33 cols
[2020-05-15 22:58:04] [INFO ] Computed 0 place invariants in 2 ms
[2020-05-15 22:58:04] [INFO ] State equation strengthened by 71 read => feed constraints.
[2020-05-15 22:58:04] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
[2020-05-15 22:58:04] [INFO ] Redundant transitions in 32 ms returned []
[2020-05-15 22:58:04] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
// Phase 1: matrix 311 rows 33 cols
[2020-05-15 22:58:04] [INFO ] Computed 0 place invariants in 9 ms
[2020-05-15 22:58:04] [INFO ] Dead Transitions using invariants and state equation in 175 ms returned []
Finished structural reductions, in 1 iterations. Remains : 33/33 places, 312/312 transitions.
Random walk for 1250000 steps, including 96837 resets, run took 3880 ms (no deadlock found). (steps per millisecond=322 )
Random directed walk for 1250001 steps, including 21788 resets, run took 3200 ms (no deadlock found). (steps per millisecond=390 )
[2020-05-15 22:58:11] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
// Phase 1: matrix 311 rows 33 cols
[2020-05-15 22:58:11] [INFO ] Computed 0 place invariants in 2 ms
[2020-05-15 22:58:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 22:58:12] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2020-05-15 22:58:12] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 22:58:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 22:58:12] [INFO ] [Nat]Absence check using state equation in 511 ms returned sat
[2020-05-15 22:58:12] [INFO ] State equation strengthened by 71 read => feed constraints.
[2020-05-15 22:58:12] [INFO ] [Nat]Added 71 Read/Feed constraints in 34 ms returned sat
[2020-05-15 22:58:12] [INFO ] Computed and/alt/rep : 282/3965/281 causal constraints in 36 ms.
[2020-05-15 22:58:13] [INFO ] Added : 29 causal constraints over 6 iterations in 331 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 27 ms.
Parikh directed walk for 3200 steps, including 164 resets, run took 20 ms. (steps per millisecond=160 )
Random directed walk for 500020 steps, including 8748 resets, run took 1151 ms (no deadlock found). (steps per millisecond=434 )
Random walk for 500000 steps, including 38727 resets, run took 1542 ms (no deadlock found). (steps per millisecond=324 )
Random directed walk for 500008 steps, including 8764 resets, run took 1171 ms (no deadlock found). (steps per millisecond=426 )
Random walk for 500000 steps, including 38718 resets, run took 1347 ms (no deadlock found). (steps per millisecond=371 )
[2020-05-15 22:58:18] [INFO ] Flatten gal took : 60 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-15 22:58:18] [INFO ] Applying decomposition
[2020-05-15 22:58:18] [INFO ] Flatten gal took : 45 ms
[2020-05-15 22:58:18] [INFO ] Input system was already deterministic with 312 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph12021696056903557447.txt, -o, /tmp/graph12021696056903557447.bin, -w, /tmp/graph12021696056903557447.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph12021696056903557447.bin, -l, -1, -v, -w, /tmp/graph12021696056903557447.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-15 22:58:18] [INFO ] Decomposing Gal with order
[2020-05-15 22:58:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-15 22:58:19] [INFO ] Removed a total of 544 redundant transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 311 out of 312 initially.
// Phase 1: matrix 311 rows 33 cols
[2020-05-15 22:58:19] [INFO ] Computed 0 place invariants in 2 ms
Total of 0 invariants.
[2020-05-15 22:58:19] [INFO ] Computed 0 place invariants in 3 ms
[2020-05-15 22:58:19] [INFO ] Flatten gal took : 229 ms
[2020-05-15 22:58:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2020-05-15 22:58:19] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityDeadlock.pnml.gal : 7 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/ReachabilityDeadlock.pnml.gal, -t, CGAL, -ctl, DEADLOCK], workingDir=/home/mcc/execution]

[2020-05-15 22:58:19] [INFO ] Proved 33 variables to be positive in 289 ms
[2020-05-15 22:58:19] [INFO ] Computing symmetric may disable matrix : 312 transitions.
[2020-05-15 22:58:19] [INFO ] Computation of disable matrix completed :0/312 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 22:58:19] [INFO ] Computation of Complete disable matrix. took 67 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 22:58:19] [INFO ] Computing symmetric may enable matrix : 312 transitions.
[2020-05-15 22:58:19] [INFO ] Computation of Complete enable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 22:58:19] [INFO ] Computing symmetric co enabling matrix : 312 transitions.
its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityDeadlock.pnml.gal -t CGAL -ctl DEADLOCK
No direction supplied, using forward translation only.
built 163 ordering constraints for composite.
[2020-05-15 22:58:22] [INFO ] Computation of co-enabling matrix(28/312) took 3019 ms. Total solver calls (SAT/UNSAT): 987(987/0)
[2020-05-15 22:58:25] [INFO ] Computation of co-enabling matrix(111/312) took 6031 ms. Total solver calls (SAT/UNSAT): 3573(3573/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
reachable,1.88537e+09,5.72026,176480,8853,9,325445,203,379,606436,14,193,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,6.68741,176480,1,0,325445,203,1378,606436,51,200,281286

System contains 0 deadlocks (shown below if less than --print-limit option) !
FORMULA ReachabilityDeadlock FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[ 0 ]
SMT solver raised 'unknown', retrying with same input.
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:492)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-15 22:58:26] [INFO ] Built C files in 7552ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1589583506849

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityDeadlock = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityDeadlock -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="DNAwalker-PT-12ringLLLarge"
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"

# 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 DNAwalker-PT-12ringLLLarge, 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 r072-tajo-158922828100106"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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