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

About the Execution of ITS-LoLa for SmartHome-PT-06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15740.490 3600000.00 34608.00 170.30 FTTTFTTFTFTFTFTT 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.r228-oct2-159033547000047.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 SmartHome-PT-06, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r228-oct2-159033547000047
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 212K
-rw-r--r-- 1 mcc users 3.1K May 14 03:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 14 03:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 13 21:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 21:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 14 10:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 14 10:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 14 10:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.1K May 13 15:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 13 15:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 13 10:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 13 10:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 56K May 12 20:42 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 SmartHome-PT-06-ReachabilityFireability-00
FORMULA_NAME SmartHome-PT-06-ReachabilityFireability-01
FORMULA_NAME SmartHome-PT-06-ReachabilityFireability-02
FORMULA_NAME SmartHome-PT-06-ReachabilityFireability-03
FORMULA_NAME SmartHome-PT-06-ReachabilityFireability-04
FORMULA_NAME SmartHome-PT-06-ReachabilityFireability-05
FORMULA_NAME SmartHome-PT-06-ReachabilityFireability-06
FORMULA_NAME SmartHome-PT-06-ReachabilityFireability-07
FORMULA_NAME SmartHome-PT-06-ReachabilityFireability-08
FORMULA_NAME SmartHome-PT-06-ReachabilityFireability-09
FORMULA_NAME SmartHome-PT-06-ReachabilityFireability-10
FORMULA_NAME SmartHome-PT-06-ReachabilityFireability-11
FORMULA_NAME SmartHome-PT-06-ReachabilityFireability-12
FORMULA_NAME SmartHome-PT-06-ReachabilityFireability-13
FORMULA_NAME SmartHome-PT-06-ReachabilityFireability-14
FORMULA_NAME SmartHome-PT-06-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591288205499

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 16:30:09] [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 16:30:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 16:30:09] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2020-06-04 16:30:09] [INFO ] Transformed 219 places.
[2020-06-04 16:30:09] [INFO ] Transformed 254 transitions.
[2020-06-04 16:30:09] [INFO ] Found NUPN structural information;
[2020-06-04 16:30:09] [INFO ] Parsed PT model containing 219 places and 254 transitions in 149 ms.
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 18 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 75 ms.
Working with output stream class java.io.PrintStream
FORMULA SmartHome-PT-06-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 62 resets, run finished after 54 ms. (steps per millisecond=185 ) properties seen :[1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0]
FORMULA SmartHome-PT-06-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-06-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-06-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-06-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-06-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-06-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-06-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-06-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 1, 0, 0, 0]
FORMULA SmartHome-PT-06-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 40 ms. (steps per millisecond=250 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 1, 0]
FORMULA SmartHome-PT-06-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 236 rows 202 cols
[2020-06-04 16:30:10] [INFO ] Computed 9 place invariants in 10 ms
[2020-06-04 16:30:11] [INFO ] [Real]Absence check using 9 positive place invariants in 54 ms returned unsat
[2020-06-04 16:30:11] [INFO ] [Real]Absence check using 9 positive place invariants in 36 ms returned unsat
[2020-06-04 16:30:11] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2020-06-04 16:30:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 16:30:11] [INFO ] [Real]Absence check using state equation in 253 ms returned sat
[2020-06-04 16:30:12] [INFO ] Deduced a trap composed of 76 places in 957 ms
[2020-06-04 16:30:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1066 ms
[2020-06-04 16:30:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 16:30:13] [INFO ] [Nat]Absence check using 9 positive place invariants in 139 ms returned sat
[2020-06-04 16:30:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 16:30:13] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2020-06-04 16:30:13] [INFO ] Deduced a trap composed of 33 places in 176 ms
[2020-06-04 16:30:14] [INFO ] Deduced a trap composed of 27 places in 1081 ms
[2020-06-04 16:30:16] [INFO ] Deduced a trap composed of 57 places in 1421 ms
[2020-06-04 16:30:16] [INFO ] Deduced a trap composed of 47 places in 43 ms
[2020-06-04 16:30:17] [INFO ] Deduced a trap composed of 76 places in 1174 ms
[2020-06-04 16:30:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 4030 ms
[2020-06-04 16:30:17] [INFO ] Computed and/alt/rep : 235/716/235 causal constraints in 53 ms.
[2020-06-04 16:30:18] [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 (=> (> t82 0) (and (> t81 0) (< o81 o82)))") while checking expression at index 2
[2020-06-04 16:30:18] [INFO ] [Real]Absence check using 9 positive place invariants in 85 ms returned unsat
[2020-06-04 16:30:18] [INFO ] [Real]Absence check using 9 positive place invariants in 17 ms returned sat
[2020-06-04 16:30:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 16:30:18] [INFO ] [Real]Absence check using state equation in 435 ms returned sat
[2020-06-04 16:30:18] [INFO ] Computed and/alt/rep : 235/716/235 causal constraints in 15 ms.
[2020-06-04 16:30:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 16:30:18] [INFO ] [Nat]Absence check using 9 positive place invariants in 61 ms returned sat
[2020-06-04 16:30:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 16:30:19] [INFO ] [Nat]Absence check using state equation in 696 ms returned sat
[2020-06-04 16:30:19] [INFO ] Computed and/alt/rep : 235/716/235 causal constraints in 35 ms.
[2020-06-04 16:30:21] [INFO ] Added : 235 causal constraints over 48 iterations in 1962 ms. Result :sat
[2020-06-04 16:30:21] [INFO ] Deduced a trap composed of 27 places in 72 ms
[2020-06-04 16:30:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
Attempting to minimize the solution found.
Minimization took 16 ms.
FORMULA SmartHome-PT-06-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SmartHome-PT-06-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SmartHome-PT-06-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 23700 steps, including 150 resets, run finished after 65 ms. (steps per millisecond=364 ) properties seen :[0, 1] could not realise parikh vector
FORMULA SmartHome-PT-06-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 202 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 202/202 places, 236/236 transitions.
Graph (trivial) has 198 edges and 202 vertex of which 77 / 202 are part of one of the 5 SCC in 31 ms
Free SCC test removed 72 places
Drop transitions removed 94 transitions
Reduce isomorphic transitions removed 94 transitions.
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Iterating post reduction 0 with 143 rules applied. Total rules applied 144 place count 130 transition count 93
Reduce places removed 49 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 1 with 58 rules applied. Total rules applied 202 place count 81 transition count 84
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 206 place count 77 transition count 84
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 206 place count 77 transition count 79
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 216 place count 72 transition count 79
Symmetric choice reduction at 3 with 28 rule applications. Total rules 244 place count 72 transition count 79
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 28 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 300 place count 44 transition count 51
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 305 place count 44 transition count 46
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 305 place count 44 transition count 42
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 313 place count 40 transition count 42
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 335 place count 29 transition count 31
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Discarding 2 places :
Also discarding 0 output transitions
Graph (complete) has 81 edges and 29 vertex of which 27 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Iterating post reduction 4 with 10 rules applied. Total rules applied 345 place count 27 transition count 22
Free-agglomeration rule applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 350 place count 27 transition count 17
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 355 place count 22 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 356 place count 21 transition count 16
Reduce places removed 4 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 6 with 9 rules applied. Total rules applied 365 place count 17 transition count 11
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 370 place count 12 transition count 11
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 5 Pre rules applied. Total rules applied 370 place count 12 transition count 6
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 11 rules applied. Total rules applied 381 place count 6 transition count 6
Symmetric choice reduction at 8 with 1 rule applications. Total rules 382 place count 6 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 384 place count 5 transition count 5
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 385 place count 5 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 386 place count 4 transition count 4
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 387 place count 4 transition count 4
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 388 place count 4 transition count 3
Applied a total of 388 rules in 106 ms. Remains 4 /202 variables (removed 198) and now considering 3/236 (removed 233) transitions.
Finished structural reductions, in 1 iterations. Remains : 4/202 places, 3/236 transitions.
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
FORMULA SmartHome-PT-06-ReachabilityFireability-06 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="SmartHome-PT-06"
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 SmartHome-PT-06, 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 r228-oct2-159033547000047"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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