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

About the Execution of Marcie+red for PGCD-COL-D02N006

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5448.140 9825.00 12329.00 366.70 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.r536-tall-167987254600241.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 PGCD-COL-D02N006, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-167987254600241
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 6.9K Mar 23 15:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Mar 23 15:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 14K Mar 23 15:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Mar 23 15:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Mar 23 15:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Mar 23 15:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_pt
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 16K Mar 26 22:42 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 ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1679941922573

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=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PGCD-COL-D02N006
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-27 18:32:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2023-03-27 18:32:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-27 18:32:04] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-27 18:32:04] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-27 18:32:04] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 386 ms
[2023-03-27 18:32:04] [INFO ] Imported 3 HL places and 3 HL transitions for a total of 9 PT places and 9.0 transition bindings in 13 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 2 ms.
Working with output stream class java.io.PrintStream
[2023-03-27 18:32:04] [INFO ] Built PT skeleton of HLPN with 3 places and 3 transitions 14 arcs in 3 ms.
[2023-03-27 18:32:04] [INFO ] Skeletonized 1 HLPN properties in 1 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Prefix of Interest using HLPN skeleton for deadlock discarded 0 places and 0 transitions.
Arc [2:1*[(MOD (ADD $x 1) 3)]] contains successor/predecessor on variables of sort CD
[2023-03-27 18:32:04] [INFO ] Unfolded HLPN to a Petri net with 9 places and 9 transitions 42 arcs in 5 ms.
[2023-03-27 18:32:04] [INFO ] Unfolded 1 HLPN properties in 0 ms.
Built sparse matrix representations for Structural reductions in 0 ms.24184KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 9/9 places, 9/9 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 8 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
// Phase 1: matrix 9 rows 9 cols
[2023-03-27 18:32:04] [INFO ] Computed 4 place invariants in 7 ms
[2023-03-27 18:32:04] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 170 ms. Remains : 9/9 places, 9/9 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 9/9 places, 9/9 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 2 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-03-27 18:32:04] [INFO ] Invariant cache hit.
[2023-03-27 18:32:05] [INFO ] Implicit Places using invariants in 33 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 35 ms to find 3 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 1 : 6/9 places, 9/9 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 2 iterations and 37 ms. Remains : 6/9 places, 9/9 transitions.
Random walk for 1250006 steps, including 0 resets, run took 291 ms (no deadlock found). (steps per millisecond=4295 )
Random directed walk for 1250006 steps, including 0 resets, run took 240 ms (no deadlock found). (steps per millisecond=5208 )
// Phase 1: matrix 9 rows 6 cols
[2023-03-27 18:32:05] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-27 18:32:05] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-27 18:32:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-27 18:32:05] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-27 18:32:05] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-27 18:32:05] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2023-03-27 18:32:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-27 18:32:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-27 18:32:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-27 18:32:05] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-27 18:32:05] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-27 18:32:05] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-03-27 18:32:05] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 3 ms to minimize.
[2023-03-27 18:32:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2023-03-27 18:32:05] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-27 18:32:05] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
Parikh directed walk for 1500 steps, including 127 resets, run took 4 ms. (steps per millisecond=375 )
Random directed walk for 500012 steps, including 0 resets, run took 70 ms (no deadlock found). (steps per millisecond=7143 )
Random walk for 500005 steps, including 0 resets, run took 82 ms (no deadlock found). (steps per millisecond=6097 )
Random directed walk for 500013 steps, including 0 resets, run took 77 ms (no deadlock found). (steps per millisecond=6493 )
Random walk for 500000 steps, including 0 resets, run took 78 ms (no deadlock found). (steps per millisecond=6410 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 6/6 places, 9/9 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-03-27 18:32:06] [INFO ] Invariant cache hit.
[2023-03-27 18:32:06] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-27 18:32:06] [INFO ] Invariant cache hit.
[2023-03-27 18:32:06] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-27 18:32:06] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-03-27 18:32:06] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-27 18:32:06] [INFO ] Invariant cache hit.
[2023-03-27 18:32:06] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 86 ms. Remains : 6/6 places, 9/9 transitions.
Random walk for 1250001 steps, including 0 resets, run took 229 ms (no deadlock found). (steps per millisecond=5458 )
Random directed walk for 1250013 steps, including 0 resets, run took 192 ms (no deadlock found). (steps per millisecond=6510 )
[2023-03-27 18:32:06] [INFO ] Invariant cache hit.
[2023-03-27 18:32:06] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-27 18:32:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-27 18:32:06] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-27 18:32:06] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-27 18:32:06] [INFO ] [Real]Added 3 Read/Feed constraints in 5 ms returned sat
[2023-03-27 18:32:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-27 18:32:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-27 18:32:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-27 18:32:06] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-27 18:32:06] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-27 18:32:06] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2023-03-27 18:32:06] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
[2023-03-27 18:32:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2023-03-27 18:32:06] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-27 18:32:06] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
Parikh directed walk for 1500 steps, including 122 resets, run took 3 ms. (steps per millisecond=500 )
Random directed walk for 500009 steps, including 0 resets, run took 70 ms (no deadlock found). (steps per millisecond=7142 )
Random walk for 500004 steps, including 0 resets, run took 83 ms (no deadlock found). (steps per millisecond=6024 )
Random directed walk for 500001 steps, including 0 resets, run took 71 ms (no deadlock found). (steps per millisecond=7042 )
Random walk for 500000 steps, including 0 resets, run took 75 ms (no deadlock found). (steps per millisecond=6666 )
[2023-03-27 18:32:07] [INFO ] Flatten gal took : 13 ms
[2023-03-27 18:32:07] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityDeadlock.sr.xml took 1 ms.
[2023-03-27 18:32:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 9 places, 9 transitions and 42 arcs took 1 ms.
Total runtime 2769 ms.
There are residual formulas that ITS could not solve within timeout
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=/home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin//ReachabilityDeadlock.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: PGCD_COL_D2_N6_unf
(NrP: 9 NrTr: 9 NrArc: 42)

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

net check time: 0m 0.000sec

init dd package: 0m 2.750sec


RS generation: 0m 0.005sec


-> reachability set: #nodes 422 (4.2e+02) #states 15,670 (4)



starting MCC model checker
--------------------------

checking: EF [DEADLOCK]
normalized: E [true U DEADLOCK]

-> the formula is FALSE

FORMULA ReachabilityDeadlock FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

totally nodes used: 2346 (2.3e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 19980 9766 29746
used/not used/entry size/cache size: 11959 67096905 16 1024MB
basic ops cache: hits/miss/sum: 398 180 578
used/not used/entry size/cache size: 301 16776915 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 765 422 1187
used/not used/entry size/cache size: 422 8388186 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 67106633
1 2154
2 56
3 5
4 15
5 1
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.341sec


BK_STOP 1679941932398

--------------------
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 ReachabilityDeadlock -timeout 180 -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.000sec


iterations count:509 (56), effective:169 (18)

initing FirstDep: 0m 0.000sec

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="PGCD-COL-D02N006"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is PGCD-COL-D02N006, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r536-tall-167987254600241"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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