Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r241-tall-171649628400206.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is LeafsetExtension-PT-S08C4, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r241-tall-171649628400206
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 652K
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.1K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 13:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Apr 12 13:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 12 13:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 12 13:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 254K May 18 16:42 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 LeafsetExtension-PT-S08C4-UpperBounds-00
FORMULA_NAME LeafsetExtension-PT-S08C4-UpperBounds-01
FORMULA_NAME LeafsetExtension-PT-S08C4-UpperBounds-02
FORMULA_NAME LeafsetExtension-PT-S08C4-UpperBounds-03
FORMULA_NAME LeafsetExtension-PT-S08C4-UpperBounds-04
FORMULA_NAME LeafsetExtension-PT-S08C4-UpperBounds-05
FORMULA_NAME LeafsetExtension-PT-S08C4-UpperBounds-06
FORMULA_NAME LeafsetExtension-PT-S08C4-UpperBounds-07
FORMULA_NAME LeafsetExtension-PT-S08C4-UpperBounds-08
FORMULA_NAME LeafsetExtension-PT-S08C4-UpperBounds-09
FORMULA_NAME LeafsetExtension-PT-S08C4-UpperBounds-10
FORMULA_NAME LeafsetExtension-PT-S08C4-UpperBounds-11
FORMULA_NAME LeafsetExtension-PT-S08C4-UpperBounds-12
FORMULA_NAME LeafsetExtension-PT-S08C4-UpperBounds-13
FORMULA_NAME LeafsetExtension-PT-S08C4-UpperBounds-14
FORMULA_NAME LeafsetExtension-PT-S08C4-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716562868563

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=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S08C4
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-24 15:01:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 15:01:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 15:01:10] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2024-05-24 15:01:10] [INFO ] Transformed 462 places.
[2024-05-24 15:01:10] [INFO ] Transformed 409 transitions.
[2024-05-24 15:01:10] [INFO ] Parsed PT model containing 462 places and 409 transitions and 1324 arcs in 130 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
// Phase 1: matrix 409 rows 462 cols
[2024-05-24 15:01:10] [INFO ] Computed 53 invariants in 36 ms
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 293 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 15) seen :17
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :9
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :9
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :8
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 9) seen :8
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :9
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 9) seen :7
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 9) seen :8
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 9) seen :8
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 9) seen :8
[2024-05-24 15:01:10] [INFO ] Invariant cache hit.
[2024-05-24 15:01:10] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-24 15:01:10] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 12 ms returned unsat
[2024-05-24 15:01:10] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-24 15:01:11] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 12 ms returned sat
[2024-05-24 15:01:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 15:01:11] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2024-05-24 15:01:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 15:01:11] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-24 15:01:11] [INFO ] [Nat]Absence check using 11 positive and 42 generalized place invariants in 10 ms returned sat
[2024-05-24 15:01:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 15:01:11] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2024-05-24 15:01:11] [INFO ] Computed and/alt/rep : 398/600/398 causal constraints (skipped 2 transitions) in 25 ms.
[2024-05-24 15:01:11] [INFO ] Added : 19 causal constraints over 4 iterations in 192 ms. Result :sat
Minimization took 45 ms.
[2024-05-24 15:01:11] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-24 15:01:11] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 9 ms returned unsat
[2024-05-24 15:01:11] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-24 15:01:11] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 9 ms returned unsat
[2024-05-24 15:01:11] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-24 15:01:11] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 9 ms returned unsat
[2024-05-24 15:01:11] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-24 15:01:12] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 11 ms returned unsat
[2024-05-24 15:01:12] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-24 15:01:12] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 7 ms returned unsat
[2024-05-24 15:01:12] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-24 15:01:12] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 10 ms returned sat
[2024-05-24 15:01:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 15:01:12] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2024-05-24 15:01:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 15:01:12] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-24 15:01:12] [INFO ] [Nat]Absence check using 11 positive and 42 generalized place invariants in 10 ms returned sat
[2024-05-24 15:01:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 15:01:12] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2024-05-24 15:01:12] [INFO ] Computed and/alt/rep : 398/600/398 causal constraints (skipped 2 transitions) in 23 ms.
[2024-05-24 15:01:12] [INFO ] Added : 19 causal constraints over 4 iterations in 178 ms. Result :sat
Minimization took 42 ms.
[2024-05-24 15:01:12] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-24 15:01:12] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 8 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, -1, 1, 1, 1, 1, 1, -1, 1] Max seen :[1, 2, 1, 1, 1, 1, 1, 2, 1]
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 409/409 transitions.
Graph (complete) has 849 edges and 462 vertex of which 46 are kept as prefixes of interest. Removing 416 places using SCC suffix rule.2 ms
Discarding 416 places :
Also discarding 280 output transitions
Drop transitions removed 280 transitions
Drop transitions removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 85 rules applied. Total rules applied 86 place count 46 transition count 44
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 97 place count 35 transition count 44
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 97 place count 35 transition count 42
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 101 place count 33 transition count 42
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 107 place count 27 transition count 36
Iterating global reduction 2 with 6 rules applied. Total rules applied 113 place count 27 transition count 36
Free-agglomeration rule applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 121 place count 27 transition count 28
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 129 place count 19 transition count 28
Applied a total of 129 rules in 22 ms. Remains 19 /462 variables (removed 443) and now considering 28/409 (removed 381) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 19/462 places, 28/409 transitions.
Normalized transition count is 20 out of 28 initially.
// Phase 1: matrix 20 rows 19 cols
[2024-05-24 15:01:12] [INFO ] Computed 3 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 60603 resets, run finished after 771 ms. (steps per millisecond=1297 ) properties (out of 2) seen :8
Incomplete Best-First random walk after 1000000 steps, including 14690 resets, run finished after 295 ms. (steps per millisecond=3389 ) properties (out of 2) seen :8
Incomplete Best-First random walk after 1000001 steps, including 14622 resets, run finished after 298 ms. (steps per millisecond=3355 ) properties (out of 2) seen :8
[2024-05-24 15:01:14] [INFO ] Flow matrix only has 20 transitions (discarded 8 similar events)
// Phase 1: matrix 20 rows 19 cols
[2024-05-24 15:01:14] [INFO ] Computed 3 invariants in 1 ms
[2024-05-24 15:01:14] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-24 15:01:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 15:01:14] [INFO ] [Real]Absence check using state equation in 9 ms returned unsat
[2024-05-24 15:01:14] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-24 15:01:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 15:01:14] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
Current structural bounds on expressions (after SMT) : [4, 4] Max seen :[4, 4]
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-13 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 3969 ms.

BK_STOP 1716562876897

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="LeafsetExtension-PT-S08C4"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is LeafsetExtension-PT-S08C4, 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 r241-tall-171649628400206"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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