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.r408-oct2-167903727200317.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 ShieldPPPs-PT-050B, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r408-oct2-167903727200317
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 6.2K Feb 26 01:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 01:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 01:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 01:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 26 01:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 01:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 01:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 888K 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

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1679767268455

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=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldPPPs-PT-050B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-25 18:01:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-25 18:01:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-25 18:01:11] [INFO ] Load time of PNML (sax parser for PT used): 156 ms
[2023-03-25 18:01:11] [INFO ] Transformed 3403 places.
[2023-03-25 18:01:11] [INFO ] Transformed 3153 transitions.
[2023-03-25 18:01:11] [INFO ] Found NUPN structural information;
[2023-03-25 18:01:11] [INFO ] Parsed PT model containing 3403 places and 3153 transitions and 8706 arcs in 492 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 3403/3403 places, 3153/3153 transitions.
Drop transitions removed 352 transitions
Trivial Post-agglo rules discarded 352 transitions
Performed 352 trivial Post agglomeration. Transition count delta: 352
Iterating post reduction 0 with 352 rules applied. Total rules applied 352 place count 3403 transition count 2801
Reduce places removed 352 places and 0 transitions.
Iterating post reduction 1 with 352 rules applied. Total rules applied 704 place count 3051 transition count 2801
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 704 place count 3051 transition count 2551
Deduced a syphon composed of 250 places in 28 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 1204 place count 2801 transition count 2551
Performed 1200 Post agglomeration using F-continuation condition.Transition count delta: 1200
Deduced a syphon composed of 1200 places in 4 ms
Reduce places removed 1200 places and 0 transitions.
Iterating global reduction 2 with 2400 rules applied. Total rules applied 3604 place count 1601 transition count 1351
Renaming transitions due to excessive name length > 1024 char.
Applied a total of 3604 rules in 508 ms. Remains 1601 /3403 variables (removed 1802) and now considering 1351/3153 (removed 1802) transitions.
// Phase 1: matrix 1351 rows 1601 cols
[2023-03-25 18:01:11] [INFO ] Computed 551 place invariants in 15 ms
[2023-03-25 18:01:13] [INFO ] Implicit Places using invariants in 1571 ms returned []
[2023-03-25 18:01:13] [INFO ] Invariant cache hit.
[2023-03-25 18:01:16] [INFO ] Implicit Places using invariants and state equation in 2798 ms returned []
Implicit Place search using SMT with State Equation took 4399 ms to find 0 implicit places.
[2023-03-25 18:01:16] [INFO ] Invariant cache hit.
[2023-03-25 18:01:17] [INFO ] Dead Transitions using invariants and state equation in 883 ms found 0 transitions.
Starting structural reductions in LIVENESS mode, iteration 1 : 1601/3403 places, 1351/3153 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 5808 ms. Remains : 1601/3403 places, 1351/3153 transitions.
Discarding 300 transitions out of 1351. Remains 1051
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 604 ms. (steps per millisecond=16 ) properties (out of 1050) seen :1045
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-25 18:01:18] [INFO ] Invariant cache hit.
[2023-03-25 18:01:18] [INFO ] [Real]Absence check using 551 positive place invariants in 101 ms returned sat
[2023-03-25 18:01:20] [INFO ] After 1227ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2023-03-25 18:01:20] [INFO ] Deduced a trap composed of 4 places in 358 ms of which 34 ms to minimize.
[2023-03-25 18:01:20] [INFO ] Deduced a trap composed of 4 places in 234 ms of which 1 ms to minimize.
[2023-03-25 18:01:21] [INFO ] Deduced a trap composed of 4 places in 224 ms of which 1 ms to minimize.
[2023-03-25 18:01:21] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 2 ms to minimize.
[2023-03-25 18:01:21] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 1 ms to minimize.
[2023-03-25 18:01:21] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 1 ms to minimize.
[2023-03-25 18:01:22] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 0 ms to minimize.
[2023-03-25 18:01:22] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2023-03-25 18:01:22] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 1 ms to minimize.
[2023-03-25 18:01:22] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 1 ms to minimize.
[2023-03-25 18:01:22] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2023-03-25 18:01:22] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2663 ms
[2023-03-25 18:01:22] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2664 ms
[2023-03-25 18:01:22] [INFO ] After 3925ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-25 18:01:22] [INFO ] After 4634ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-25 18:01:23] [INFO ] [Nat]Absence check using 551 positive place invariants in 195 ms returned sat
[2023-03-25 18:01:24] [INFO ] After 1036ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-25 18:01:24] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 0 ms to minimize.
[2023-03-25 18:01:25] [INFO ] Deduced a trap composed of 4 places in 286 ms of which 2 ms to minimize.
[2023-03-25 18:01:25] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 0 ms to minimize.
[2023-03-25 18:01:25] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 1 ms to minimize.
[2023-03-25 18:01:26] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 1 ms to minimize.
[2023-03-25 18:01:26] [INFO ] Deduced a trap composed of 4 places in 207 ms of which 1 ms to minimize.
[2023-03-25 18:01:26] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 0 ms to minimize.
[2023-03-25 18:01:26] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 1 ms to minimize.
[2023-03-25 18:01:27] [INFO ] Deduced a trap composed of 4 places in 242 ms of which 1 ms to minimize.
[2023-03-25 18:01:27] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 1 ms to minimize.
[2023-03-25 18:01:27] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 1 ms to minimize.
[2023-03-25 18:01:27] [INFO ] Trap strengthening procedure interrupted after too many repetitions 3052 ms
[2023-03-25 18:01:27] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3052 ms
[2023-03-25 18:01:28] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 1 ms to minimize.
[2023-03-25 18:01:28] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 0 ms to minimize.
[2023-03-25 18:01:28] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 1 ms to minimize.
[2023-03-25 18:01:28] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 0 ms to minimize.
[2023-03-25 18:01:28] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 1 ms to minimize.
[2023-03-25 18:01:29] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 0 ms to minimize.
[2023-03-25 18:01:29] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 1 ms to minimize.
[2023-03-25 18:01:29] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2023-03-25 18:01:29] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2023-03-25 18:01:29] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2023-03-25 18:01:29] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 0 ms to minimize.
[2023-03-25 18:01:29] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 0 ms to minimize.
[2023-03-25 18:01:30] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2023-03-25 18:01:30] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2267 ms
[2023-03-25 18:01:30] [INFO ] After 7012ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 366 ms.
[2023-03-25 18:01:31] [INFO ] After 8273ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 4 properties in 1359 ms.
Support contains 2 out of 1601 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1601/1601 places, 1351/1351 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 1551 transition count 1301
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 1551 transition count 1301
Partial Free-agglomeration rule applied 446 times.
Drop transitions removed 446 transitions
Iterating global reduction 0 with 446 rules applied. Total rules applied 546 place count 1551 transition count 1301
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 547 place count 1550 transition count 1300
Applied a total of 547 rules in 492 ms. Remains 1550 /1601 variables (removed 51) and now considering 1300/1351 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 492 ms. Remains : 1550/1601 places, 1300/1351 transitions.
Finished random walk after 3539 steps, including 0 resets, run visited all 1 properties in 39 ms. (steps per millisecond=90 )
Able to resolve query QuasiLiveness after proving 1051 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 22221 ms.
ITS solved all properties within timeout

BK_STOP 1679767293215

--------------------
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 QuasiLiveness -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="ShieldPPPs-PT-050B"
export BK_EXAMINATION="QuasiLiveness"
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 ShieldPPPs-PT-050B, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r408-oct2-167903727200317"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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