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.r043-tajo-167813696900493.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 smartxred
Input is BusinessProcesses-PT-06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-tajo-167813696900493
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 8.0K Feb 25 16:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 16:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 16:50 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:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Feb 25 16:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 25 16:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 25 16:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:38 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 85K 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 positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-06-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-06-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-06-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-06-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-06-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-06-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-06-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-06-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-06-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-06-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-06-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-06-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-06-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-06-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-06-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678790217387

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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-06
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 10:37:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-14 10:37:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 10:37:00] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2023-03-14 10:37:00] [INFO ] Transformed 376 places.
[2023-03-14 10:37:00] [INFO ] Transformed 297 transitions.
[2023-03-14 10:37:00] [INFO ] Found NUPN structural information;
[2023-03-14 10:37:00] [INFO ] Parsed PT model containing 376 places and 297 transitions and 830 arcs in 217 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-06-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 296 rows 375 cols
[2023-03-14 10:37:00] [INFO ] Computed 81 place invariants in 37 ms
Incomplete random walk after 10000 steps, including 104 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 15) seen :11
FORMULA BusinessProcesses-PT-06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :2
FORMULA BusinessProcesses-PT-06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
[2023-03-14 10:37:00] [INFO ] Invariant cache hit.
[2023-03-14 10:37:01] [INFO ] [Real]Absence check using 42 positive place invariants in 50 ms returned sat
[2023-03-14 10:37:01] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 59 ms returned sat
[2023-03-14 10:37:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:37:01] [INFO ] [Real]Absence check using state equation in 219 ms returned sat
[2023-03-14 10:37:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:37:01] [INFO ] [Nat]Absence check using 42 positive place invariants in 17 ms returned sat
[2023-03-14 10:37:01] [INFO ] [Nat]Absence check using 42 positive and 39 generalized place invariants in 16 ms returned sat
[2023-03-14 10:37:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:37:01] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2023-03-14 10:37:01] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 3 ms to minimize.
[2023-03-14 10:37:02] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 1 ms to minimize.
[2023-03-14 10:37:02] [INFO ] Deduced a trap composed of 24 places in 670 ms of which 28 ms to minimize.
[2023-03-14 10:37:02] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 2 ms to minimize.
[2023-03-14 10:37:03] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 1 ms to minimize.
[2023-03-14 10:37:03] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2023-03-14 10:37:03] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 0 ms to minimize.
[2023-03-14 10:37:03] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 1 ms to minimize.
[2023-03-14 10:37:03] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1449 ms
[2023-03-14 10:37:03] [INFO ] Computed and/alt/rep : 272/351/272 causal constraints (skipped 23 transitions) in 38 ms.
[2023-03-14 10:37:04] [INFO ] Added : 229 causal constraints over 47 iterations in 1167 ms. Result :sat
Minimization took 68 ms.
[2023-03-14 10:37:04] [INFO ] [Real]Absence check using 42 positive place invariants in 12 ms returned sat
[2023-03-14 10:37:04] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 35 ms returned sat
[2023-03-14 10:37:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:37:04] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2023-03-14 10:37:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:37:04] [INFO ] [Nat]Absence check using 42 positive place invariants in 12 ms returned sat
[2023-03-14 10:37:04] [INFO ] [Nat]Absence check using 42 positive and 39 generalized place invariants in 10 ms returned sat
[2023-03-14 10:37:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:37:05] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2023-03-14 10:37:05] [INFO ] Deduced a trap composed of 82 places in 134 ms of which 1 ms to minimize.
[2023-03-14 10:37:05] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 1 ms to minimize.
[2023-03-14 10:37:05] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 0 ms to minimize.
[2023-03-14 10:37:05] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 1 ms to minimize.
[2023-03-14 10:37:05] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 1 ms to minimize.
[2023-03-14 10:37:05] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
[2023-03-14 10:37:05] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 1 ms to minimize.
[2023-03-14 10:37:06] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 0 ms to minimize.
[2023-03-14 10:37:06] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 1 ms to minimize.
[2023-03-14 10:37:06] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 1 ms to minimize.
[2023-03-14 10:37:06] [INFO ] Deduced a trap composed of 79 places in 121 ms of which 0 ms to minimize.
[2023-03-14 10:37:06] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1491 ms
[2023-03-14 10:37:06] [INFO ] Computed and/alt/rep : 272/351/272 causal constraints (skipped 23 transitions) in 33 ms.
[2023-03-14 10:37:07] [INFO ] Added : 240 causal constraints over 48 iterations in 1169 ms. Result :sat
Minimization took 68 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 375 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 375/375 places, 296/296 transitions.
Graph (trivial) has 197 edges and 375 vertex of which 7 / 375 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 684 edges and 369 vertex of which 366 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 69 rules applied. Total rules applied 71 place count 366 transition count 218
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 139 place count 298 transition count 218
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 139 place count 298 transition count 153
Deduced a syphon composed of 65 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 139 rules applied. Total rules applied 278 place count 224 transition count 153
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 319 place count 183 transition count 112
Iterating global reduction 2 with 41 rules applied. Total rules applied 360 place count 183 transition count 112
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 502 place count 108 transition count 45
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 503 place count 108 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 504 place count 107 transition count 44
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 505 place count 107 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 506 place count 106 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 507 place count 105 transition count 43
Applied a total of 507 rules in 140 ms. Remains 105 /375 variables (removed 270) and now considering 43/296 (removed 253) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 105/375 places, 43/296 transitions.
// Phase 1: matrix 43 rows 105 cols
[2023-03-14 10:37:08] [INFO ] Computed 62 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 23255 resets, run finished after 2320 ms. (steps per millisecond=431 ) properties (out of 2) seen :2
FORMULA BusinessProcesses-PT-06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 10208 ms.
ITS solved all properties within timeout

BK_STOP 1678790230791

--------------------
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 UpperBounds -timeout 360 -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-06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 smartxred"
echo " Input is BusinessProcesses-PT-06, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r043-tajo-167813696900493"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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