fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r182-oct2-158987913400118
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for BART-PT-050

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15742.390 3600000.00 177288.00 235.70 FTFFFFTTTFFFTTFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r182-oct2-158987913400118.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-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 itslola
Input is BART-PT-050, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987913400118
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 22M
-rw-r--r-- 1 mcc users 4.6K Apr 15 13:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 15 13:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Apr 15 13:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 15 13:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 1.5M Apr 8 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 3.7M Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.4M Apr 8 14:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 3.3M Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Apr 15 13:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 15 13:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Apr 15 13:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 15 13:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 15 13:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 15 13:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 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 12M 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 BART-PT-050-ReachabilityCardinality-00
FORMULA_NAME BART-PT-050-ReachabilityCardinality-01
FORMULA_NAME BART-PT-050-ReachabilityCardinality-02
FORMULA_NAME BART-PT-050-ReachabilityCardinality-03
FORMULA_NAME BART-PT-050-ReachabilityCardinality-04
FORMULA_NAME BART-PT-050-ReachabilityCardinality-05
FORMULA_NAME BART-PT-050-ReachabilityCardinality-06
FORMULA_NAME BART-PT-050-ReachabilityCardinality-07
FORMULA_NAME BART-PT-050-ReachabilityCardinality-08
FORMULA_NAME BART-PT-050-ReachabilityCardinality-09
FORMULA_NAME BART-PT-050-ReachabilityCardinality-10
FORMULA_NAME BART-PT-050-ReachabilityCardinality-11
FORMULA_NAME BART-PT-050-ReachabilityCardinality-12
FORMULA_NAME BART-PT-050-ReachabilityCardinality-13
FORMULA_NAME BART-PT-050-ReachabilityCardinality-14
FORMULA_NAME BART-PT-050-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591128066066

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 20:01:08] [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-02 20:01:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 20:01:09] [INFO ] Load time of PNML (sax parser for PT used): 636 ms
[2020-06-02 20:01:09] [INFO ] Transformed 6810 places.
[2020-06-02 20:01:09] [INFO ] Transformed 10100 transitions.
[2020-06-02 20:01:09] [INFO ] Found NUPN structural information;
[2020-06-02 20:01:09] [INFO ] Parsed PT model containing 6810 places and 10100 transitions in 813 ms.
Reduce places removed 210 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 248 ms.
Working with output stream class java.io.PrintStream
FORMULA BART-PT-050-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-050-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-050-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 218 ms. (steps per millisecond=45 ) properties seen :[0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0]
FORMULA BART-PT-050-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-050-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-050-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-050-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-050-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 10100 rows 6600 cols
[2020-06-02 20:01:10] [INFO ] Computed 50 place invariants in 164 ms
[2020-06-02 20:01:12] [INFO ] [Real]Absence check using 50 positive place invariants in 718 ms returned sat
[2020-06-02 20:01:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:01:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (= s89 (- t6739 t39))") while checking expression at index 0
[2020-06-02 20:01:17] [INFO ] [Real]Absence check using 50 positive place invariants in 597 ms returned sat
[2020-06-02 20:01:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:01:20] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:01:20] [INFO ] [Real]Absence check using state equation in 3559 ms returned (error "Failed to check-sat")
[2020-06-02 20:01:22] [INFO ] [Real]Absence check using 50 positive place invariants in 665 ms returned sat
[2020-06-02 20:01:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:01:25] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:01:25] [INFO ] [Real]Absence check using state equation in 3621 ms returned (error "Failed to check-sat")
[2020-06-02 20:01:26] [INFO ] [Real]Absence check using 50 positive place invariants in 566 ms returned sat
[2020-06-02 20:01:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:01:30] [INFO ] [Real]Absence check using state equation in 3822 ms returned (error "Solver has unexpectedly terminated")
[2020-06-02 20:01:32] [INFO ] [Real]Absence check using 50 positive place invariants in 732 ms returned sat
[2020-06-02 20:01:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:01:35] [INFO ] [Real]Absence check using state equation in 3055 ms returned (error "Solver has unexpectedly terminated")
[2020-06-02 20:01:37] [INFO ] [Real]Absence check using 50 positive place invariants in 570 ms returned sat
[2020-06-02 20:01:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:01:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (= s162 (- (+ t6312 t6812) t6762))") while checking expression at index 5
[2020-06-02 20:01:42] [INFO ] [Real]Absence check using 50 positive place invariants in 742 ms returned sat
[2020-06-02 20:01:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:01:45] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:01:45] [INFO ] [Real]Absence check using state equation in 3161 ms returned (error "Failed to check-sat")
[2020-06-02 20:01:47] [INFO ] [Real]Absence check using 50 positive place invariants in 511 ms returned sat
[2020-06-02 20:01:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:01:50] [INFO ] [Real]Absence check using state equation in 3124 ms returned sat
[2020-06-02 20:02:51] [INFO ] Deduced a trap composed of 132 places in 61087 ms
[2020-06-02 20:02:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s45 s95 s145 s195 s245 s295 s345 s395 s445 s495 s545 s595 s645 s695 s745 s795 s845 s895 s945 s995 s1045 s1095 s1145 s1195 s1245 s1295 s1345 s1395 s1445 s1495 s1545 s1595 s1645 s1695 s1745 s1795 s1845 s1895 s1945 s1995 s2045 s2095 s2145 s2195 s2245 s2295 s2345 s2395 s2445 s2495 s2545 s2595 s2645 s2695 s2745 s2795 s2845 s2895 s2945 s2995 s3045 s3095 s3145 s3195 s3245 s3295 s3345 s3395 s3445 s3495 s3545 s3595 s3645 s3695 s3745 s3795 s3845 s3895 s3945 s3995 s4045 s4095 s4145 s4195 s4245 s4295 s4345 s4395 s4445 s4495 s4545 s4595 s4645 s4695 s4745 s4795 s4845 s4895 s4945 s4995 s5045 s5095 s5145 s5195 s5245 s5295 s5345 s5395 s5445 s5495 s5545 s5595 s5645 s5695 s5745 s5795 s5845 s5895 s5945 s5995 s6045 s6095 s6145 s6195 s6245 s6295 s6345 s6395 s6445 s6495 s6545 s6595) 0)") while checking expression at index 7
Support contains 39 out of 6600 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Graph (trivial) has 9989 edges and 6600 vertex of which 6384 / 6600 are part of one of the 50 SCC in 74 ms
Free SCC test removed 6334 places
Discarding 21 places :
Also discarding 4242 output transitions
Drop transitions removed 4242 transitions
Graph (complete) has 308 edges and 266 vertex of which 245 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.58 ms
Drop transitions removed 5539 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 5550 transitions.
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Iterating post reduction 0 with 5676 rules applied. Total rules applied 5678 place count 245 transition count 182
Reduce places removed 126 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 151 rules applied. Total rules applied 5829 place count 119 transition count 157
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 19 rules applied. Total rules applied 5848 place count 112 transition count 145
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 3 with 15 rules applied. Total rules applied 5863 place count 107 transition count 135
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 4 with 14 rules applied. Total rules applied 5877 place count 102 transition count 126
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 8 rules applied. Total rules applied 5885 place count 98 transition count 122
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 5887 place count 97 transition count 121
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 5887 place count 97 transition count 119
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 5891 place count 95 transition count 119
Symmetric choice reduction at 7 with 10 rule applications. Total rules 5901 place count 95 transition count 119
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 10 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 5921 place count 85 transition count 109
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 5931 place count 85 transition count 99
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 6 Pre rules applied. Total rules applied 5931 place count 85 transition count 93
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 5943 place count 79 transition count 93
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 5947 place count 77 transition count 91
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 5949 place count 77 transition count 89
Free-agglomeration rule applied 8 times.
Iterating global reduction 9 with 8 rules applied. Total rules applied 5957 place count 77 transition count 81
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 5967 place count 69 transition count 79
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 5968 place count 69 transition count 79
Applied a total of 5968 rules in 297 ms. Remains 69 /6600 variables (removed 6531) and now considering 79/10100 (removed 10021) transitions.
Finished structural reductions, in 1 iterations. Remains : 69/6600 places, 79/10100 transitions.
Finished random walk after 300 steps, including 0 resets, run visited all 8 properties in 3 ms. (steps per millisecond=100 )
FORMULA BART-PT-050-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-050-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-050-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-050-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-050-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-050-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-050-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BART-PT-050-ReachabilityCardinality-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="BART-PT-050"
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 BART-PT-050, 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 r182-oct2-158987913400118"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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