About the Execution of Marcie+red for EisenbergMcGuire-PT-08
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
907.000 | 14087.00 | 22429.00 | 75.50 | 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-167987254500161.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 EisenbergMcGuire-PT-08, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-167987254500161
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 23 15:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 83K Mar 23 15:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 9.0K Mar 23 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 23 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Mar 23 15:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 23 15:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 1.7M Mar 31 16:48 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 1680363630936
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=EisenbergMcGuire-PT-08
Applying reductions before tool marcie
Invoking reducer
Running Version 202303301559
[2023-04-01 15:40:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2023-04-01 15:40:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-01 15:40:32] [INFO ] Load time of PNML (sax parser for PT used): 197 ms
[2023-04-01 15:40:32] [INFO ] Transformed 712 places.
[2023-04-01 15:40:32] [INFO ] Transformed 2816 transitions.
[2023-04-01 15:40:32] [INFO ] Found NUPN structural information;
[2023-04-01 15:40:32] [INFO ] Parsed PT model containing 712 places and 2816 transitions and 13440 arcs in 315 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 3 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 11 ms.18854KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 712/712 places, 2816/2816 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 712 transition count 2808
Reduce places removed 8 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 704 transition count 2808
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 704 transition count 2608
Deduced a syphon composed of 200 places in 6 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 504 transition count 2608
Computed a total of 0 stabilizing places and 0 stable transitions
Discarding 56 places :
Symmetric choice reduction at 2 with 56 rule applications. Total rules 472 place count 448 transition count 2160
Iterating global reduction 2 with 56 rules applied. Total rules applied 528 place count 448 transition count 2160
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 6 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 640 place count 392 transition count 2104
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 640 rules in 387 ms. Remains 392 /712 variables (removed 320) and now considering 2104/2816 (removed 712) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 388 ms. Remains : 392/712 places, 2104/2816 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2237 ms (no deadlock found). (steps per millisecond=558 )
Random directed walk for 1250006 steps, including 0 resets, run took 2991 ms (no deadlock found). (steps per millisecond=417 )
[2023-04-01 15:40:38] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2023-04-01 15:40:38] [INFO ] Computed 25 invariants in 14 ms
[2023-04-01 15:40:38] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned sat
[2023-04-01 15:40:38] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 29 ms returned sat
[2023-04-01 15:40:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-01 15:40:39] [INFO ] [Real]Absence check using state equation in 345 ms returned sat
[2023-04-01 15:40:39] [INFO ] Solution in real domain found non-integer solution.
[2023-04-01 15:40:39] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-04-01 15:40:39] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 15 ms returned sat
[2023-04-01 15:40:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-01 15:40:39] [INFO ] [Nat]Absence check using state equation in 342 ms returned sat
[2023-04-01 15:40:39] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-01 15:40:39] [INFO ] [Nat]Added 284 Read/Feed constraints in 81 ms returned sat
[2023-04-01 15:40:40] [INFO ] Deduced a trap composed of 3 places in 189 ms of which 3 ms to minimize.
[2023-04-01 15:40:40] [INFO ] Deduced a trap composed of 3 places in 216 ms of which 1 ms to minimize.
[2023-04-01 15:40:40] [INFO ] Deduced a trap composed of 3 places in 207 ms of which 1 ms to minimize.
[2023-04-01 15:40:40] [INFO ] Deduced a trap composed of 49 places in 200 ms of which 1 ms to minimize.
[2023-04-01 15:40:41] [INFO ] Deduced a trap composed of 38 places in 211 ms of which 1 ms to minimize.
[2023-04-01 15:40:41] [INFO ] Deduced a trap composed of 25 places in 192 ms of which 1 ms to minimize.
[2023-04-01 15:40:41] [INFO ] Deduced a trap composed of 26 places in 189 ms of which 0 ms to minimize.
[2023-04-01 15:40:41] [INFO ] Deduced a trap composed of 3 places in 189 ms of which 1 ms to minimize.
[2023-04-01 15:40:42] [INFO ] Deduced a trap composed of 49 places in 189 ms of which 0 ms to minimize.
[2023-04-01 15:40:42] [INFO ] Deduced a trap composed of 35 places in 182 ms of which 1 ms to minimize.
[2023-04-01 15:40:42] [INFO ] Deduced a trap composed of 34 places in 177 ms of which 0 ms to minimize.
[2023-04-01 15:40:42] [INFO ] Deduced a trap composed of 3 places in 201 ms of which 0 ms to minimize.
[2023-04-01 15:40:42] [INFO ] Deduced a trap composed of 38 places in 218 ms of which 2 ms to minimize.
[2023-04-01 15:40:43] [INFO ] Deduced a trap composed of 48 places in 181 ms of which 1 ms to minimize.
[2023-04-01 15:40:43] [INFO ] Deduced a trap composed of 27 places in 199 ms of which 1 ms to minimize.
[2023-04-01 15:40:43] [INFO ] Deduced a trap composed of 29 places in 199 ms of which 0 ms to minimize.
[2023-04-01 15:40:43] [INFO ] Deduced a trap composed of 39 places in 186 ms of which 0 ms to minimize.
[2023-04-01 15:40:44] [INFO ] Deduced a trap composed of 31 places in 191 ms of which 0 ms to minimize.
[2023-04-01 15:40:44] [INFO ] Deduced a trap composed of 65 places in 182 ms of which 1 ms to minimize.
[2023-04-01 15:40:44] [INFO ] Deduced a trap composed of 36 places in 181 ms of which 0 ms to minimize.
[2023-04-01 15:40:44] [INFO ] Deduced a trap composed of 14 places in 179 ms of which 1 ms to minimize.
[2023-04-01 15:40:44] [INFO ] Deduced a trap composed of 3 places in 180 ms of which 0 ms to minimize.
[2023-04-01 15:40:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 22 trap constraints in 5034 ms
FORMULA ReachabilityDeadlock FALSE TECHNIQUES TOPOLOGICAL SAT_SMT STRUCTURAL_REDUCTION
Total runtime 12903 ms.
ITS solved all properties within timeout
BK_STOP 1680363645023
--------------------
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.202303301559.jar
+ VERSION=202303301559
+ echo 'Running Version 202303301559'
+ /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="EisenbergMcGuire-PT-08"
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 EisenbergMcGuire-PT-08, 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-167987254500161"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-08.tgz
mv EisenbergMcGuire-PT-08 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 ;