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

About the Execution of ITS-LoLa for BusinessProcesses-PT-17

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15730.160 3600000.00 58032.00 122.50 FTTFTTFTTFFTTFTF 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-158987914100582.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 BusinessProcesses-PT-17, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987914100582
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 356K
-rw-r--r-- 1 mcc users 4.3K Mar 26 02:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 26 02:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 22:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 22:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 8 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 25 17:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 25 17:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 25 14:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 161K 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 BusinessProcesses-PT-17-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591165923914

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 06:32:06] [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-03 06:32:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 06:32:06] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2020-06-03 06:32:06] [INFO ] Transformed 650 places.
[2020-06-03 06:32:07] [INFO ] Transformed 580 transitions.
[2020-06-03 06:32:07] [INFO ] Found NUPN structural information;
[2020-06-03 06:32:07] [INFO ] Parsed PT model containing 650 places and 580 transitions in 200 ms.
Deduced a syphon composed of 4 places in 17 ms
Reduce places removed 4 places and 4 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 51 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 67 resets, run finished after 58 ms. (steps per millisecond=172 ) properties seen :[0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0]
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 45 ms. (steps per millisecond=222 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 1, 0, 0]
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 47 ms. (steps per millisecond=212 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 576 rows 646 cols
[2020-06-03 06:32:07] [INFO ] Computed 108 place invariants in 26 ms
[2020-06-03 06:32:07] [INFO ] [Real]Absence check using 62 positive place invariants in 72 ms returned sat
[2020-06-03 06:32:07] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 66 ms returned sat
[2020-06-03 06:32:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:32:09] [INFO ] [Real]Absence check using state equation in 1615 ms returned sat
[2020-06-03 06:32:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:32:09] [INFO ] [Nat]Absence check using 62 positive place invariants in 137 ms returned unsat
[2020-06-03 06:32:10] [INFO ] [Real]Absence check using 62 positive place invariants in 185 ms returned sat
[2020-06-03 06:32:10] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 44 ms returned sat
[2020-06-03 06:32:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:32:11] [INFO ] [Real]Absence check using state equation in 1379 ms returned sat
[2020-06-03 06:32:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:32:12] [INFO ] [Nat]Absence check using 62 positive place invariants in 129 ms returned sat
[2020-06-03 06:32:12] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 43 ms returned sat
[2020-06-03 06:32:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:32:13] [INFO ] [Nat]Absence check using state equation in 1810 ms returned sat
[2020-06-03 06:32:14] [INFO ] Deduced a trap composed of 16 places in 412 ms
[2020-06-03 06:32:16] [INFO ] Deduced a trap composed of 16 places in 2511 ms
[2020-06-03 06:32:16] [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 (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s223 s420 s421 s422 s585 s586) 0)") while checking expression at index 1
[2020-06-03 06:32:17] [INFO ] [Real]Absence check using 62 positive place invariants in 107 ms returned sat
[2020-06-03 06:32:17] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 291 ms returned sat
[2020-06-03 06:32:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:32:19] [INFO ] [Real]Absence check using state equation in 2090 ms returned unsat
[2020-06-03 06:32:19] [INFO ] [Real]Absence check using 62 positive place invariants in 265 ms returned sat
[2020-06-03 06:32:19] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 29 ms returned sat
[2020-06-03 06:32:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:32:23] [INFO ] [Real]Absence check using state equation in 4013 ms returned sat
[2020-06-03 06:32:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:32:24] [INFO ] [Nat]Absence check using 62 positive place invariants in 16 ms returned unsat
[2020-06-03 06:32:24] [INFO ] [Real]Absence check using 62 positive place invariants in 307 ms returned sat
[2020-06-03 06:32:24] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 41 ms returned sat
[2020-06-03 06:32:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:32:26] [INFO ] [Real]Absence check using state equation in 1942 ms returned sat
[2020-06-03 06:32:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:32:27] [INFO ] [Nat]Absence check using 62 positive place invariants in 221 ms returned sat
[2020-06-03 06:32:27] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 44 ms returned sat
[2020-06-03 06:32:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:32:27] [INFO ] [Nat]Absence check using state equation in 806 ms returned sat
[2020-06-03 06:32:31] [INFO ] Deduced a trap composed of 17 places in 3181 ms
[2020-06-03 06:32:31] [INFO ] Deduced a trap composed of 11 places in 279 ms
[2020-06-03 06:32:31] [INFO ] Deduced a trap composed of 16 places in 260 ms
[2020-06-03 06:32:31] [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 (> (+ s0 s1 s2 s3 s4 s5 s6 s241 s246 s247 s440 s441 s442 s445 s446 s447) 0)") while checking expression at index 4
[2020-06-03 06:32:31] [INFO ] [Real]Absence check using 62 positive place invariants in 82 ms returned sat
[2020-06-03 06:32:31] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 49 ms returned sat
[2020-06-03 06:32:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:32:34] [INFO ] [Real]Absence check using state equation in 2553 ms returned sat
[2020-06-03 06:32:35] [INFO ] Deduced a trap composed of 23 places in 463 ms
[2020-06-03 06:32:35] [INFO ] Deduced a trap composed of 23 places in 883 ms
[2020-06-03 06:32:36] [INFO ] Deduced a trap composed of 22 places in 214 ms
[2020-06-03 06:32:37] [INFO ] Deduced a trap composed of 12 places in 896 ms
[2020-06-03 06:32:37] [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 (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s235 s440 s441 s442) 0)") while checking expression at index 5
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 14 out of 646 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 646/646 places, 576/576 transitions.
Graph (trivial) has 356 edges and 646 vertex of which 7 / 646 are part of one of the 1 SCC in 34 ms
Free SCC test removed 6 places
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 1304 edges and 640 vertex of which 636 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.8 ms
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Iterating post reduction 0 with 148 rules applied. Total rules applied 150 place count 636 transition count 427
Reduce places removed 140 places and 0 transitions.
Iterating post reduction 1 with 140 rules applied. Total rules applied 290 place count 496 transition count 427
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 92 Pre rules applied. Total rules applied 290 place count 496 transition count 335
Deduced a syphon composed of 92 places in 18 ms
Ensure Unique test removed 19 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 203 rules applied. Total rules applied 493 place count 385 transition count 335
Symmetric choice reduction at 2 with 78 rule applications. Total rules 571 place count 385 transition count 335
Deduced a syphon composed of 78 places in 1 ms
Reduce places removed 78 places and 78 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 727 place count 307 transition count 257
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 727 place count 307 transition count 249
Deduced a syphon composed of 8 places in 8 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 745 place count 297 transition count 249
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 199 rules applied. Total rules applied 944 place count 196 transition count 151
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 946 place count 195 transition count 155
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 948 place count 195 transition count 153
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 950 place count 193 transition count 153
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 954 place count 193 transition count 153
Applied a total of 954 rules in 260 ms. Remains 193 /646 variables (removed 453) and now considering 153/576 (removed 423) transitions.
Finished structural reductions, in 1 iterations. Remains : 193/646 places, 153/576 transitions.
Finished random walk after 1106 steps, including 20 resets, run visited all 3 properties in 15 ms. (steps per millisecond=73 )
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-02 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="BusinessProcesses-PT-17"
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 BusinessProcesses-PT-17, 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-158987914100582"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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