Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r053-tajo-167813705300322.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is BusinessProcesses-PT-09, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r053-tajo-167813705300322
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 6.8K Feb 25 16:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 16:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 16:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 25 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 25 16:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 104K 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 QuasiLiveness

=== Now, execution of the tool begins

BK_START 1679000313635

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=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=BusinessProcesses-PT-09
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-16 20:58:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-16 20:58:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 20:58:36] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2023-03-16 20:58:36] [INFO ] Transformed 403 places.
[2023-03-16 20:58:36] [INFO ] Transformed 374 transitions.
[2023-03-16 20:58:36] [INFO ] Found NUPN structural information;
[2023-03-16 20:58:36] [INFO ] Parsed PT model containing 403 places and 374 transitions and 1148 arcs in 132 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 403/403 places, 374/374 transitions.
Graph (trivial) has 227 edges and 403 vertex of which 7 / 403 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 87 rules applied. Total rules applied 88 place count 396 transition count 281
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 174 place count 310 transition count 281
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 62 Pre rules applied. Total rules applied 174 place count 310 transition count 219
Deduced a syphon composed of 62 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 308 place count 238 transition count 219
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 510 place count 136 transition count 119
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 512 place count 135 transition count 123
Applied a total of 512 rules in 46 ms. Remains 135 /403 variables (removed 268) and now considering 123/374 (removed 251) transitions.
// Phase 1: matrix 123 rows 135 cols
[2023-03-16 20:58:36] [INFO ] Computed 52 place invariants in 19 ms
[2023-03-16 20:58:36] [INFO ] Implicit Places using invariants in 299 ms returned [1, 2, 5, 13, 38, 39, 40, 41, 42, 43, 44, 100]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 326 ms to find 12 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 123/403 places, 123/374 transitions.
Applied a total of 0 rules in 10 ms. Remains 123 /123 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 384 ms. Remains : 123/403 places, 123/374 transitions.
Discarding 15 transitions out of 123. Remains 108
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 2032 resets, run finished after 442 ms. (steps per millisecond=22 ) properties (out of 107) seen :56
Incomplete Best-First random walk after 1001 steps, including 61 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 64 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1000 steps, including 59 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1000 steps, including 62 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 63 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1000 steps, including 67 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1000 steps, including 64 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 62 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1000 steps, including 57 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 61 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1000 steps, including 66 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1000 steps, including 67 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1000 steps, including 43 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 62 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 65 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 68 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 60 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 73 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 58 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 67 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 64 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 62 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1000 steps, including 125 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 73 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1000 steps, including 75 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 69 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 68 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1000 steps, including 74 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1000 steps, including 56 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 67 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1000 steps, including 61 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1000 steps, including 61 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 58 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 51) seen :0
Running SMT prover for 51 properties.
// Phase 1: matrix 123 rows 123 cols
[2023-03-16 20:58:37] [INFO ] Computed 40 place invariants in 3 ms
[2023-03-16 20:58:38] [INFO ] [Real]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-16 20:58:38] [INFO ] [Real]Absence check using 22 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-16 20:58:38] [INFO ] After 202ms SMT Verify possible using state equation in real domain returned unsat :41 sat :2 real:8
[2023-03-16 20:58:38] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-16 20:58:38] [INFO ] After 15ms SMT Verify possible using 13 Read/Feed constraints in real domain returned unsat :41 sat :0 real:10
[2023-03-16 20:58:38] [INFO ] After 515ms SMT Verify possible using all constraints in real domain returned unsat :41 sat :0 real:10
[2023-03-16 20:58:38] [INFO ] [Nat]Absence check using 22 positive place invariants in 5 ms returned sat
[2023-03-16 20:58:38] [INFO ] [Nat]Absence check using 22 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-16 20:58:38] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :41 sat :10
[2023-03-16 20:58:38] [INFO ] After 70ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :41 sat :10
[2023-03-16 20:58:39] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 134 ms to minimize.
[2023-03-16 20:58:39] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2023-03-16 20:58:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 268 ms
[2023-03-16 20:58:39] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2023-03-16 20:58:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-03-16 20:58:39] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 2 ms to minimize.
[2023-03-16 20:58:39] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 1 ms to minimize.
[2023-03-16 20:58:39] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2023-03-16 20:58:39] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2023-03-16 20:58:39] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2023-03-16 20:58:39] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 339 ms
[2023-03-16 20:58:39] [INFO ] After 902ms SMT Verify possible using trap constraints in natural domain returned unsat :41 sat :10
Attempting to minimize the solution found.
Minimization took 79 ms.
[2023-03-16 20:58:39] [INFO ] After 1188ms SMT Verify possible using all constraints in natural domain returned unsat :41 sat :10
FORMULA QuasiLiveness FALSE TECHNIQUES RANDOM_WALK STRUCTURAL_REDUCTION TOPOLOGICAL INITIAL_STATE SAT_SMT
Total runtime 3413 ms.
ITS solved all properties within timeout

BK_STOP 1679000320627

--------------------
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="BusinessProcesses-PT-09"
export BK_EXAMINATION="QuasiLiveness"
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 BusinessProcesses-PT-09, 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 r053-tajo-167813705300322"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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