fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r241-tall-171649628400216
Last Updated
July 7, 2024

About the Execution of 2023-gold for LeafsetExtension-PT-S16C3

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
318.163 8033.00 14558.00 308.50 1 1 1 1 1 1 3 1 1 1 1 1 1 1 1 1 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r241-tall-171649628400216.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is LeafsetExtension-PT-S16C3, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r241-tall-171649628400216
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 14K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Apr 12 13:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 12 13:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Apr 12 13:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Apr 12 13:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 905K May 18 16:42 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME LeafsetExtension-PT-S16C3-UpperBounds-00
FORMULA_NAME LeafsetExtension-PT-S16C3-UpperBounds-01
FORMULA_NAME LeafsetExtension-PT-S16C3-UpperBounds-02
FORMULA_NAME LeafsetExtension-PT-S16C3-UpperBounds-03
FORMULA_NAME LeafsetExtension-PT-S16C3-UpperBounds-04
FORMULA_NAME LeafsetExtension-PT-S16C3-UpperBounds-05
FORMULA_NAME LeafsetExtension-PT-S16C3-UpperBounds-06
FORMULA_NAME LeafsetExtension-PT-S16C3-UpperBounds-07
FORMULA_NAME LeafsetExtension-PT-S16C3-UpperBounds-08
FORMULA_NAME LeafsetExtension-PT-S16C3-UpperBounds-09
FORMULA_NAME LeafsetExtension-PT-S16C3-UpperBounds-10
FORMULA_NAME LeafsetExtension-PT-S16C3-UpperBounds-11
FORMULA_NAME LeafsetExtension-PT-S16C3-UpperBounds-12
FORMULA_NAME LeafsetExtension-PT-S16C3-UpperBounds-13
FORMULA_NAME LeafsetExtension-PT-S16C3-UpperBounds-14
FORMULA_NAME LeafsetExtension-PT-S16C3-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716563083887

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=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S16C3
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-24 15:04:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 15:04:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 15:04:45] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2024-05-24 15:04:45] [INFO ] Transformed 1542 places.
[2024-05-24 15:04:45] [INFO ] Transformed 1449 transitions.
[2024-05-24 15:04:45] [INFO ] Parsed PT model containing 1542 places and 1449 transitions and 4668 arcs in 181 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 1449 rows 1542 cols
[2024-05-24 15:04:45] [INFO ] Computed 93 invariants in 101 ms
Incomplete random walk after 10000 steps, including 383 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 16) seen :16
FORMULA LeafsetExtension-PT-S16C3-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C3-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C3-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C3-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C3-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C3-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C3-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C3-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C3-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C3-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :2
[2024-05-24 15:04:46] [INFO ] Invariant cache hit.
[2024-05-24 15:04:46] [INFO ] [Real]Absence check using 19 positive place invariants in 25 ms returned sat
[2024-05-24 15:04:46] [INFO ] [Real]Absence check using 19 positive and 74 generalized place invariants in 26 ms returned unsat
[2024-05-24 15:04:46] [INFO ] [Real]Absence check using 19 positive place invariants in 13 ms returned sat
[2024-05-24 15:04:46] [INFO ] [Real]Absence check using 19 positive and 74 generalized place invariants in 30 ms returned unsat
[2024-05-24 15:04:46] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned sat
[2024-05-24 15:04:46] [INFO ] [Real]Absence check using 19 positive and 74 generalized place invariants in 31 ms returned sat
[2024-05-24 15:04:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 15:04:47] [INFO ] [Real]Absence check using state equation in 453 ms returned sat
[2024-05-24 15:04:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 15:04:47] [INFO ] [Nat]Absence check using 19 positive place invariants in 13 ms returned sat
[2024-05-24 15:04:47] [INFO ] [Nat]Absence check using 19 positive and 74 generalized place invariants in 32 ms returned sat
[2024-05-24 15:04:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 15:04:48] [INFO ] [Nat]Absence check using state equation in 462 ms returned sat
[2024-05-24 15:04:48] [INFO ] Computed and/alt/rep : 1430/2224/1430 causal constraints (skipped 2 transitions) in 85 ms.
[2024-05-24 15:04:48] [INFO ] Added : 24 causal constraints over 5 iterations in 582 ms. Result :sat
Minimization took 116 ms.
[2024-05-24 15:04:49] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned sat
[2024-05-24 15:04:49] [INFO ] [Real]Absence check using 19 positive and 74 generalized place invariants in 24 ms returned unsat
[2024-05-24 15:04:49] [INFO ] [Real]Absence check using 19 positive place invariants in 13 ms returned sat
[2024-05-24 15:04:49] [INFO ] [Real]Absence check using 19 positive and 74 generalized place invariants in 42 ms returned unsat
[2024-05-24 15:04:49] [INFO ] [Real]Absence check using 19 positive place invariants in 13 ms returned sat
[2024-05-24 15:04:49] [INFO ] [Real]Absence check using 19 positive and 74 generalized place invariants in 38 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, -1, 1, 1, 1] Max seen :[1, 1, 1, 1, 1, 1]
FORMULA LeafsetExtension-PT-S16C3-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C3-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C3-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C3-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C3-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 1542 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1542/1542 places, 1449/1449 transitions.
Graph (complete) has 2953 edges and 1542 vertex of which 55 are kept as prefixes of interest. Removing 1487 places using SCC suffix rule.9 ms
Discarding 1487 places :
Also discarding 1061 output transitions
Drop transitions removed 1061 transitions
Drop transitions removed 290 transitions
Reduce isomorphic transitions removed 290 transitions.
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 306 rules applied. Total rules applied 307 place count 47 transition count 90
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 18 rules applied. Total rules applied 325 place count 37 transition count 82
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 333 place count 29 transition count 82
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 333 place count 29 transition count 81
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 335 place count 28 transition count 81
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 342 place count 21 transition count 74
Iterating global reduction 3 with 7 rules applied. Total rules applied 349 place count 21 transition count 74
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 357 place count 21 transition count 66
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 365 place count 13 transition count 66
Applied a total of 365 rules in 42 ms. Remains 13 /1542 variables (removed 1529) and now considering 66/1449 (removed 1383) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 13/1542 places, 66/1449 transitions.
Successfully produced net in file /tmp/petri1000_13447328272532124862.dot
Successfully produced net in file /tmp/petri1001_17195885200661858708.dot
Successfully produced net in file /tmp/petri1002_5206279827945962126.dot
Successfully produced net in file /tmp/petri1003_13618886400308210123.dot
Successfully produced net in file /tmp/petri1004_8833918394228274000.dot
Successfully produced net in file /tmp/petri1005_9565449685165704077.dot
Successfully produced net in file /tmp/petri1006_14858316586226664930.dot
Successfully produced net in file /tmp/petri1007_13520320525782357312.dot
Successfully produced net in file /tmp/petri1008_15649312021941234970.dot
Successfully produced net in file /tmp/petri1009_4327267201144253774.dot
Successfully produced net in file /tmp/petri1010_11759780906981423617.dot
Successfully produced net in file /tmp/petri1011_17116856946803411630.dot
Successfully produced net in file /tmp/petri1012_10501214770604713525.dot
Successfully produced net in file /tmp/petri1013_149941111459745420.dot
Successfully produced net in file /tmp/petri1014_13391763018088028768.dot
Successfully produced net in file /tmp/petri1015_7009448846725157344.dot
Successfully produced net in file /tmp/petri1016_4920186824901914349.dot
Successfully produced net in file /tmp/petri1017_17407802726538849965.dot
Successfully produced net in file /tmp/petri1018_4002926258972802882.dot
Successfully produced net in file /tmp/petri1019_11827917804382506356.dot
Successfully produced net in file /tmp/petri1020_16918668535371029251.dot
Successfully produced net in file /tmp/petri1021_4666229393564366686.dot
Successfully produced net in file /tmp/petri1022_721123073541527014.dot
Successfully produced net in file /tmp/petri1023_16868422759896003427.dot
Successfully produced net in file /tmp/petri1024_2078726758497024412.dot
Successfully produced net in file /tmp/petri1025_5470767358393853481.dot
Successfully produced net in file /tmp/petri1026_12193388751524598139.dot
Successfully produced net in file /tmp/petri1027_14532370750345156763.dot
Drop transitions removed 28 transitions
Dominated transitions for bounds rules discarded 28 transitions
Normalized transition count is 17 out of 38 initially.
// Phase 1: matrix 17 rows 13 cols
[2024-05-24 15:04:49] [INFO ] Computed 3 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 120815 resets, run finished after 762 ms. (steps per millisecond=1312 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 15850 resets, run finished after 353 ms. (steps per millisecond=2832 ) properties (out of 1) seen :3
[2024-05-24 15:04:50] [INFO ] Flow matrix only has 17 transitions (discarded 21 similar events)
// Phase 1: matrix 17 rows 13 cols
[2024-05-24 15:04:50] [INFO ] Computed 3 invariants in 1 ms
[2024-05-24 15:04:50] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-24 15:04:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 15:04:50] [INFO ] [Real]Absence check using state equation in 4 ms returned unsat
Current structural bounds on expressions (after SMT) : [3] Max seen :[3]
FORMULA LeafsetExtension-PT-S16C3-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 5567 ms.

BK_STOP 1716563091920

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="LeafsetExtension-PT-S16C3"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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-5568"
echo " Executing tool gold2023"
echo " Input is LeafsetExtension-PT-S16C3, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r241-tall-171649628400216"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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