About the Execution of LoLa+red for ASLink-PT-05a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
313.296 | 4240.00 | 10616.00 | 45.30 | 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.r021-oct2-167813608600046.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 lolaxred
Input is ASLink-PT-05a, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-167813608600046
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.8K Feb 26 13:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 13:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 13:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 26 13:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 17K Feb 26 13:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 190K Feb 26 13:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 13:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 13:05 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 516K 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 1678930005630
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=lolaxred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ASLink-PT-05a
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-16 01:26:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2023-03-16 01:26:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 01:26:48] [INFO ] Load time of PNML (sax parser for PT used): 116 ms
[2023-03-16 01:26:48] [INFO ] Transformed 1211 places.
[2023-03-16 01:26:48] [INFO ] Transformed 1827 transitions.
[2023-03-16 01:26:48] [INFO ] Found NUPN structural information;
[2023-03-16 01:26:48] [INFO ] Parsed PT model containing 1211 places and 1827 transitions and 6877 arcs in 201 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 3 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 19 transitions
Reduce redundant transitions removed 19 transitions.
Built sparse matrix representations for Structural reductions in 5 ms.22034KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 1211/1211 places, 1808/1808 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Ensure Unique test removed 20 places
Computed a total of 1 stabilizing places and 1 stable transitions
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 1181 transition count 1700
Reduce places removed 108 places and 0 transitions.
Computed a total of 11 stabilizing places and 1 stable transitions
Iterating post reduction 1 with 108 rules applied. Total rules applied 246 place count 1073 transition count 1700
Computed a total of 11 stabilizing places and 1 stable transitions
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 109 Pre rules applied. Total rules applied 246 place count 1073 transition count 1591
Deduced a syphon composed of 109 places in 4 ms
Ensure Unique test removed 43 places
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 2 with 261 rules applied. Total rules applied 507 place count 921 transition count 1591
Computed a total of 11 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 508 place count 921 transition count 1590
Reduce places removed 1 places and 0 transitions.
Computed a total of 11 stabilizing places and 1 stable transitions
Iterating post reduction 3 with 1 rules applied. Total rules applied 509 place count 920 transition count 1590
Computed a total of 11 stabilizing places and 1 stable transitions
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 517 place count 912 transition count 1549
Ensure Unique test removed 1 places
Iterating global reduction 4 with 9 rules applied. Total rules applied 526 place count 911 transition count 1549
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Computed a total of 11 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 532 place count 910 transition count 1544
Reduce places removed 3 places and 0 transitions.
Computed a total of 11 stabilizing places and 1 stable transitions
Iterating post reduction 5 with 3 rules applied. Total rules applied 535 place count 907 transition count 1544
Computed a total of 11 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 536 place count 906 transition count 1536
Iterating global reduction 6 with 1 rules applied. Total rules applied 537 place count 906 transition count 1536
Computed a total of 11 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 538 place count 905 transition count 1528
Iterating global reduction 6 with 1 rules applied. Total rules applied 539 place count 905 transition count 1528
Computed a total of 11 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 540 place count 904 transition count 1520
Iterating global reduction 6 with 1 rules applied. Total rules applied 541 place count 904 transition count 1520
Computed a total of 11 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 542 place count 903 transition count 1512
Iterating global reduction 6 with 1 rules applied. Total rules applied 543 place count 903 transition count 1512
Computed a total of 11 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 544 place count 902 transition count 1504
Iterating global reduction 6 with 1 rules applied. Total rules applied 545 place count 902 transition count 1504
Computed a total of 11 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 546 place count 901 transition count 1496
Iterating global reduction 6 with 1 rules applied. Total rules applied 547 place count 901 transition count 1496
Computed a total of 11 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 548 place count 900 transition count 1488
Iterating global reduction 6 with 1 rules applied. Total rules applied 549 place count 900 transition count 1488
Computed a total of 11 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 550 place count 899 transition count 1480
Iterating global reduction 6 with 1 rules applied. Total rules applied 551 place count 899 transition count 1480
Computed a total of 11 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 552 place count 898 transition count 1472
Iterating global reduction 6 with 1 rules applied. Total rules applied 553 place count 898 transition count 1472
Computed a total of 11 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 554 place count 897 transition count 1464
Iterating global reduction 6 with 1 rules applied. Total rules applied 555 place count 897 transition count 1464
Computed a total of 11 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 556 place count 896 transition count 1456
Iterating global reduction 6 with 1 rules applied. Total rules applied 557 place count 896 transition count 1456
Computed a total of 11 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 558 place count 895 transition count 1448
Iterating global reduction 6 with 1 rules applied. Total rules applied 559 place count 895 transition count 1448
Computed a total of 11 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 560 place count 894 transition count 1440
Iterating global reduction 6 with 1 rules applied. Total rules applied 561 place count 894 transition count 1440
Computed a total of 11 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 562 place count 893 transition count 1432
Iterating global reduction 6 with 1 rules applied. Total rules applied 563 place count 893 transition count 1432
Computed a total of 11 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 564 place count 892 transition count 1424
Iterating global reduction 6 with 1 rules applied. Total rules applied 565 place count 892 transition count 1424
Computed a total of 11 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 566 place count 891 transition count 1416
Iterating global reduction 6 with 1 rules applied. Total rules applied 567 place count 891 transition count 1416
Computed a total of 11 stabilizing places and 1 stable transitions
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 6 with 70 rules applied. Total rules applied 637 place count 856 transition count 1381
Computed a total of 11 stabilizing places and 1 stable transitions
Computed a total of 11 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 638 place count 855 transition count 1380
Reduce places removed 10 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Iterating post reduction 6 with 10 rules applied. Total rules applied 648 place count 845 transition count 1380
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 20 Pre rules applied. Total rules applied 648 place count 845 transition count 1360
Deduced a syphon composed of 20 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 7 with 41 rules applied. Total rules applied 689 place count 824 transition count 1360
Computed a total of 0 stabilizing places and 0 stable transitions
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 7 with 11 rules applied. Total rules applied 700 place count 813 transition count 1360
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 700 place count 813 transition count 1359
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 702 place count 812 transition count 1359
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 724 place count 801 transition count 1348
Computed a total of 0 stabilizing places and 0 stable transitions
Discarding 10 places :
Symmetric choice reduction at 8 with 10 rule applications. Total rules 734 place count 791 transition count 1338
Iterating global reduction 8 with 10 rules applied. Total rules applied 744 place count 791 transition count 1338
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 744 rules in 1211 ms. Remains 791 /1211 variables (removed 420) and now considering 1338/1808 (removed 470) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 1212 ms. Remains : 791/1211 places, 1338/1808 transitions.
Finished random walk after 128 steps, including 0 resets, run found a deadlock after 3 ms. (steps per millisecond=42 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 1501 ms.
ITS solved all properties within timeout
BK_STOP 1678930009870
--------------------
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-05a"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is ASLink-PT-05a, 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 r021-oct2-167813608600046"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-05a.tgz
mv ASLink-PT-05a 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 '
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 ;