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

About the Execution of 2023-gold for CANConstruction-PT-080

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1646.520 102697.00 124495.00 388.80 1 1 1 1 1 1 1 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.r087-tall-171620521400041.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 CANConstruction-PT-080, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r087-tall-171620521400041
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.9M
-rw-r--r-- 1 mcc users 9.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 20:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Apr 12 20:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 12 20:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 26K Apr 12 20:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 9.5M 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 CANConstruction-PT-080-UpperBounds-00
FORMULA_NAME CANConstruction-PT-080-UpperBounds-01
FORMULA_NAME CANConstruction-PT-080-UpperBounds-02
FORMULA_NAME CANConstruction-PT-080-UpperBounds-03
FORMULA_NAME CANConstruction-PT-080-UpperBounds-04
FORMULA_NAME CANConstruction-PT-080-UpperBounds-05
FORMULA_NAME CANConstruction-PT-080-UpperBounds-06
FORMULA_NAME CANConstruction-PT-080-UpperBounds-07
FORMULA_NAME CANConstruction-PT-080-UpperBounds-08
FORMULA_NAME CANConstruction-PT-080-UpperBounds-09
FORMULA_NAME CANConstruction-PT-080-UpperBounds-10
FORMULA_NAME CANConstruction-PT-080-UpperBounds-11
FORMULA_NAME CANConstruction-PT-080-UpperBounds-12
FORMULA_NAME CANConstruction-PT-080-UpperBounds-13
FORMULA_NAME CANConstruction-PT-080-UpperBounds-14
FORMULA_NAME CANConstruction-PT-080-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716219693017

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=CANConstruction-PT-080
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-20 15:41:34] [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-20 15:41:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 15:41:35] [INFO ] Load time of PNML (sax parser for PT used): 494 ms
[2024-05-20 15:41:35] [INFO ] Transformed 13762 places.
[2024-05-20 15:41:35] [INFO ] Transformed 26240 transitions.
[2024-05-20 15:41:35] [INFO ] Parsed PT model containing 13762 places and 26240 transitions and 78400 arcs in 645 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 26240 rows 13762 cols
[2024-05-20 15:41:35] [INFO ] Computed 161 invariants in 385 ms
Incomplete random walk after 10000 steps, including 7 resets, run finished after 310 ms. (steps per millisecond=32 ) properties (out of 16) seen :3
FORMULA CANConstruction-PT-080-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 13) seen :0
[2024-05-20 15:41:36] [INFO ] Invariant cache hit.
[2024-05-20 15:41:38] [INFO ] [Real]Absence check using 81 positive place invariants in 521 ms returned sat
[2024-05-20 15:41:38] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 98 ms returned sat
[2024-05-20 15:41:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 15:41:41] [INFO ] [Real]Absence check using state equation in 3013 ms returned unknown
[2024-05-20 15:41:43] [INFO ] [Real]Absence check using 81 positive place invariants in 435 ms returned sat
[2024-05-20 15:41:43] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 81 ms returned sat
[2024-05-20 15:41:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 15:41:46] [INFO ] [Real]Absence check using state equation in 3241 ms returned unknown
[2024-05-20 15:41:48] [INFO ] [Real]Absence check using 81 positive place invariants in 461 ms returned sat
[2024-05-20 15:41:48] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 100 ms returned sat
[2024-05-20 15:41:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 15:41:51] [INFO ] [Real]Absence check using state equation in 3203 ms returned unknown
[2024-05-20 15:41:53] [INFO ] [Real]Absence check using 81 positive place invariants in 433 ms returned sat
[2024-05-20 15:41:53] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 80 ms returned sat
[2024-05-20 15:41:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 15:41:56] [INFO ] [Real]Absence check using state equation in 3163 ms returned unknown
[2024-05-20 15:41:58] [INFO ] [Real]Absence check using 81 positive place invariants in 418 ms returned sat
[2024-05-20 15:41:58] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 86 ms returned sat
[2024-05-20 15:41:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 15:42:01] [INFO ] [Real]Absence check using state equation in 3269 ms returned unknown
[2024-05-20 15:42:03] [INFO ] [Real]Absence check using 81 positive place invariants in 444 ms returned sat
[2024-05-20 15:42:03] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 88 ms returned sat
[2024-05-20 15:42:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 15:42:06] [INFO ] [Real]Absence check using state equation in 3082 ms returned unknown
[2024-05-20 15:42:08] [INFO ] [Real]Absence check using 81 positive place invariants in 428 ms returned sat
[2024-05-20 15:42:08] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 85 ms returned sat
[2024-05-20 15:42:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 15:42:11] [INFO ] [Real]Absence check using state equation in 3095 ms returned unknown
[2024-05-20 15:42:13] [INFO ] [Real]Absence check using 81 positive place invariants in 432 ms returned sat
[2024-05-20 15:42:13] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 93 ms returned sat
[2024-05-20 15:42:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 15:42:16] [INFO ] [Real]Absence check using state equation in 3113 ms returned unknown
[2024-05-20 15:42:18] [INFO ] [Real]Absence check using 81 positive place invariants in 408 ms returned sat
[2024-05-20 15:42:18] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 78 ms returned sat
[2024-05-20 15:42:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 15:42:21] [INFO ] [Real]Absence check using state equation in 3290 ms returned unknown
[2024-05-20 15:42:23] [INFO ] [Real]Absence check using 81 positive place invariants in 405 ms returned sat
[2024-05-20 15:42:23] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 81 ms returned sat
[2024-05-20 15:42:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 15:42:26] [INFO ] [Real]Absence check using state equation in 3184 ms returned unknown
[2024-05-20 15:42:28] [INFO ] [Real]Absence check using 81 positive place invariants in 424 ms returned sat
[2024-05-20 15:42:28] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 80 ms returned sat
[2024-05-20 15:42:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 15:42:31] [INFO ] [Real]Absence check using state equation in 3130 ms returned unknown
[2024-05-20 15:42:33] [INFO ] [Real]Absence check using 81 positive place invariants in 400 ms returned sat
[2024-05-20 15:42:33] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 82 ms returned sat
[2024-05-20 15:42:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 15:42:36] [INFO ] [Real]Absence check using state equation in 3308 ms returned unknown
[2024-05-20 15:42:38] [INFO ] [Real]Absence check using 81 positive place invariants in 401 ms returned sat
[2024-05-20 15:42:38] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 80 ms returned sat
[2024-05-20 15:42:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 15:42:42] [INFO ] [Real]Absence check using state equation in 3291 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 13 out of 13762 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13762/13762 places, 26240/26240 transitions.
Drop transitions removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 13762 transition count 25680
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 13202 transition count 25680
Discarding 6232 places :
Symmetric choice reduction at 2 with 6232 rule applications. Total rules 7352 place count 6970 transition count 13216
Iterating global reduction 2 with 6232 rules applied. Total rules applied 13584 place count 6970 transition count 13216
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 9 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 13744 place count 6890 transition count 13136
Free-agglomeration rule applied 144 times.
Iterating global reduction 2 with 144 rules applied. Total rules applied 13888 place count 6890 transition count 12992
Reduce places removed 144 places and 0 transitions.
Iterating post reduction 2 with 144 rules applied. Total rules applied 14032 place count 6746 transition count 12992
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 3 with 16 rules applied. Total rules applied 14048 place count 6746 transition count 12992
Applied a total of 14048 rules in 9815 ms. Remains 6746 /13762 variables (removed 7016) and now considering 12992/26240 (removed 13248) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9818 ms. Remains : 6746/13762 places, 12992/26240 transitions.
// Phase 1: matrix 12992 rows 6746 cols
[2024-05-20 15:42:52] [INFO ] Computed 161 invariants in 119 ms
Incomplete random walk after 1000000 steps, including 1794 resets, run finished after 22592 ms. (steps per millisecond=44 ) properties (out of 13) seen :13
FORMULA CANConstruction-PT-080-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 100086 ms.

BK_STOP 1716219795714

--------------------
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="CANConstruction-PT-080"
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 CANConstruction-PT-080, 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 r087-tall-171620521400041"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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