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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15725.210 3600000.00 32018.00 51.20 FTTFFTTTFFTTFFTF 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-158987914000487.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-05, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987914000487
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 260K
-rw-r--r-- 1 mcc users 3.5K Mar 26 02:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 26 02:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 22:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 22:43 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.4K Apr 8 14:43 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:43 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:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 14:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 14:37 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 85K 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-05-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591157987879

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 04:19:49] [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-03 04:19:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 04:19:49] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2020-06-03 04:19:49] [INFO ] Transformed 368 places.
[2020-06-03 04:19:49] [INFO ] Transformed 319 transitions.
[2020-06-03 04:19:49] [INFO ] Found NUPN structural information;
[2020-06-03 04:19:49] [INFO ] Parsed PT model containing 368 places and 319 transitions in 153 ms.
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 1 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 95 resets, run finished after 68 ms. (steps per millisecond=147 ) properties seen :[0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1]
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 1, 0, 0, 0, 0, 0, 0, 0]
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[1, 0, 0, 0, 0, 0, 1, 1]
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
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]
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 318 rows 367 cols
[2020-06-03 04:19:50] [INFO ] Computed 57 place invariants in 14 ms
[2020-06-03 04:19:50] [INFO ] [Real]Absence check using 41 positive place invariants in 39 ms returned sat
[2020-06-03 04:19:50] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 10 ms returned sat
[2020-06-03 04:19:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:19:50] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2020-06-03 04:19:50] [INFO ] Deduced a trap composed of 17 places in 130 ms
[2020-06-03 04:19:51] [INFO ] Deduced a trap composed of 8 places in 84 ms
[2020-06-03 04:19:51] [INFO ] Deduced a trap composed of 11 places in 82 ms
[2020-06-03 04:19:51] [INFO ] Deduced a trap composed of 12 places in 74 ms
[2020-06-03 04:19:51] [INFO ] Deduced a trap composed of 25 places in 77 ms
[2020-06-03 04:19:51] [INFO ] Deduced a trap composed of 23 places in 76 ms
[2020-06-03 04:19:51] [INFO ] Deduced a trap composed of 20 places in 62 ms
[2020-06-03 04:19:51] [INFO ] Deduced a trap composed of 27 places in 73 ms
[2020-06-03 04:19:51] [INFO ] Deduced a trap composed of 34 places in 72 ms
[2020-06-03 04:19:51] [INFO ] Deduced a trap composed of 18 places in 56 ms
[2020-06-03 04:19:51] [INFO ] Deduced a trap composed of 42 places in 38 ms
[2020-06-03 04:19:51] [INFO ] Deduced a trap composed of 40 places in 78 ms
[2020-06-03 04:19:51] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1105 ms
[2020-06-03 04:19:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:19:52] [INFO ] [Nat]Absence check using 41 positive place invariants in 110 ms returned sat
[2020-06-03 04:19:52] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 14 ms returned sat
[2020-06-03 04:19:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:19:52] [INFO ] [Nat]Absence check using state equation in 356 ms returned sat
[2020-06-03 04:19:52] [INFO ] Deduced a trap composed of 8 places in 155 ms
[2020-06-03 04:19:52] [INFO ] Deduced a trap composed of 11 places in 46 ms
[2020-06-03 04:19:52] [INFO ] Deduced a trap composed of 17 places in 102 ms
[2020-06-03 04:19:52] [INFO ] Deduced a trap composed of 10 places in 70 ms
[2020-06-03 04:19:52] [INFO ] Deduced a trap composed of 36 places in 44 ms
[2020-06-03 04:19:53] [INFO ] Deduced a trap composed of 41 places in 45 ms
[2020-06-03 04:19:53] [INFO ] Deduced a trap composed of 21 places in 110 ms
[2020-06-03 04:19:53] [INFO ] Deduced a trap composed of 51 places in 111 ms
[2020-06-03 04:19:53] [INFO ] Deduced a trap composed of 54 places in 77 ms
[2020-06-03 04:19:53] [INFO ] Deduced a trap composed of 38 places in 75 ms
[2020-06-03 04:19:53] [INFO ] Deduced a trap composed of 31 places in 98 ms
[2020-06-03 04:19:53] [INFO ] Deduced a trap composed of 63 places in 78 ms
[2020-06-03 04:19:53] [INFO ] Deduced a trap composed of 27 places in 21 ms
[2020-06-03 04:19:53] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1248 ms
[2020-06-03 04:19:53] [INFO ] Computed and/alt/rep : 317/1114/317 causal constraints in 12 ms.
[2020-06-03 04:19:54] [INFO ] Added : 224 causal constraints over 46 iterations in 1276 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 28 ms.
[2020-06-03 04:19:55] [INFO ] [Real]Absence check using 41 positive place invariants in 39 ms returned unsat
[2020-06-03 04:19:55] [INFO ] [Real]Absence check using 41 positive place invariants in 20 ms returned sat
[2020-06-03 04:19:55] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 4 ms returned sat
[2020-06-03 04:19:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:19:55] [INFO ] [Real]Absence check using state equation in 467 ms returned sat
[2020-06-03 04:19:55] [INFO ] Deduced a trap composed of 9 places in 129 ms
[2020-06-03 04:19:56] [INFO ] Deduced a trap composed of 22 places in 133 ms
[2020-06-03 04:19:56] [INFO ] Deduced a trap composed of 25 places in 578 ms
[2020-06-03 04:19:56] [INFO ] Deduced a trap composed of 19 places in 168 ms
[2020-06-03 04:19:57] [INFO ] Deduced a trap composed of 18 places in 252 ms
[2020-06-03 04:19:57] [INFO ] Deduced a trap composed of 23 places in 79 ms
[2020-06-03 04:19:57] [INFO ] Deduced a trap composed of 17 places in 166 ms
[2020-06-03 04:19:57] [INFO ] Deduced a trap composed of 21 places in 104 ms
[2020-06-03 04:19:57] [INFO ] Deduced a trap composed of 15 places in 95 ms
[2020-06-03 04:19:58] [INFO ] Deduced a trap composed of 23 places in 1009 ms
[2020-06-03 04:19:58] [INFO ] Deduced a trap composed of 17 places in 95 ms
[2020-06-03 04:19:58] [INFO ] Deduced a trap composed of 21 places in 94 ms
[2020-06-03 04:19:59] [INFO ] Deduced a trap composed of 17 places in 86 ms
[2020-06-03 04:19:59] [INFO ] Deduced a trap composed of 30 places in 96 ms
[2020-06-03 04:19:59] [INFO ] Deduced a trap composed of 8 places in 53 ms
[2020-06-03 04:19:59] [INFO ] Deduced a trap composed of 17 places in 85 ms
[2020-06-03 04:19:59] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3522 ms
[2020-06-03 04:19:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:19:59] [INFO ] [Nat]Absence check using 41 positive place invariants in 323 ms returned sat
[2020-06-03 04:19:59] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 80 ms returned sat
[2020-06-03 04:19:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:20:00] [INFO ] [Nat]Absence check using state equation in 1112 ms returned sat
[2020-06-03 04:20:01] [INFO ] Deduced a trap composed of 8 places in 88 ms
[2020-06-03 04:20:01] [INFO ] Deduced a trap composed of 17 places in 83 ms
[2020-06-03 04:20:01] [INFO ] Deduced a trap composed of 24 places in 84 ms
[2020-06-03 04:20:01] [INFO ] Deduced a trap composed of 93 places in 80 ms
[2020-06-03 04:20:01] [INFO ] Deduced a trap composed of 15 places in 80 ms
[2020-06-03 04:20:01] [INFO ] Deduced a trap composed of 20 places in 79 ms
[2020-06-03 04:20:01] [INFO ] Deduced a trap composed of 28 places in 81 ms
[2020-06-03 04:20:01] [INFO ] Deduced a trap composed of 19 places in 76 ms
[2020-06-03 04:20:01] [INFO ] Deduced a trap composed of 19 places in 77 ms
[2020-06-03 04:20:01] [INFO ] Deduced a trap composed of 17 places in 78 ms
[2020-06-03 04:20:02] [INFO ] Deduced a trap composed of 94 places in 75 ms
[2020-06-03 04:20:02] [INFO ] Deduced a trap composed of 35 places in 75 ms
[2020-06-03 04:20:02] [INFO ] Deduced a trap composed of 31 places in 74 ms
[2020-06-03 04:20:02] [INFO ] Deduced a trap composed of 91 places in 86 ms
[2020-06-03 04:20:02] [INFO ] Deduced a trap composed of 96 places in 86 ms
[2020-06-03 04:20:02] [INFO ] Deduced a trap composed of 36 places in 88 ms
[2020-06-03 04:20:02] [INFO ] Deduced a trap composed of 100 places in 87 ms
[2020-06-03 04:20:02] [INFO ] Deduced a trap composed of 93 places in 86 ms
[2020-06-03 04:20:02] [INFO ] Deduced a trap composed of 26 places in 84 ms
[2020-06-03 04:20:03] [INFO ] Deduced a trap composed of 88 places in 92 ms
[2020-06-03 04:20:03] [INFO ] Deduced a trap composed of 32 places in 51 ms
[2020-06-03 04:20:03] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2196 ms
[2020-06-03 04:20:03] [INFO ] Computed and/alt/rep : 317/1114/317 causal constraints in 25 ms.
[2020-06-03 04:20:04] [INFO ] Added : 215 causal constraints over 43 iterations in 1125 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 15 ms.
[2020-06-03 04:20:04] [INFO ] [Real]Absence check using 41 positive place invariants in 159 ms returned unsat
[2020-06-03 04:20:04] [INFO ] [Real]Absence check using 41 positive place invariants in 12 ms returned unsat
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Finished Parikh walk after 192 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=96 )
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_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-05"
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 BusinessProcesses-PT-05, 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 r182-oct2-158987914000487"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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