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.r011-oct2-167813600400557.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 smartxred
Input is AutonomousCar-PT-02b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-oct2-167813600400557
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 7.4K Feb 25 12:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 12:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 12:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 12:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 25 12:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 12:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 25 12:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 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 49K 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 AutonomousCar-PT-02b-UpperBounds-00
FORMULA_NAME AutonomousCar-PT-02b-UpperBounds-01
FORMULA_NAME AutonomousCar-PT-02b-UpperBounds-02
FORMULA_NAME AutonomousCar-PT-02b-UpperBounds-03
FORMULA_NAME AutonomousCar-PT-02b-UpperBounds-04
FORMULA_NAME AutonomousCar-PT-02b-UpperBounds-05
FORMULA_NAME AutonomousCar-PT-02b-UpperBounds-06
FORMULA_NAME AutonomousCar-PT-02b-UpperBounds-07
FORMULA_NAME AutonomousCar-PT-02b-UpperBounds-08
FORMULA_NAME AutonomousCar-PT-02b-UpperBounds-09
FORMULA_NAME AutonomousCar-PT-02b-UpperBounds-10
FORMULA_NAME AutonomousCar-PT-02b-UpperBounds-11
FORMULA_NAME AutonomousCar-PT-02b-UpperBounds-12
FORMULA_NAME AutonomousCar-PT-02b-UpperBounds-13
FORMULA_NAME AutonomousCar-PT-02b-UpperBounds-14
FORMULA_NAME AutonomousCar-PT-02b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678739984703

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=AutonomousCar-PT-02b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 20:39:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-13 20:39:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 20:39:47] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2023-03-13 20:39:47] [INFO ] Transformed 155 places.
[2023-03-13 20:39:47] [INFO ] Transformed 194 transitions.
[2023-03-13 20:39:47] [INFO ] Found NUPN structural information;
[2023-03-13 20:39:47] [INFO ] Parsed PT model containing 155 places and 194 transitions and 620 arcs in 121 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 194 rows 155 cols
[2023-03-13 20:39:47] [INFO ] Computed 7 place invariants in 8 ms
Incomplete random walk after 10000 steps, including 5 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 16) seen :11
FORMULA AutonomousCar-PT-02b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-02b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-02b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-02b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-02b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-02b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-02b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-02b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-02b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-02b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-02b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 5) seen :3
FORMULA AutonomousCar-PT-02b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-02b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-02b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-13 20:39:48] [INFO ] Invariant cache hit.
[2023-03-13 20:39:48] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2023-03-13 20:39:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:39:48] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2023-03-13 20:39:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 20:39:48] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-13 20:39:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 20:39:48] [INFO ] [Nat]Absence check using state equation in 272 ms returned sat
[2023-03-13 20:39:48] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 3 ms to minimize.
[2023-03-13 20:39:49] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 1 ms to minimize.
[2023-03-13 20:39:49] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2023-03-13 20:39:49] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2023-03-13 20:39:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 392 ms
[2023-03-13 20:39:49] [INFO ] Computed and/alt/rep : 151/208/151 causal constraints (skipped 42 transitions) in 14 ms.
[2023-03-13 20:39:49] [INFO ] Deduced a trap composed of 16 places in 156 ms of which 39 ms to minimize.
[2023-03-13 20:39:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2023-03-13 20:39:49] [INFO ] Added : 90 causal constraints over 18 iterations in 462 ms. Result :sat
Minimization took 55 ms.
[2023-03-13 20:39:49] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-13 20:39:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:39:49] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2023-03-13 20:39:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 20:39:50] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-13 20:39:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 20:39:50] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2023-03-13 20:39:50] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 0 ms to minimize.
[2023-03-13 20:39:50] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2023-03-13 20:39:50] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2023-03-13 20:39:50] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2023-03-13 20:39:50] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 0 ms to minimize.
[2023-03-13 20:39:50] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 419 ms
[2023-03-13 20:39:50] [INFO ] Computed and/alt/rep : 151/208/151 causal constraints (skipped 42 transitions) in 25 ms.
[2023-03-13 20:39:51] [INFO ] Added : 103 causal constraints over 21 iterations in 512 ms. Result :sat
Minimization took 86 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 194/194 transitions.
Graph (trivial) has 143 edges and 155 vertex of which 4 / 155 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 308 edges and 153 vertex of which 146 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 146 transition count 117
Reduce places removed 66 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 80 rules applied. Total rules applied 150 place count 80 transition count 103
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 158 place count 73 transition count 102
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 159 place count 72 transition count 102
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 159 place count 72 transition count 95
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 173 place count 65 transition count 95
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 186 place count 52 transition count 82
Iterating global reduction 4 with 13 rules applied. Total rules applied 199 place count 52 transition count 82
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 215 place count 52 transition count 66
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 215 place count 52 transition count 64
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 219 place count 50 transition count 64
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 222 place count 47 transition count 59
Iterating global reduction 5 with 3 rules applied. Total rules applied 225 place count 47 transition count 59
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 229 place count 47 transition count 55
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 231 place count 45 transition count 55
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 263 place count 29 transition count 39
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 265 place count 27 transition count 33
Iterating global reduction 7 with 2 rules applied. Total rules applied 267 place count 27 transition count 33
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 271 place count 25 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 272 place count 24 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 273 place count 23 transition count 38
Applied a total of 273 rules in 58 ms. Remains 23 /155 variables (removed 132) and now considering 38/194 (removed 156) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 23/155 places, 38/194 transitions.
// Phase 1: matrix 38 rows 23 cols
[2023-03-13 20:39:51] [INFO ] Computed 6 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 85595 resets, run finished after 881 ms. (steps per millisecond=1135 ) properties (out of 2) seen :2
FORMULA AutonomousCar-PT-02b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-02b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 4459 ms.
ITS solved all properties within timeout

BK_STOP 1678739992464

--------------------
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="AutonomousCar-PT-02b"
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 AutonomousCar-PT-02b, 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 r011-oct2-167813600400557"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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