fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r180-ebro-158987900300511
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for DLCround-PT-06b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15741.860 3600000.00 43842.00 116.40 TTFTTTTTFFTTTTFT 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.r180-ebro-158987900300511.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 itslola
Input is DLCround-PT-06b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987900300511
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 988K
-rw-r--r-- 1 mcc users 3.8K Mar 30 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 30 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 29 08:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 29 08:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 8 14:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 04:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 28 04:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 26 23:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 26 23:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 813K 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

here is the order used to build the result vector(from text file)
FORMULA_NAME DLCround-PT-06b-ReachabilityFireability-00
FORMULA_NAME DLCround-PT-06b-ReachabilityFireability-01
FORMULA_NAME DLCround-PT-06b-ReachabilityFireability-02
FORMULA_NAME DLCround-PT-06b-ReachabilityFireability-03
FORMULA_NAME DLCround-PT-06b-ReachabilityFireability-04
FORMULA_NAME DLCround-PT-06b-ReachabilityFireability-05
FORMULA_NAME DLCround-PT-06b-ReachabilityFireability-06
FORMULA_NAME DLCround-PT-06b-ReachabilityFireability-07
FORMULA_NAME DLCround-PT-06b-ReachabilityFireability-08
FORMULA_NAME DLCround-PT-06b-ReachabilityFireability-09
FORMULA_NAME DLCround-PT-06b-ReachabilityFireability-10
FORMULA_NAME DLCround-PT-06b-ReachabilityFireability-11
FORMULA_NAME DLCround-PT-06b-ReachabilityFireability-12
FORMULA_NAME DLCround-PT-06b-ReachabilityFireability-13
FORMULA_NAME DLCround-PT-06b-ReachabilityFireability-14
FORMULA_NAME DLCround-PT-06b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591241149022

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 03:25:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 03:25:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 03:25:52] [INFO ] Load time of PNML (sax parser for PT used): 482 ms
[2020-06-04 03:25:52] [INFO ] Transformed 2340 places.
[2020-06-04 03:25:52] [INFO ] Transformed 3456 transitions.
[2020-06-04 03:25:52] [INFO ] Found NUPN structural information;
[2020-06-04 03:25:52] [INFO ] Parsed PT model containing 2340 places and 3456 transitions in 659 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 424 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 266 ms. (steps per millisecond=37 ) properties seen :[1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1]
FORMULA DLCround-PT-06b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 60 ms. (steps per millisecond=166 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 47 ms. (steps per millisecond=212 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 49 ms. (steps per millisecond=204 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 43 ms. (steps per millisecond=232 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 3456 rows 2340 cols
[2020-06-04 03:25:54] [INFO ] Computed 109 place invariants in 129 ms
[2020-06-04 03:25:55] [INFO ] [Real]Absence check using 109 positive place invariants in 414 ms returned sat
[2020-06-04 03:25:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:25:59] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 03:25:59] [INFO ] [Real]Absence check using state equation in 4002 ms returned (error "Failed to check-sat")
[2020-06-04 03:26:00] [INFO ] [Real]Absence check using 109 positive place invariants in 361 ms returned sat
[2020-06-04 03:26:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:26:04] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 03:26:04] [INFO ] [Real]Absence check using state equation in 4202 ms returned (error "Failed to check-sat")
[2020-06-04 03:26:05] [INFO ] [Real]Absence check using 109 positive place invariants in 405 ms returned sat
[2020-06-04 03:26:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:26:09] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 03:26:09] [INFO ] [Real]Absence check using state equation in 4153 ms returned (error "Failed to check-sat")
[2020-06-04 03:26:10] [INFO ] [Real]Absence check using 109 positive place invariants in 397 ms returned sat
[2020-06-04 03:26:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:26:14] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 03:26:14] [INFO ] [Real]Absence check using state equation in 4150 ms returned unknown
Support contains 25 out of 2340 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2340/2340 places, 3456/3456 transitions.
Graph (trivial) has 2177 edges and 2340 vertex of which 456 / 2340 are part of one of the 32 SCC in 26 ms
Free SCC test removed 424 places
Drop transitions removed 474 transitions
Reduce isomorphic transitions removed 474 transitions.
Performed 861 Post agglomeration using F-continuation condition.Transition count delta: 861
Iterating post reduction 0 with 1335 rules applied. Total rules applied 1336 place count 1916 transition count 2121
Reduce places removed 861 places and 0 transitions.
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Iterating post reduction 1 with 918 rules applied. Total rules applied 2254 place count 1055 transition count 2064
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 34 rules applied. Total rules applied 2288 place count 1029 transition count 2056
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 2292 place count 1025 transition count 2056
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 2292 place count 1025 transition count 2048
Deduced a syphon composed of 8 places in 20 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 2308 place count 1017 transition count 2048
Symmetric choice reduction at 4 with 280 rule applications. Total rules 2588 place count 1017 transition count 2048
Deduced a syphon composed of 280 places in 17 ms
Reduce places removed 280 places and 280 transitions.
Iterating global reduction 4 with 560 rules applied. Total rules applied 3148 place count 737 transition count 1768
Performed 115 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 115 Pre rules applied. Total rules applied 3148 place count 737 transition count 1653
Deduced a syphon composed of 115 places in 21 ms
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 4 with 230 rules applied. Total rules applied 3378 place count 622 transition count 1653
Symmetric choice reduction at 4 with 48 rule applications. Total rules 3426 place count 622 transition count 1653
Deduced a syphon composed of 48 places in 20 ms
Reduce places removed 48 places and 465 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 3522 place count 574 transition count 1188
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 3538 place count 574 transition count 1172
Performed 148 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 148 places in 1 ms
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 5 with 296 rules applied. Total rules applied 3834 place count 426 transition count 1019
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 3840 place count 426 transition count 1013
Performed 36 Post agglomeration using F-continuation condition with reduction of 21 identical transitions.
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 6 with 72 rules applied. Total rules applied 3912 place count 390 transition count 1305
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 3923 place count 390 transition count 1294
Free-agglomeration rule applied 214 times with reduction of 128 identical transitions.
Iterating global reduction 7 with 214 rules applied. Total rules applied 4137 place count 390 transition count 952
Reduce places removed 214 places and 0 transitions.
Drop transitions removed 392 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 401 transitions.
Discarding 8 places :
Also discarding 15 output transitions
Drop transitions removed 15 transitions
Graph (complete) has 519 edges and 176 vertex of which 168 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.9 ms
Iterating post reduction 7 with 616 rules applied. Total rules applied 4753 place count 168 transition count 536
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 4771 place count 168 transition count 518
Symmetric choice reduction at 9 with 5 rule applications. Total rules 4776 place count 168 transition count 518
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 50 transitions.
Iterating global reduction 9 with 10 rules applied. Total rules applied 4786 place count 163 transition count 468
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 4789 place count 163 transition count 465
Drop transitions removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 10 with 40 rules applied. Total rules applied 4829 place count 163 transition count 425
Symmetric choice reduction at 10 with 6 rule applications. Total rules 4835 place count 163 transition count 425
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 60 transitions.
Iterating global reduction 10 with 12 rules applied. Total rules applied 4847 place count 157 transition count 365
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 4853 place count 157 transition count 359
Free-agglomeration rule applied 3 times.
Iterating global reduction 11 with 3 rules applied. Total rules applied 4856 place count 157 transition count 356
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 25 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 30 transitions.
Discarding 4 places :
Also discarding 0 output transitions
Graph (complete) has 442 edges and 154 vertex of which 150 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Iterating post reduction 11 with 34 rules applied. Total rules applied 4890 place count 150 transition count 326
Applied a total of 4890 rules in 1201 ms. Remains 150 /2340 variables (removed 2190) and now considering 326/3456 (removed 3130) transitions.
Finished structural reductions, in 1 iterations. Remains : 150/2340 places, 326/3456 transitions.
Finished random walk after 9003 steps, including 0 resets, run visited all 4 properties in 71 ms. (steps per millisecond=126 )
FORMULA DLCround-PT-06b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

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

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="DLCround-PT-06b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 itslola"
echo " Input is DLCround-PT-06b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r180-ebro-158987900300511"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-06b.tgz
mv DLCround-PT-06b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;