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

About the Execution of Marcie+red for QuasiCertifProtocol-PT-28

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10346.367 559872.00 579110.00 1258.70 TFTFTFTFFTTTTFTF 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.r298-tall-167873952400902.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 marciexred
Input is QuasiCertifProtocol-PT-28, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tall-167873952400902
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.8M
-rw-r--r-- 1 mcc users 80K Feb 26 01:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 452K Feb 26 01:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 19K Feb 26 01:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 124K Feb 26 01:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 46K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 182K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 106K Feb 26 01:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 644K Feb 26 01:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 35K Feb 26 01:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 218K Feb 26 01:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.4K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 749K Mar 5 18:23 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 QuasiCertifProtocol-PT-28-ReachabilityCardinality-00
FORMULA_NAME QuasiCertifProtocol-PT-28-ReachabilityCardinality-01
FORMULA_NAME QuasiCertifProtocol-PT-28-ReachabilityCardinality-02
FORMULA_NAME QuasiCertifProtocol-PT-28-ReachabilityCardinality-03
FORMULA_NAME QuasiCertifProtocol-PT-28-ReachabilityCardinality-04
FORMULA_NAME QuasiCertifProtocol-PT-28-ReachabilityCardinality-05
FORMULA_NAME QuasiCertifProtocol-PT-28-ReachabilityCardinality-06
FORMULA_NAME QuasiCertifProtocol-PT-28-ReachabilityCardinality-07
FORMULA_NAME QuasiCertifProtocol-PT-28-ReachabilityCardinality-08
FORMULA_NAME QuasiCertifProtocol-PT-28-ReachabilityCardinality-09
FORMULA_NAME QuasiCertifProtocol-PT-28-ReachabilityCardinality-10
FORMULA_NAME QuasiCertifProtocol-PT-28-ReachabilityCardinality-11
FORMULA_NAME QuasiCertifProtocol-PT-28-ReachabilityCardinality-12
FORMULA_NAME QuasiCertifProtocol-PT-28-ReachabilityCardinality-13
FORMULA_NAME QuasiCertifProtocol-PT-28-ReachabilityCardinality-14
FORMULA_NAME QuasiCertifProtocol-PT-28-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679691128924

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=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-28
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-24 20:52:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-24 20:52:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 20:52:10] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2023-03-24 20:52:10] [INFO ] Transformed 2998 places.
[2023-03-24 20:52:10] [INFO ] Transformed 446 transitions.
[2023-03-24 20:52:10] [INFO ] Parsed PT model containing 2998 places and 446 transitions and 6489 arcs in 171 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 96 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 303 resets, run finished after 627 ms. (steps per millisecond=15 ) properties (out of 16) seen :1
FORMULA QuasiCertifProtocol-PT-28-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=10 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 330571 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :{}
Probabilistic random walk after 330571 steps, saw 43419 distinct states, run finished after 3002 ms. (steps per millisecond=110 ) properties seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 446 rows 2998 cols
[2023-03-24 20:52:14] [INFO ] Computed 2553 place invariants in 129 ms
[2023-03-24 20:52:16] [INFO ] After 1300ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:14
[2023-03-24 20:52:17] [INFO ] [Nat]Absence check using 32 positive place invariants in 46 ms returned sat
[2023-03-24 20:52:18] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 546 ms returned sat
[2023-03-24 20:52:41] [INFO ] After 19822ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :11
[2023-03-24 20:52:41] [INFO ] After 19829ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :11
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-24 20:52:41] [INFO ] After 25033ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :11
FORMULA QuasiCertifProtocol-PT-28-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-PT-28-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-PT-28-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 15 Parikh solutions to 3 different solutions.
FORMULA QuasiCertifProtocol-PT-28-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-28-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-28-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-28-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-28-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 5 properties in 42 ms.
Support contains 961 out of 2998 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Graph (complete) has 30318 edges and 2998 vertex of which 2939 are kept as prefixes of interest. Removing 59 places using SCC suffix rule.17 ms
Discarding 59 places :
Also discarding 0 output transitions
Drop transitions removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Discarding 56 places :
Implicit places reduction removed 56 places
Iterating post reduction 0 with 252 rules applied. Total rules applied 253 place count 2883 transition count 250
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 48 Pre rules applied. Total rules applied 253 place count 2883 transition count 202
Deduced a syphon composed of 48 places in 2 ms
Ensure Unique test removed 62 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 1 with 158 rules applied. Total rules applied 411 place count 2773 transition count 202
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Ensure Unique test removed 138 places
Reduce places removed 167 places and 0 transitions.
Iterating global reduction 1 with 196 rules applied. Total rules applied 607 place count 2606 transition count 173
Applied a total of 607 rules in 472 ms. Remains 2606 /2998 variables (removed 392) and now considering 173/446 (removed 273) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 473 ms. Remains : 2606/2998 places, 173/446 transitions.
Incomplete random walk after 10000 steps, including 953 resets, run finished after 347 ms. (steps per millisecond=28 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 229 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 235 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 225 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 222 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 233 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 320 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 178 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 266498 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :{0=1, 4=1}
Probabilistic random walk after 266498 steps, saw 38171 distinct states, run finished after 3002 ms. (steps per millisecond=88 ) properties seen :2
FORMULA QuasiCertifProtocol-PT-28-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-PT-28-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 5 properties.
// Phase 1: matrix 173 rows 2606 cols
[2023-03-24 20:52:46] [INFO ] Computed 2434 place invariants in 33 ms
[2023-03-24 20:52:46] [INFO ] After 440ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-24 20:52:47] [INFO ] [Nat]Absence check using 6 positive place invariants in 11 ms returned sat
[2023-03-24 20:52:47] [INFO ] [Nat]Absence check using 6 positive and 2428 generalized place invariants in 558 ms returned sat
[2023-03-24 20:52:49] [INFO ] After 2494ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
FORMULA QuasiCertifProtocol-PT-28-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-PT-28-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-PT-28-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-PT-28-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-PT-28-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
All properties solved without resorting to model-checking.
Total runtime 38950 ms.
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: QuasiCertifProtocol_PT_28
(NrP: 2998 NrTr: 446 NrArc: 6489)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.513sec

net check time: 0m 0.001sec

init dd package: 0m 2.828sec


before gc: list nodes free: 2028992

after gc: idd nodes used:50599678, unused:13400322; list nodes free:61570236

RS generation: 8m 3.274sec


-> last computed set: #nodes 50596710 (5.1e+07) #states 4,194,305 (6)


CANNOT_COMPUTE


BK_STOP 1679691688796

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.003sec

idd.cc:820: DD Exception: No free nodes

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="QuasiCertifProtocol-PT-28"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marciexred"
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-5348"
echo " Executing tool marciexred"
echo " Input is QuasiCertifProtocol-PT-28, 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 r298-tall-167873952400902"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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