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

About the Execution of Marcie+red for ASLink-PT-03a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
207.123 3879.00 10144.00 19.70 T 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.r024-oct2-167813610700026.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ASLink-PT-03a, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-oct2-167813610700026
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 760K
-rw-r--r-- 1 mcc users 8.3K Feb 26 13:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 26 13:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 13:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 13:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 26 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 13:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 13:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 357K Mar 5 18:22 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 1678998078519

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=ASLink-PT-03a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-16 20:21:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2023-03-16 20:21:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 20:21:21] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2023-03-16 20:21:21] [INFO ] Transformed 821 places.
[2023-03-16 20:21:21] [INFO ] Transformed 1281 transitions.
[2023-03-16 20:21:21] [INFO ] Found NUPN structural information;
[2023-03-16 20:21:21] [INFO ] Parsed PT model containing 821 places and 1281 transitions and 4839 arcs in 208 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 6 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 13 transitions
Reduce redundant transitions removed 13 transitions.
Built sparse matrix representations for Structural reductions in 12 ms.16648KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 821/821 places, 1268/1268 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Ensure Unique test removed 12 places
Computed a total of 1 stabilizing places and 1 stable transitions
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 803 transition count 1198
Reduce places removed 70 places and 0 transitions.
Computed a total of 7 stabilizing places and 1 stable transitions
Iterating post reduction 1 with 70 rules applied. Total rules applied 158 place count 733 transition count 1198
Computed a total of 7 stabilizing places and 1 stable transitions
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 69 Pre rules applied. Total rules applied 158 place count 733 transition count 1129
Deduced a syphon composed of 69 places in 3 ms
Ensure Unique test removed 27 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 165 rules applied. Total rules applied 323 place count 637 transition count 1129
Computed a total of 7 stabilizing places and 1 stable transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 324 place count 637 transition count 1128
Reduce places removed 1 places and 0 transitions.
Computed a total of 7 stabilizing places and 1 stable transitions
Iterating post reduction 3 with 1 rules applied. Total rules applied 325 place count 636 transition count 1128
Computed a total of 7 stabilizing places and 1 stable transitions
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 331 place count 630 transition count 1099
Ensure Unique test removed 1 places
Iterating global reduction 4 with 7 rules applied. Total rules applied 338 place count 629 transition count 1099
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Computed a total of 7 stabilizing places and 1 stable transitions
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 6 rules applied. Total rules applied 344 place count 628 transition count 1094
Reduce places removed 3 places and 0 transitions.
Computed a total of 7 stabilizing places and 1 stable transitions
Iterating post reduction 5 with 3 rules applied. Total rules applied 347 place count 625 transition count 1094
Computed a total of 7 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 348 place count 624 transition count 1086
Iterating global reduction 6 with 1 rules applied. Total rules applied 349 place count 624 transition count 1086
Computed a total of 7 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 350 place count 623 transition count 1078
Iterating global reduction 6 with 1 rules applied. Total rules applied 351 place count 623 transition count 1078
Computed a total of 7 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 352 place count 622 transition count 1070
Iterating global reduction 6 with 1 rules applied. Total rules applied 353 place count 622 transition count 1070
Computed a total of 7 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 354 place count 621 transition count 1062
Iterating global reduction 6 with 1 rules applied. Total rules applied 355 place count 621 transition count 1062
Computed a total of 7 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 356 place count 620 transition count 1054
Iterating global reduction 6 with 1 rules applied. Total rules applied 357 place count 620 transition count 1054
Computed a total of 7 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 358 place count 619 transition count 1046
Iterating global reduction 6 with 1 rules applied. Total rules applied 359 place count 619 transition count 1046
Computed a total of 7 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 360 place count 618 transition count 1038
Iterating global reduction 6 with 1 rules applied. Total rules applied 361 place count 618 transition count 1038
Computed a total of 7 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 362 place count 617 transition count 1030
Iterating global reduction 6 with 1 rules applied. Total rules applied 363 place count 617 transition count 1030
Computed a total of 7 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 364 place count 616 transition count 1022
Iterating global reduction 6 with 1 rules applied. Total rules applied 365 place count 616 transition count 1022
Computed a total of 7 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 366 place count 615 transition count 1014
Iterating global reduction 6 with 1 rules applied. Total rules applied 367 place count 615 transition count 1014
Computed a total of 7 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 368 place count 614 transition count 1006
Iterating global reduction 6 with 1 rules applied. Total rules applied 369 place count 614 transition count 1006
Computed a total of 7 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 370 place count 613 transition count 998
Iterating global reduction 6 with 1 rules applied. Total rules applied 371 place count 613 transition count 998
Computed a total of 7 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 372 place count 612 transition count 990
Iterating global reduction 6 with 1 rules applied. Total rules applied 373 place count 612 transition count 990
Computed a total of 7 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 374 place count 611 transition count 982
Iterating global reduction 6 with 1 rules applied. Total rules applied 375 place count 611 transition count 982
Computed a total of 7 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 376 place count 610 transition count 974
Iterating global reduction 6 with 1 rules applied. Total rules applied 377 place count 610 transition count 974
Computed a total of 7 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 378 place count 609 transition count 966
Iterating global reduction 6 with 1 rules applied. Total rules applied 379 place count 609 transition count 966
Computed a total of 7 stabilizing places and 1 stable transitions
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 3 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 421 place count 588 transition count 945
Computed a total of 7 stabilizing places and 1 stable transitions
Computed a total of 7 stabilizing places and 1 stable transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 422 place count 587 transition count 944
Reduce places removed 6 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Iterating post reduction 6 with 6 rules applied. Total rules applied 428 place count 581 transition count 944
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 12 Pre rules applied. Total rules applied 428 place count 581 transition count 932
Deduced a syphon composed of 12 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 25 rules applied. Total rules applied 453 place count 568 transition count 932
Computed a total of 0 stabilizing places and 0 stable transitions
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 7 with 7 rules applied. Total rules applied 460 place count 561 transition count 932
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 460 place count 561 transition count 931
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 462 place count 560 transition count 931
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 8 with 14 rules applied. Total rules applied 476 place count 553 transition count 924
Computed a total of 0 stabilizing places and 0 stable transitions
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 482 place count 547 transition count 918
Iterating global reduction 8 with 6 rules applied. Total rules applied 488 place count 547 transition count 918
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 488 rules in 858 ms. Remains 547 /821 variables (removed 274) and now considering 918/1268 (removed 350) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 859 ms. Remains : 547/821 places, 918/1268 transitions.
Finished random walk after 187 steps, including 0 resets, run found a deadlock after 2 ms. (steps per millisecond=93 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 1171 ms.
ITS solved all properties within timeout

BK_STOP 1678998082398

--------------------
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

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="ASLink-PT-03a"
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 ASLink-PT-03a, 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 r024-oct2-167813610700026"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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