fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r223-tall-162098216100266
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for ShieldIIPt-PT-010B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
873.256 33408.00 41927.00 270.90 T normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r223-tall-162098216100266.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-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 ShieldIIPt-PT-010B, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-162098216100266
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 28 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 12:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 12:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 17:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 17:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 167K May 5 16:52 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 1621071271324

Running Version 0
[2021-05-15 09:34:32] [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]
[2021-05-15 09:34:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 09:34:33] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2021-05-15 09:34:33] [INFO ] Transformed 703 places.
[2021-05-15 09:34:33] [INFO ] Transformed 653 transitions.
[2021-05-15 09:34:33] [INFO ] Found NUPN structural information;
[2021-05-15 09:34:33] [INFO ] Parsed PT model containing 703 places and 653 transitions in 127 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 3 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 5 ms.22527KB memory used
Starting structural reductions, iteration 0 : 703/703 places, 653/653 transitions.
Drop transitions removed 172 transitions
Trivial Post-agglo rules discarded 172 transitions
Performed 172 trivial Post agglomeration. Transition count delta: 172
Iterating post reduction 0 with 172 rules applied. Total rules applied 172 place count 703 transition count 481
Reduce places removed 172 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 174 rules applied. Total rules applied 346 place count 531 transition count 479
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 347 place count 530 transition count 479
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 347 place count 530 transition count 438
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 429 place count 489 transition count 438
Discarding 70 places :
Symmetric choice reduction at 3 with 70 rule applications. Total rules 499 place count 419 transition count 368
Iterating global reduction 3 with 70 rules applied. Total rules applied 569 place count 419 transition count 368
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 569 place count 419 transition count 338
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 629 place count 389 transition count 338
Performed 169 Post agglomeration using F-continuation condition.Transition count delta: 169
Deduced a syphon composed of 169 places in 0 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 3 with 338 rules applied. Total rules applied 967 place count 220 transition count 169
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 1025 place count 191 transition count 188
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1026 place count 190 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1028 place count 188 transition count 187
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1028 place count 188 transition count 186
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1030 place count 187 transition count 186
Applied a total of 1030 rules in 182 ms. Remains 187 /703 variables (removed 516) and now considering 186/653 (removed 467) transitions.
Finished structural reductions, in 1 iterations. Remains : 187/703 places, 186/653 transitions.
Random walk for 1250000 steps, including 0 resets, run took 4985 ms (no deadlock found). (steps per millisecond=250 )
Random directed walk for 1250002 steps, including 0 resets, run took 2949 ms (no deadlock found). (steps per millisecond=423 )
// Phase 1: matrix 186 rows 187 cols
[2021-05-15 09:34:41] [INFO ] Computed 89 place invariants in 7 ms
[2021-05-15 09:34:41] [INFO ] [Real]Absence check using 89 positive place invariants in 43 ms returned sat
[2021-05-15 09:34:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 09:34:41] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2021-05-15 09:34:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 09:34:41] [INFO ] [Nat]Absence check using 89 positive place invariants in 24 ms returned sat
[2021-05-15 09:34:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 09:34:41] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2021-05-15 09:34:41] [INFO ] Computed and/alt/rep : 182/278/182 causal constraints (skipped 0 transitions) in 15 ms.
[2021-05-15 09:34:42] [INFO ] Added : 142 causal constraints over 29 iterations in 599 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
Parikh directed walk for 105600 steps, including 448 resets, run took 517 ms. (steps per millisecond=204 )
Random directed walk for 500005 steps, including 0 resets, run took 1168 ms (no deadlock found). (steps per millisecond=428 )
Random walk for 500000 steps, including 0 resets, run took 1910 ms (no deadlock found). (steps per millisecond=261 )
Random directed walk for 500000 steps, including 0 resets, run took 1151 ms (no deadlock found). (steps per millisecond=434 )
Random walk for 500000 steps, including 0 resets, run took 1908 ms (no deadlock found). (steps per millisecond=262 )
Starting structural reductions, iteration 0 : 187/187 places, 186/186 transitions.
Applied a total of 0 rules in 12 ms. Remains 187 /187 variables (removed 0) and now considering 186/186 (removed 0) transitions.
// Phase 1: matrix 186 rows 187 cols
[2021-05-15 09:34:49] [INFO ] Computed 89 place invariants in 7 ms
[2021-05-15 09:34:49] [INFO ] Implicit Places using invariants in 286 ms returned [176]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 289 ms to find 1 implicit places.
[2021-05-15 09:34:49] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 186 rows 186 cols
[2021-05-15 09:34:49] [INFO ] Computed 88 place invariants in 3 ms
[2021-05-15 09:34:49] [INFO ] Dead Transitions using invariants and state equation in 126 ms returned []
Starting structural reductions, iteration 1 : 186/187 places, 186/186 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 185 transition count 185
Applied a total of 2 rules in 19 ms. Remains 185 /186 variables (removed 1) and now considering 185/186 (removed 1) transitions.
// Phase 1: matrix 185 rows 185 cols
[2021-05-15 09:34:49] [INFO ] Computed 88 place invariants in 1 ms
[2021-05-15 09:34:49] [INFO ] Implicit Places using invariants in 108 ms returned []
// Phase 1: matrix 185 rows 185 cols
[2021-05-15 09:34:49] [INFO ] Computed 88 place invariants in 1 ms
[2021-05-15 09:34:49] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 185/187 places, 185/186 transitions.
Random walk for 1250000 steps, including 0 resets, run took 4816 ms (no deadlock found). (steps per millisecond=259 )
Random directed walk for 1250003 steps, including 0 resets, run took 2780 ms (no deadlock found). (steps per millisecond=449 )
// Phase 1: matrix 185 rows 185 cols
[2021-05-15 09:34:57] [INFO ] Computed 88 place invariants in 2 ms
[2021-05-15 09:34:57] [INFO ] [Real]Absence check using 88 positive place invariants in 25 ms returned sat
[2021-05-15 09:34:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 09:34:57] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2021-05-15 09:34:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 09:34:57] [INFO ] [Nat]Absence check using 88 positive place invariants in 15 ms returned sat
[2021-05-15 09:34:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 09:34:57] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2021-05-15 09:34:57] [INFO ] Computed and/alt/rep : 181/275/181 causal constraints (skipped 0 transitions) in 13 ms.
[2021-05-15 09:34:58] [INFO ] Added : 133 causal constraints over 27 iterations in 349 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
Parikh directed walk for 81500 steps, including 272 resets, run took 369 ms. (steps per millisecond=220 )
Random directed walk for 500006 steps, including 0 resets, run took 1132 ms (no deadlock found). (steps per millisecond=441 )
Random walk for 500000 steps, including 0 resets, run took 1905 ms (no deadlock found). (steps per millisecond=262 )
Random directed walk for 500004 steps, including 0 resets, run took 1127 ms (no deadlock found). (steps per millisecond=443 )
Finished random walk after 316429 steps, including 0 resets, run found a deadlock after 1216 ms. (steps per millisecond=260 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK

BK_STOP 1621071304732

--------------------
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="ShieldIIPt-PT-010B"
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 ShieldIIPt-PT-010B, 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 r223-tall-162098216100266"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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