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

About the Execution of Marcie+red for Parking-PT-864

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
7797.115 3600000.00 3626238.00 9695.40 FTTFTTTTTFFTTFTF 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.r266-smll-167863540900454.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 Parking-PT-864, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r266-smll-167863540900454
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 920K
-rw-r--r-- 1 mcc users 5.8K Feb 26 16:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 26 16:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 15:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 15:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 17:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 154K Feb 26 17:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 26 17:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 26 17:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 427K 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 Parking-PT-864-ReachabilityCardinality-00
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-01
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-02
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-03
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-04
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-05
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-06
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-07
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-08
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-09
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-10
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-11
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-12
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-13
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-14
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679069037661

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=Parking-PT-864
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-17 16:04:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-17 16:04:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 16:04:00] [INFO ] Load time of PNML (sax parser for PT used): 226 ms
[2023-03-17 16:04:00] [INFO ] Transformed 1185 places.
[2023-03-17 16:04:00] [INFO ] Transformed 1697 transitions.
[2023-03-17 16:04:00] [INFO ] Found NUPN structural information;
[2023-03-17 16:04:00] [INFO ] Parsed PT model containing 1185 places and 1697 transitions and 5073 arcs in 349 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 31 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 688 transitions
Reduce redundant transitions removed 688 transitions.
FORMULA Parking-PT-864-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 38 resets, run finished after 851 ms. (steps per millisecond=11 ) properties (out of 11) seen :6
FORMULA Parking-PT-864-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1009 rows 1185 cols
[2023-03-17 16:04:02] [INFO ] Computed 280 place invariants in 61 ms
[2023-03-17 16:04:02] [INFO ] After 816ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-17 16:04:03] [INFO ] [Nat]Absence check using 272 positive place invariants in 104 ms returned sat
[2023-03-17 16:04:03] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-17 16:04:05] [INFO ] After 1984ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-17 16:04:05] [INFO ] State equation strengthened by 248 read => feed constraints.
[2023-03-17 16:04:06] [INFO ] After 1140ms SMT Verify possible using 248 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2023-03-17 16:04:08] [INFO ] After 2518ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 1668 ms.
[2023-03-17 16:04:10] [INFO ] After 7078ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
FORMULA Parking-PT-864-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 4 different solutions.
FORMULA Parking-PT-864-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 139 ms.
Support contains 70 out of 1185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1185/1185 places, 1009/1009 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 1185 transition count 982
Reduce places removed 27 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 30 rules applied. Total rules applied 57 place count 1158 transition count 979
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 60 place count 1155 transition count 979
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 60 place count 1155 transition count 952
Deduced a syphon composed of 27 places in 3 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 114 place count 1128 transition count 952
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 122 place count 1120 transition count 944
Iterating global reduction 3 with 8 rules applied. Total rules applied 130 place count 1120 transition count 944
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 196 place count 1087 transition count 911
Free-agglomeration rule applied 176 times.
Iterating global reduction 3 with 176 rules applied. Total rules applied 372 place count 1087 transition count 735
Reduce places removed 176 places and 0 transitions.
Iterating post reduction 3 with 176 rules applied. Total rules applied 548 place count 911 transition count 735
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 552 place count 911 transition count 731
Applied a total of 552 rules in 652 ms. Remains 911 /1185 variables (removed 274) and now considering 731/1009 (removed 278) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 653 ms. Remains : 911/1185 places, 731/1009 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 3) seen :1
FORMULA Parking-PT-864-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 731 rows 911 cols
[2023-03-17 16:04:11] [INFO ] Computed 280 place invariants in 20 ms
[2023-03-17 16:04:11] [INFO ] After 278ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 16:04:11] [INFO ] [Nat]Absence check using 272 positive place invariants in 118 ms returned sat
[2023-03-17 16:04:11] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-17 16:04:12] [INFO ] After 817ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 16:04:12] [INFO ] State equation strengthened by 526 read => feed constraints.
[2023-03-17 16:04:13] [INFO ] After 633ms SMT Verify possible using 526 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-17 16:04:14] [INFO ] After 1597ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 940 ms.
[2023-03-17 16:04:15] [INFO ] After 3801ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA Parking-PT-864-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Finished Parikh walk after 41 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=20 )
FORMULA Parking-PT-864-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 4 ms.
All properties solved without resorting to model-checking.
Total runtime 15138 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: Parking_PT_864
(NrP: 1185 NrTr: 1697 NrArc: 5073)

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

net check time: 0m 0.000sec

init dd package: 0m 3.314sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8358220 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16099372 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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.015sec

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="Parking-PT-864"
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 Parking-PT-864, 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 r266-smll-167863540900454"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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