fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r217-smll-167840359000158
Last Updated
May 14, 2023

About the Execution of Smart+red for HealthRecord-PT-03

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
244.575 11859.00 20538.00 671.20 F normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r217-smll-167840359000158.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is HealthRecord-PT-03, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r217-smll-167840359000158
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 8.5K Feb 26 17:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 26 17:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 17:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 17:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 17:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Feb 26 17:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 17:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 17:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 49K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1678625489606

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=HealthRecord-PT-03
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-12 12:51:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-12 12:51:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 12:51:33] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2023-03-12 12:51:33] [INFO ] Transformed 121 places.
[2023-03-12 12:51:33] [INFO ] Transformed 232 transitions.
[2023-03-12 12:51:33] [INFO ] Found NUPN structural information;
[2023-03-12 12:51:33] [INFO ] Parsed PT model containing 121 places and 232 transitions and 597 arcs in 209 ms.
Graph (trivial) has 186 edges and 121 vertex of which 10 / 121 are part of one of the 5 SCC in 6 ms
Free SCC test removed 5 places
Structural test allowed to assert that 28 places are NOT stable. Took 15 ms.
Ensure Unique test removed 12 transitions
Reduce redundant transitions removed 12 transitions.
Incomplete random walk after 10000 steps, including 852 resets, run finished after 852 ms. (steps per millisecond=11 ) properties (out of 93) seen :45
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 48) seen :1
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 47) seen :2
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 45) seen :0
Running SMT prover for 45 properties.
[2023-03-12 12:51:34] [INFO ] Flow matrix only has 207 transitions (discarded 13 similar events)
// Phase 1: matrix 207 rows 116 cols
[2023-03-12 12:51:34] [INFO ] Computed 14 place invariants in 15 ms
[2023-03-12 12:51:35] [INFO ] After 561ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:45
[2023-03-12 12:51:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 14 ms returned sat
[2023-03-12 12:51:35] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 10 ms returned sat
[2023-03-12 12:51:36] [INFO ] After 607ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :45
[2023-03-12 12:51:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 12:51:36] [INFO ] After 477ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :45
[2023-03-12 12:51:37] [INFO ] Deduced a trap composed of 47 places in 80 ms of which 9 ms to minimize.
[2023-03-12 12:51:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2023-03-12 12:51:37] [INFO ] After 1360ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :45
Attempting to minimize the solution found.
Minimization took 498 ms.
[2023-03-12 12:51:38] [INFO ] After 3062ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :45
Fused 45 Parikh solutions to 31 different solutions.
Parikh walk visited 41 properties in 757 ms.
Support contains 4 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 220/220 transitions.
Graph (complete) has 429 edges and 116 vertex of which 109 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 109 transition count 202
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 10 rules applied. Total rules applied 22 place count 105 transition count 196
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 25 place count 103 transition count 195
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 25 place count 103 transition count 193
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 30 place count 100 transition count 193
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 82 place count 48 transition count 89
Iterating global reduction 3 with 52 rules applied. Total rules applied 134 place count 48 transition count 89
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 144 place count 38 transition count 69
Iterating global reduction 3 with 10 rules applied. Total rules applied 154 place count 38 transition count 69
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 158 place count 38 transition count 65
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 161 place count 35 transition count 56
Iterating global reduction 4 with 3 rules applied. Total rules applied 164 place count 35 transition count 56
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 167 place count 32 transition count 50
Iterating global reduction 4 with 3 rules applied. Total rules applied 170 place count 32 transition count 50
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 173 place count 32 transition count 47
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 183 place count 27 transition count 71
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 184 place count 27 transition count 70
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 193 place count 27 transition count 70
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 201 place count 27 transition count 70
Applied a total of 201 rules in 67 ms. Remains 27 /116 variables (removed 89) and now considering 70/220 (removed 150) transitions.
[2023-03-12 12:51:39] [INFO ] Flow matrix only has 63 transitions (discarded 7 similar events)
// Phase 1: matrix 63 rows 27 cols
[2023-03-12 12:51:39] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-12 12:51:39] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. Remains : 27/116 places, 70/220 transitions.
Finished random walk after 59769 steps, including 11178 resets, run visited all 4 properties in 1253 ms. (steps per millisecond=47 )
Able to resolve query StableMarking after proving 95 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 7581 ms.
ITS solved all properties within timeout

BK_STOP 1678625501465

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -rebuildPNML

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="HealthRecord-PT-03"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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-5348"
echo " Executing tool smartxred"
echo " Input is HealthRecord-PT-03, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r217-smll-167840359000158"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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