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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15741.180 3600000.00 33964.00 81.30 FTFFFTFFFFTFFFTT 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-158987900300478.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-04b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987900300478
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 732K
-rw-r--r-- 1 mcc users 3.9K Mar 30 18:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 30 18:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 29 08:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 24K Mar 29 08:38 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.3K Apr 8 14:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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.6K Mar 28 04:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 28 04:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 26 23:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 26 23:03 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 547K 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-04b-ReachabilityCardinality-00
FORMULA_NAME DLCround-PT-04b-ReachabilityCardinality-01
FORMULA_NAME DLCround-PT-04b-ReachabilityCardinality-02
FORMULA_NAME DLCround-PT-04b-ReachabilityCardinality-03
FORMULA_NAME DLCround-PT-04b-ReachabilityCardinality-04
FORMULA_NAME DLCround-PT-04b-ReachabilityCardinality-05
FORMULA_NAME DLCround-PT-04b-ReachabilityCardinality-06
FORMULA_NAME DLCround-PT-04b-ReachabilityCardinality-07
FORMULA_NAME DLCround-PT-04b-ReachabilityCardinality-08
FORMULA_NAME DLCround-PT-04b-ReachabilityCardinality-09
FORMULA_NAME DLCround-PT-04b-ReachabilityCardinality-10
FORMULA_NAME DLCround-PT-04b-ReachabilityCardinality-11
FORMULA_NAME DLCround-PT-04b-ReachabilityCardinality-12
FORMULA_NAME DLCround-PT-04b-ReachabilityCardinality-13
FORMULA_NAME DLCround-PT-04b-ReachabilityCardinality-14
FORMULA_NAME DLCround-PT-04b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591233972834

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 01:26:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 01:26:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 01:26:16] [INFO ] Load time of PNML (sax parser for PT used): 322 ms
[2020-06-04 01:26:16] [INFO ] Transformed 1680 places.
[2020-06-04 01:26:16] [INFO ] Transformed 2364 transitions.
[2020-06-04 01:26:16] [INFO ] Found NUPN structural information;
[2020-06-04 01:26:16] [INFO ] Parsed PT model containing 1680 places and 2364 transitions in 431 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 145 ms.
Working with output stream class java.io.PrintStream
FORMULA DLCround-PT-04b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-04b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-04b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-04b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-04b-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 166 ms. (steps per millisecond=60 ) properties seen :[1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1]
FORMULA DLCround-PT-04b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-04b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-04b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-04b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-04b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-04b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-04b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-04b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 36 ms. (steps per millisecond=277 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 42 ms. (steps per millisecond=238 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 1]
FORMULA DLCround-PT-04b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 2364 rows 1680 cols
[2020-06-04 01:26:16] [INFO ] Computed 69 place invariants in 88 ms
[2020-06-04 01:26:17] [INFO ] [Real]Absence check using 69 positive place invariants in 225 ms returned sat
[2020-06-04 01:26:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 01:26:21] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 01:26:22] [INFO ] [Real]Absence check using state equation in 4317 ms returned (error "Failed to check-sat")
[2020-06-04 01:26:22] [INFO ] [Real]Absence check using 69 positive place invariants in 216 ms returned sat
[2020-06-04 01:26:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 01:26:27] [INFO ] [Real]Absence check using state equation in 4456 ms returned (error "Solver has unexpectedly terminated")
Support contains 12 out of 1680 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1680/1680 places, 2364/2364 transitions.
Graph (trivial) has 1594 edges and 1680 vertex of which 315 / 1680 are part of one of the 24 SCC in 45 ms
Free SCC test removed 291 places
Drop transitions removed 327 transitions
Reduce isomorphic transitions removed 327 transitions.
Performed 666 Post agglomeration using F-continuation condition.Transition count delta: 666
Iterating post reduction 0 with 993 rules applied. Total rules applied 994 place count 1389 transition count 1371
Reduce places removed 666 places and 0 transitions.
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 1 with 715 rules applied. Total rules applied 1709 place count 723 transition count 1322
Reduce places removed 22 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 30 rules applied. Total rules applied 1739 place count 701 transition count 1314
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1743 place count 697 transition count 1314
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 1743 place count 697 transition count 1306
Deduced a syphon composed of 8 places in 14 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 1759 place count 689 transition count 1306
Symmetric choice reduction at 4 with 186 rule applications. Total rules 1945 place count 689 transition count 1306
Deduced a syphon composed of 186 places in 6 ms
Reduce places removed 186 places and 186 transitions.
Iterating global reduction 4 with 372 rules applied. Total rules applied 2317 place count 503 transition count 1120
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 73 Pre rules applied. Total rules applied 2317 place count 503 transition count 1047
Deduced a syphon composed of 73 places in 7 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 2463 place count 430 transition count 1047
Symmetric choice reduction at 4 with 39 rule applications. Total rules 2502 place count 430 transition count 1047
Deduced a syphon composed of 39 places in 9 ms
Reduce places removed 39 places and 288 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 2580 place count 391 transition count 759
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 2596 place count 391 transition count 743
Performed 106 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 106 places in 4 ms
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 5 with 212 rules applied. Total rules applied 2808 place count 285 transition count 632
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2812 place count 285 transition count 628
Symmetric choice reduction at 6 with 2 rule applications. Total rules 2814 place count 285 transition count 628
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 16 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 2818 place count 283 transition count 612
Performed 37 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 6 with 74 rules applied. Total rules applied 2892 place count 246 transition count 856
Drop transitions removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 6 with 30 rules applied. Total rules applied 2922 place count 246 transition count 826
Free-agglomeration rule applied 120 times with reduction of 66 identical transitions.
Iterating global reduction 7 with 120 rules applied. Total rules applied 3042 place count 246 transition count 640
Reduce places removed 120 places and 0 transitions.
Drop transitions removed 237 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 251 transitions.
Discarding 7 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Graph (complete) has 364 edges and 126 vertex of which 119 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.8 ms
Iterating post reduction 7 with 372 rules applied. Total rules applied 3414 place count 119 transition count 377
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 3429 place count 119 transition count 362
Symmetric choice reduction at 9 with 2 rule applications. Total rules 3431 place count 119 transition count 362
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 16 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 3435 place count 117 transition count 346
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 3437 place count 117 transition count 344
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 3438 place count 117 transition count 343
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 3447 place count 116 transition count 335
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 3449 place count 115 transition count 334
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 3450 place count 115 transition count 334
Drop transitions removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 11 with 36 rules applied. Total rules applied 3486 place count 115 transition count 298
Symmetric choice reduction at 11 with 2 rule applications. Total rules 3488 place count 115 transition count 298
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 16 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 3492 place count 113 transition count 282
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 3494 place count 113 transition count 280
Free-agglomeration rule applied 2 times.
Iterating global reduction 12 with 2 rules applied. Total rules applied 3496 place count 113 transition count 278
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 15 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 16 transitions.
Discarding 3 places :
Also discarding 0 output transitions
Graph (complete) has 312 edges and 111 vertex of which 108 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Iterating post reduction 12 with 19 rules applied. Total rules applied 3515 place count 108 transition count 262
Applied a total of 3515 rules in 1043 ms. Remains 108 /1680 variables (removed 1572) and now considering 262/2364 (removed 2102) transitions.
Finished structural reductions, in 1 iterations. Remains : 108/1680 places, 262/2364 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 3961 ms. (steps per millisecond=252 ) properties seen :[0, 1]
FORMULA DLCround-PT-04b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 146 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=24 )
FORMULA DLCround-PT-04b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_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-04b"
export BK_EXAMINATION="ReachabilityCardinality"
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-04b, examination is ReachabilityCardinality"
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-158987900300478"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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