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-167813697200669.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 CANConstruction-PT-070, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-tajo-167813697200669
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.8M
-rw-r--r-- 1 mcc users 11K Feb 25 22:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 22:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 25 21:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 21:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 22:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Feb 25 22:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 22:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 22:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:40 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 7.3M 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 CANConstruction-PT-070-UpperBounds-00
FORMULA_NAME CANConstruction-PT-070-UpperBounds-01
FORMULA_NAME CANConstruction-PT-070-UpperBounds-02
FORMULA_NAME CANConstruction-PT-070-UpperBounds-03
FORMULA_NAME CANConstruction-PT-070-UpperBounds-04
FORMULA_NAME CANConstruction-PT-070-UpperBounds-05
FORMULA_NAME CANConstruction-PT-070-UpperBounds-06
FORMULA_NAME CANConstruction-PT-070-UpperBounds-07
FORMULA_NAME CANConstruction-PT-070-UpperBounds-08
FORMULA_NAME CANConstruction-PT-070-UpperBounds-09
FORMULA_NAME CANConstruction-PT-070-UpperBounds-10
FORMULA_NAME CANConstruction-PT-070-UpperBounds-11
FORMULA_NAME CANConstruction-PT-070-UpperBounds-12
FORMULA_NAME CANConstruction-PT-070-UpperBounds-13
FORMULA_NAME CANConstruction-PT-070-UpperBounds-14
FORMULA_NAME CANConstruction-PT-070-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678799118170

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=CANConstruction-PT-070
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 13:05:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-14 13:05:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 13:05:20] [INFO ] Load time of PNML (sax parser for PT used): 429 ms
[2023-03-14 13:05:20] [INFO ] Transformed 10642 places.
[2023-03-14 13:05:20] [INFO ] Transformed 20160 transitions.
[2023-03-14 13:05:20] [INFO ] Parsed PT model containing 10642 places and 20160 transitions and 60200 arcs in 590 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 20160 rows 10642 cols
[2023-03-14 13:05:20] [INFO ] Computed 141 place invariants in 299 ms
Incomplete random walk after 10000 steps, including 8 resets, run finished after 276 ms. (steps per millisecond=36 ) properties (out of 16) seen :4
FORMULA CANConstruction-PT-070-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :0
[2023-03-14 13:05:21] [INFO ] Invariant cache hit.
[2023-03-14 13:05:23] [INFO ] [Real]Absence check using 71 positive place invariants in 292 ms returned sat
[2023-03-14 13:05:23] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 47 ms returned sat
[2023-03-14 13:05:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 13:05:26] [INFO ] [Real]Absence check using state equation in 3589 ms returned unknown
[2023-03-14 13:05:28] [INFO ] [Real]Absence check using 71 positive place invariants in 263 ms returned sat
[2023-03-14 13:05:28] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 57 ms returned sat
[2023-03-14 13:05:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 13:05:31] [INFO ] [Real]Absence check using state equation in 3516 ms returned unknown
[2023-03-14 13:05:33] [INFO ] [Real]Absence check using 71 positive place invariants in 269 ms returned sat
[2023-03-14 13:05:33] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 58 ms returned sat
[2023-03-14 13:05:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 13:05:36] [INFO ] [Real]Absence check using state equation in 3581 ms returned unknown
[2023-03-14 13:05:37] [INFO ] [Real]Absence check using 71 positive place invariants in 261 ms returned sat
[2023-03-14 13:05:37] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 59 ms returned sat
[2023-03-14 13:05:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 13:05:41] [INFO ] [Real]Absence check using state equation in 3859 ms returned unknown
[2023-03-14 13:05:42] [INFO ] [Real]Absence check using 71 positive place invariants in 250 ms returned sat
[2023-03-14 13:05:42] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 59 ms returned sat
[2023-03-14 13:05:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 13:05:46] [INFO ] [Real]Absence check using state equation in 3849 ms returned unknown
[2023-03-14 13:05:48] [INFO ] [Real]Absence check using 71 positive place invariants in 329 ms returned sat
[2023-03-14 13:05:48] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 70 ms returned sat
[2023-03-14 13:05:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 13:05:51] [INFO ] [Real]Absence check using state equation in 3537 ms returned unknown
[2023-03-14 13:05:53] [INFO ] [Real]Absence check using 71 positive place invariants in 310 ms returned sat
[2023-03-14 13:05:53] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 59 ms returned sat
[2023-03-14 13:05:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 13:05:56] [INFO ] [Real]Absence check using state equation in 3406 ms returned unknown
[2023-03-14 13:05:58] [INFO ] [Real]Absence check using 71 positive place invariants in 314 ms returned sat
[2023-03-14 13:05:58] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 69 ms returned sat
[2023-03-14 13:05:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 13:06:01] [INFO ] [Real]Absence check using state equation in 3482 ms returned unknown
[2023-03-14 13:06:03] [INFO ] [Real]Absence check using 71 positive place invariants in 227 ms returned sat
[2023-03-14 13:06:03] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 52 ms returned sat
[2023-03-14 13:06:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 13:06:06] [INFO ] [Real]Absence check using state equation in 3640 ms returned unknown
[2023-03-14 13:06:08] [INFO ] [Real]Absence check using 71 positive place invariants in 228 ms returned sat
[2023-03-14 13:06:08] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 51 ms returned sat
[2023-03-14 13:06:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 13:06:11] [INFO ] [Real]Absence check using state equation in 3647 ms returned unknown
[2023-03-14 13:06:13] [INFO ] [Real]Absence check using 71 positive place invariants in 293 ms returned sat
[2023-03-14 13:06:13] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 54 ms returned sat
[2023-03-14 13:06:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 13:06:16] [INFO ] [Real]Absence check using state equation in 3451 ms returned unknown
[2023-03-14 13:06:18] [INFO ] [Real]Absence check using 71 positive place invariants in 242 ms returned sat
[2023-03-14 13:06:18] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 56 ms returned sat
[2023-03-14 13:06:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 13:06:21] [INFO ] [Real]Absence check using state equation in 3645 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 12 out of 10642 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10642/10642 places, 20160/20160 transitions.
Drop transitions removed 490 transitions
Trivial Post-agglo rules discarded 490 transitions
Performed 490 trivial Post agglomeration. Transition count delta: 490
Iterating post reduction 0 with 490 rules applied. Total rules applied 490 place count 10642 transition count 19670
Reduce places removed 490 places and 0 transitions.
Iterating post reduction 1 with 490 rules applied. Total rules applied 980 place count 10152 transition count 19670
Discarding 4752 places :
Symmetric choice reduction at 2 with 4752 rule applications. Total rules 5732 place count 5400 transition count 10166
Iterating global reduction 2 with 4752 rules applied. Total rules applied 10484 place count 5400 transition count 10166
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 6 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 10624 place count 5330 transition count 10096
Free-agglomeration rule applied 124 times.
Iterating global reduction 2 with 124 rules applied. Total rules applied 10748 place count 5330 transition count 9972
Reduce places removed 124 places and 0 transitions.
Iterating post reduction 2 with 124 rules applied. Total rules applied 10872 place count 5206 transition count 9972
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 3 with 16 rules applied. Total rules applied 10888 place count 5206 transition count 9972
Applied a total of 10888 rules in 5807 ms. Remains 5206 /10642 variables (removed 5436) and now considering 9972/20160 (removed 10188) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5813 ms. Remains : 5206/10642 places, 9972/20160 transitions.
// Phase 1: matrix 9972 rows 5206 cols
[2023-03-14 13:06:27] [INFO ] Computed 141 place invariants in 92 ms
Incomplete random walk after 1000000 steps, including 2065 resets, run finished after 17914 ms. (steps per millisecond=55 ) properties (out of 12) seen :12
FORMULA CANConstruction-PT-070-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 85944 ms.
ITS solved all properties within timeout

BK_STOP 1678799205907

--------------------
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="CANConstruction-PT-070"
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 CANConstruction-PT-070, 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-167813697200669"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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